/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-e23131f-m [2024-05-03 05:39:48,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-03 05:39:48,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-03 05:39:48,415 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-03 05:39:48,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-03 05:39:48,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-03 05:39:48,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-03 05:39:48,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-03 05:39:48,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-03 05:39:48,442 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-03 05:39:48,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-03 05:39:48,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-03 05:39:48,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-03 05:39:48,444 INFO L153 SettingsManager]: * Use SBE=true [2024-05-03 05:39:48,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-03 05:39:48,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-03 05:39:48,445 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-03 05:39:48,445 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-03 05:39:48,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-03 05:39:48,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-03 05:39:48,445 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-03 05:39:48,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-03 05:39:48,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-03 05:39:48,447 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-03 05:39:48,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-03 05:39:48,447 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-03 05:39:48,447 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-03 05:39:48,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-03 05:39:48,448 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-03 05:39:48,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-03 05:39:48,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 05:39:48,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-03 05:39:48,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-03 05:39:48,449 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-03 05:39:48,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-03 05:39:48,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-03 05:39:48,450 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-03 05:39:48,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-03 05:39:48,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-03 05:39:48,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-03 05:39:48,450 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-03 05:39:48,451 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:39:48,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-03 05:39:48,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-03 05:39:48,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-03 05:39:48,677 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-03 05:39:48,677 INFO L274 PluginConnector]: CDTParser initialized [2024-05-03 05:39:48,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c [2024-05-03 05:39:49,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-03 05:39:49,917 INFO L384 CDTParser]: Found 1 translation units. [2024-05-03 05:39:49,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c [2024-05-03 05:39:49,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5431b0780/bfb9be1ad1444abc8300a4ab863ec08f/FLAG5bcd45d38 [2024-05-03 05:39:49,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5431b0780/bfb9be1ad1444abc8300a4ab863ec08f [2024-05-03 05:39:49,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-03 05:39:49,948 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-03 05:39:49,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-03 05:39:49,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-03 05:39:49,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-03 05:39:49,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 05:39:49" (1/1) ... [2024-05-03 05:39:49,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@baeb2b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:39:49, skipping insertion in model container [2024-05-03 05:39:49,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 05:39:49" (1/1) ... [2024-05-03 05:39:49,978 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-03 05:39:50,094 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c[2808,2821] [2024-05-03 05:39:50,104 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 05:39:50,111 INFO L202 MainTranslator]: Completed pre-run [2024-05-03 05:39:50,126 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-4.wvr.c[2808,2821] [2024-05-03 05:39:50,128 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 05:39:50,138 INFO L206 MainTranslator]: Completed translation [2024-05-03 05:39:50,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:39:50 WrapperNode [2024-05-03 05:39:50,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-03 05:39:50,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-03 05:39:50,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-03 05:39:50,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-03 05:39:50,145 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:39:50" (1/1) ... [2024-05-03 05:39:50,150 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:39:50" (1/1) ... [2024-05-03 05:39:50,175 INFO L138 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 186 [2024-05-03 05:39:50,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-03 05:39:50,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-03 05:39:50,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-03 05:39:50,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-03 05:39:50,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:39:50" (1/1) ... [2024-05-03 05:39:50,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:39:50" (1/1) ... [2024-05-03 05:39:50,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:39:50" (1/1) ... [2024-05-03 05:39:50,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:39:50" (1/1) ... [2024-05-03 05:39:50,216 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:39:50" (1/1) ... [2024-05-03 05:39:50,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:39:50" (1/1) ... [2024-05-03 05:39:50,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:39:50" (1/1) ... [2024-05-03 05:39:50,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:39:50" (1/1) ... [2024-05-03 05:39:50,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-03 05:39:50,224 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-03 05:39:50,224 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-03 05:39:50,224 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-03 05:39:50,224 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:39:50" (1/1) ... [2024-05-03 05:39:50,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 05:39:50,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:39:50,270 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:39:50,275 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:39:50,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-03 05:39:50,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-03 05:39:50,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-03 05:39:50,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-03 05:39:50,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-03 05:39:50,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-03 05:39:50,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-03 05:39:50,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-03 05:39:50,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-03 05:39:50,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-03 05:39:50,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-03 05:39:50,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-03 05:39:50,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-03 05:39:50,307 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:39:50,379 INFO L241 CfgBuilder]: Building ICFG [2024-05-03 05:39:50,381 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-03 05:39:50,665 INFO L282 CfgBuilder]: Performing block encoding [2024-05-03 05:39:50,675 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-03 05:39:50,675 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-03 05:39:50,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 05:39:50 BoogieIcfgContainer [2024-05-03 05:39:50,675 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-03 05:39:50,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-03 05:39:50,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-03 05:39:50,679 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-03 05:39:50,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 05:39:49" (1/3) ... [2024-05-03 05:39:50,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7650397e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 05:39:50, skipping insertion in model container [2024-05-03 05:39:50,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:39:50" (2/3) ... [2024-05-03 05:39:50,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7650397e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 05:39:50, skipping insertion in model container [2024-05-03 05:39:50,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 05:39:50" (3/3) ... [2024-05-03 05:39:50,681 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-4.wvr.c [2024-05-03 05:39:50,688 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-03 05:39:50,695 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-03 05:39:50,695 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-03 05:39:50,695 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-03 05:39:50,808 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-03 05:39:50,871 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 05:39:50,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 05:39:50,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:39:50,880 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:39:50,882 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:39:50,911 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 05:39:50,932 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 05:39:50,939 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;@1855dd6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 05:39:50,939 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 05:39:50,945 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:39:51,100 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:51,101 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:51,101 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:51,195 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:51,196 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:51,196 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:51,272 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:51,272 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:51,272 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:51,316 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:51,317 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:51,317 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:51,372 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:51,372 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:51,372 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:51,466 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:51,466 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:51,467 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:51,507 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:51,507 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:51,508 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:51,539 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:51,539 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:51,539 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:51,565 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:51,565 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:51,565 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:51,622 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:51,622 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:51,622 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:51,677 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:51,678 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:51,678 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:51,703 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:51,704 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:51,704 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:51,835 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:51,835 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:51,836 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:51,841 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1500 states. [2024-05-03 05:39:51,841 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:39:51,843 INFO L78 Accepts]: Start accepts. Automaton has currently 1598 states, but on-demand construction may add more states Word has length 135 [2024-05-03 05:39:51,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:39:51,847 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:39:51,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:39:51,853 INFO L85 PathProgramCache]: Analyzing trace with hash 208418314, now seen corresponding path program 1 times [2024-05-03 05:39:51,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:39:51,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979002121] [2024-05-03 05:39:51,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:39:51,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:39:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:39:52,141 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:39:52,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:39:52,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979002121] [2024-05-03 05:39:52,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979002121] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 05:39:52,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 05:39:52,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 05:39:52,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884221437] [2024-05-03 05:39:52,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 05:39:52,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 05:39:52,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:39:52,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 05:39:52,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 05:39:52,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:39:52,174 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:39:52,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.5) internal successors, (135), 2 states have internal predecessors, (135), 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:52,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:39:52,176 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:39:52,225 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:52,225 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:52,225 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:52,247 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:52,247 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:52,247 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:52,276 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:52,277 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:52,277 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:52,303 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:52,303 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:52,303 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:52,324 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:52,324 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:52,324 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:52,355 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:52,355 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:52,355 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:52,390 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:52,391 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:52,391 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:52,413 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:52,413 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:52,413 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:52,435 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:52,435 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:52,436 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:52,476 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:52,477 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:52,477 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:52,532 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:52,533 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:52,533 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:52,557 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:52,557 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:52,557 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:52,695 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:52,695 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:52,695 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:52,705 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1619 states. [2024-05-03 05:39:52,705 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:39:52,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:39:52,706 INFO L78 Accepts]: Start accepts. Automaton has currently 1807 states, but on-demand construction may add more states Word has length 128 [2024-05-03 05:39:52,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:39:52,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-03 05:39:52,711 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:39:52,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:39:52,715 INFO L85 PathProgramCache]: Analyzing trace with hash 663841822, now seen corresponding path program 1 times [2024-05-03 05:39:52,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:39:52,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747813765] [2024-05-03 05:39:52,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:39:52,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:39:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:39:53,253 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:39:53,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:39:53,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747813765] [2024-05-03 05:39:53,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747813765] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 05:39:53,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 05:39:53,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-03 05:39:53,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310409218] [2024-05-03 05:39:53,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 05:39:53,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-03 05:39:53,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:39:53,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-03 05:39:53,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-03 05:39:53,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:39:53,258 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:39:53,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 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,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:39:53,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:39:53,259 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:39:53,428 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:53,428 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:53,428 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:53,460 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:53,460 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:53,460 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:53,530 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:53,530 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:53,530 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:53,556 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:53,556 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:53,557 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:53,590 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:53,593 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:53,593 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:53,621 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:53,621 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:53,621 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:53,654 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:53,654 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:53,654 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:53,676 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:53,676 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:53,676 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:53,699 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:53,699 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:53,700 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:53,738 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:53,739 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:53,739 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:53,767 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:53,768 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:53,768 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:53,789 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:53,789 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:53,790 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:53,905 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:53,905 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:53,906 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:53,919 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1638 states. [2024-05-03 05:39:53,920 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:39:53,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:39:53,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:39:53,921 INFO L78 Accepts]: Start accepts. Automaton has currently 1826 states, but on-demand construction may add more states Word has length 141 [2024-05-03 05:39:53,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:39:53,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-03 05:39:53,923 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:39:53,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:39:53,923 INFO L85 PathProgramCache]: Analyzing trace with hash 545976549, now seen corresponding path program 1 times [2024-05-03 05:39:53,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:39:53,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006707034] [2024-05-03 05:39:53,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:39:53,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:39:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:39:54,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:39:54,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:39:54,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006707034] [2024-05-03 05:39:54,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006707034] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:39:54,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491837978] [2024-05-03 05:39:54,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:39:54,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:39:54,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:39:54,339 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:39:54,364 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:39:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:39:54,439 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 9 conjunts are in the unsatisfiable core [2024-05-03 05:39:54,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:39:54,622 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:39:54,622 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-03 05:39:54,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491837978] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 05:39:54,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-03 05:39:54,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-05-03 05:39:54,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850156395] [2024-05-03 05:39:54,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 05:39:54,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-03 05:39:54,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:39:54,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-03 05:39:54,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2024-05-03 05:39:54,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:39:54,625 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:39:54,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.625) internal successors, (141), 8 states have internal predecessors, (141), 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:54,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:39:54,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:39:54,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:39:54,626 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:39:54,756 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:54,757 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:54,757 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:54,775 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:54,776 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:54,776 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:54,808 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:54,808 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:54,808 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:54,834 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:54,834 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:54,834 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:54,854 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:54,854 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:54,855 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:54,934 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:54,935 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:54,935 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:54,968 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:54,968 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:54,968 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:54,993 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:54,993 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:54,993 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:55,013 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:55,013 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:55,013 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:55,049 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:55,049 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:55,049 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:55,075 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:55,075 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:55,075 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:55,097 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:55,097 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:55,097 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:55,206 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:55,207 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:55,207 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:55,217 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1646 states. [2024-05-03 05:39:55,217 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:39:55,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:39:55,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:39:55,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:39:55,217 INFO L78 Accepts]: Start accepts. Automaton has currently 1834 states, but on-demand construction may add more states Word has length 149 [2024-05-03 05:39:55,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:39:55,236 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:39:55,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-05-03 05:39:55,424 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:39:55,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:39:55,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1130861759, now seen corresponding path program 1 times [2024-05-03 05:39:55,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:39:55,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935133523] [2024-05-03 05:39:55,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:39:55,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:39:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:39:55,802 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:39:55,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:39:55,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935133523] [2024-05-03 05:39:55,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935133523] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:39:55,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396877029] [2024-05-03 05:39:55,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:39:55,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:39:55,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:39:55,807 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:39:55,836 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:39:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:39:55,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 33 conjunts are in the unsatisfiable core [2024-05-03 05:39:55,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:39:56,454 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:39:56,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:39:56,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:39:56,977 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-03 05:39:56,977 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:39:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:39:57,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396877029] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:39:57,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:39:57,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 18] total 38 [2024-05-03 05:39:57,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80779576] [2024-05-03 05:39:57,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:39:57,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-05-03 05:39:57,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:39:57,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-05-03 05:39:57,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1288, Unknown=0, NotChecked=0, Total=1406 [2024-05-03 05:39:57,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:39:57,664 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:39:57,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 10.342105263157896) internal successors, (393), 38 states have internal predecessors, (393), 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:57,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:39:57,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:39:57,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:39:57,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:39:57,664 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:39:58,564 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:58,564 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:58,564 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:58,812 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:58,812 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:58,812 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:58,879 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:58,880 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:58,880 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:58,906 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:58,907 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:58,907 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:58,930 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:58,931 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:58,931 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:58,949 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:58,949 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:58,949 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:58,979 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:58,980 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:58,980 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:59,017 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:59,017 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:59,017 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:59,035 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:59,036 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:59,036 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:59,054 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:59,054 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:59,054 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:59,086 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:59,086 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:59,086 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:59,110 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:59,110 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:59,110 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:59,129 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:59,129 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:59,129 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:59,219 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:39:59,219 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:39:59,219 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:39:59,259 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1824 states. [2024-05-03 05:39:59,259 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:39:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:39:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:39:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:39:59,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-03 05:39:59,260 INFO L78 Accepts]: Start accepts. Automaton has currently 2019 states, but on-demand construction may add more states Word has length 170 [2024-05-03 05:39:59,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:39:59,268 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:39:59,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:39:59,468 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:39:59,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:39:59,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1456062026, now seen corresponding path program 2 times [2024-05-03 05:39:59,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:39:59,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394325598] [2024-05-03 05:39:59,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:39:59,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:39:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:39:59,874 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-03 05:39:59,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:39:59,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394325598] [2024-05-03 05:39:59,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394325598] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:39:59,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366654599] [2024-05-03 05:39:59,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-03 05:39:59,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:39:59,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:39:59,875 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:39:59,902 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:39:59,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-03 05:39:59,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:39:59,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 22 conjunts are in the unsatisfiable core [2024-05-03 05:39:59,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:40:00,158 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-03 05:40:00,158 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:40:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-03 05:40:00,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366654599] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:40:00,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:40:00,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2024-05-03 05:40:00,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226619979] [2024-05-03 05:40:00,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:40:00,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-03 05:40:00,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:40:00,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-03 05:40:00,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2024-05-03 05:40:00,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:40:00,458 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:40:00,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.565217391304348) internal successors, (220), 23 states have internal predecessors, (220), 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:00,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:40:00,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:40:00,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:40:00,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-03 05:40:00,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:40:00,459 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:40:00,737 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:00,737 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:00,737 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:00,915 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:00,915 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:00,915 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:01,085 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:01,085 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:01,085 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:01,118 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:01,118 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:01,118 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:01,149 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:01,149 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:01,149 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:01,176 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:01,176 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:01,176 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:01,194 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:01,194 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:01,194 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:01,217 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:01,218 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:01,218 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:01,339 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:01,339 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:01,339 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:01,377 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:01,377 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:01,377 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:01,434 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:01,434 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:01,434 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:01,493 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:01,494 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:01,494 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:01,521 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:01,522 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:01,522 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:01,543 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:01,544 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:01,544 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:01,645 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:01,645 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:01,645 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:01,664 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1996 states. [2024-05-03 05:40:01,664 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:40:01,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:40:01,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:40:01,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:40:01,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-03 05:40:01,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-03 05:40:01,665 INFO L78 Accepts]: Start accepts. Automaton has currently 2194 states, but on-demand construction may add more states Word has length 183 [2024-05-03 05:40:01,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:40:01,687 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:40:01,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:40:01,872 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:40:01,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:40:01,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1225164345, now seen corresponding path program 3 times [2024-05-03 05:40:01,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:40:01,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512668823] [2024-05-03 05:40:01,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:40:01,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:40:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:40:05,732 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:40:05,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:40:05,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512668823] [2024-05-03 05:40:05,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512668823] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:40:05,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127827372] [2024-05-03 05:40:05,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-03 05:40:05,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:40:05,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:40:05,734 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:40:05,757 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:40:05,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-05-03 05:40:05,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:40:05,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 64 conjunts are in the unsatisfiable core [2024-05-03 05:40:05,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:40:08,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 05:40:08,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 47 [2024-05-03 05:40:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:40:08,261 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:40:09,699 INFO L349 Elim1Store]: treesize reduction 15, result has 90.2 percent of original size [2024-05-03 05:40:09,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 132 treesize of output 189 [2024-05-03 05:40:10,840 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:40:10,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127827372] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:40:10,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:40:10,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 37, 31] total 95 [2024-05-03 05:40:10,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732863991] [2024-05-03 05:40:10,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:40:10,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2024-05-03 05:40:10,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:40:10,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2024-05-03 05:40:10,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=707, Invalid=8223, Unknown=0, NotChecked=0, Total=8930 [2024-05-03 05:40:10,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:40:10,845 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:40:10,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 5.063157894736842) internal successors, (481), 95 states have internal predecessors, (481), 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:10,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:40:10,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:40:10,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:40:10,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-03 05:40:10,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-05-03 05:40:10,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:40:10,846 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:40:13,219 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:13,219 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:13,219 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:13,800 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:13,800 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:13,800 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:14,491 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:14,491 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:14,491 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:15,037 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:15,037 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:15,037 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:15,961 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:15,961 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:15,961 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:15,999 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:16,000 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:16,000 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:16,014 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:16,015 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:16,015 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:16,030 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:16,030 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:16,030 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:16,055 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:16,055 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:16,055 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:16,075 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:16,076 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:16,076 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:16,096 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:16,096 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:16,096 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:16,244 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:16,244 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:16,244 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:16,420 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1926 states. [2024-05-03 05:40:16,420 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:40:16,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:40:16,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:40:16,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:40:16,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-03 05:40:16,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-03 05:40:16,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-05-03 05:40:16,421 INFO L78 Accepts]: Start accepts. Automaton has currently 2175 states, but on-demand construction may add more states Word has length 204 [2024-05-03 05:40:16,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:40:16,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-05-03 05:40:16,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-05-03 05:40:16,623 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:40:16,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:40:16,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1832982128, now seen corresponding path program 4 times [2024-05-03 05:40:16,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:40:16,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416385872] [2024-05-03 05:40:16,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:40:16,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:40:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:40:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 2 proven. 80 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-03 05:40:17,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:40:17,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416385872] [2024-05-03 05:40:17,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416385872] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:40:17,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889846778] [2024-05-03 05:40:17,026 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-03 05:40:17,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:40:17,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:40:17,027 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:17,029 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,166 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-03 05:40:17,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:40:17,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 19 conjunts are in the unsatisfiable core [2024-05-03 05:40:17,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:40:17,393 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-03 05:40:17,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:40:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 43 proven. 39 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-03 05:40:17,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889846778] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:40:17,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:40:17,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 30 [2024-05-03 05:40:17,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967811144] [2024-05-03 05:40:17,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:40:17,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-05-03 05:40:17,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:40:17,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-05-03 05:40:17,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2024-05-03 05:40:17,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:40:17,756 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:40:17,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 10.033333333333333) internal successors, (301), 30 states have internal predecessors, (301), 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:17,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:40:17,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:40:17,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:40:17,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-03 05:40:17,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-05-03 05:40:17,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-05-03 05:40:17,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:40:17,757 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:40:17,919 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:17,919 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:17,919 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:18,109 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:18,109 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:18,109 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:18,301 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:18,302 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:18,302 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:18,488 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:18,489 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:18,489 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:40:18,677 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:18,678 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:18,678 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:18,693 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:18,693 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:18,693 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:18,892 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:18,892 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:18,892 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:18,910 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:18,910 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:18,910 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:18,931 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:18,931 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:18,931 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:18,951 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:18,951 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:18,951 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:18,972 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:18,972 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:18,972 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:19,050 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:19,050 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:19,050 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:19,068 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:19,068 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:19,068 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:19,087 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:19,087 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:19,087 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:19,119 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:19,120 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:19,120 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:19,144 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:19,144 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:19,144 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:19,163 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:19,163 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:19,163 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:19,262 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:19,262 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:19,262 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:19,315 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2730 states. [2024-05-03 05:40:19,316 INFO L212 cStratifiedReduction]: Copied states 200 times. [2024-05-03 05:40:19,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:40:19,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:40:19,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:40:19,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-03 05:40:19,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-03 05:40:19,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-05-03 05:40:19,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-05-03 05:40:19,317 INFO L78 Accepts]: Start accepts. Automaton has currently 2846 states, but on-demand construction may add more states Word has length 253 [2024-05-03 05:40:19,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:40:19,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-05-03 05:40:19,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:40:19,523 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:40:19,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:40:19,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2114636909, now seen corresponding path program 1 times [2024-05-03 05:40:19,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:40:19,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802698708] [2024-05-03 05:40:19,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:40:19,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:40:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:40:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-03 05:40:20,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:40:20,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802698708] [2024-05-03 05:40:20,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802698708] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:40:20,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923369816] [2024-05-03 05:40:20,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:40:20,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:40:20,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:40:20,429 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:40:20,494 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:40:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:40:20,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 47 conjunts are in the unsatisfiable core [2024-05-03 05:40:20,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:40:21,433 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-03 05:40:21,434 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:40:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-03 05:40:22,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923369816] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:40:22,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:40:22,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 61 [2024-05-03 05:40:22,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119227521] [2024-05-03 05:40:22,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:40:22,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-05-03 05:40:22,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:40:22,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-05-03 05:40:22,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=3341, Unknown=0, NotChecked=0, Total=3660 [2024-05-03 05:40:22,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:40:22,794 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:40:22,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 7.213114754098361) internal successors, (440), 61 states have internal predecessors, (440), 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:22,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:40:22,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:40:22,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:40:22,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-03 05:40:22,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-05-03 05:40:22,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-05-03 05:40:22,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-05-03 05:40:22,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:40:22,795 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:40:36,189 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:36,190 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:36,190 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:36,206 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:36,206 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:36,206 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:37,424 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:37,425 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:37,425 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:37,446 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:37,446 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:37,446 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:38,394 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:38,394 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:38,394 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:38,412 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:38,412 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:38,412 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:39,443 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:39,443 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:39,443 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:39,461 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:39,462 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:39,462 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:40,445 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:40,445 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:40,445 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:40,465 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:40,465 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:40,465 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:41,118 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:41,118 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:41,118 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:41,139 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:41,139 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:41,139 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:41,629 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:41,629 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:41,629 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:41,650 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:41,650 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:41,650 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,051 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:42,052 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:42,052 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,074 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:42,074 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,074 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,196 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:42,197 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:40:42,197 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,217 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:42,217 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,217 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,258 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:42,259 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,259 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,276 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:42,276 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,276 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,298 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:42,298 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,298 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,325 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:42,325 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,325 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,344 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:42,344 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,344 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,363 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:42,364 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,364 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,400 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:42,400 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,401 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,427 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:42,427 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,427 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,449 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:42,449 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,449 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,532 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:40:42,533 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,533 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:40:42,572 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 4690 states. [2024-05-03 05:40:42,572 INFO L212 cStratifiedReduction]: Copied states 1161 times. [2024-05-03 05:40:42,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:40:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:40:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:40:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-03 05:40:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-03 05:40:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-05-03 05:40:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-05-03 05:40:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-03 05:40:42,573 INFO L78 Accepts]: Start accepts. Automaton has currently 3905 states, but on-demand construction may add more states Word has length 292 [2024-05-03 05:40:42,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:40:42,579 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:40:42,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-05-03 05:40:42,780 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:40:42,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:40:42,780 INFO L85 PathProgramCache]: Analyzing trace with hash -600008566, now seen corresponding path program 2 times [2024-05-03 05:40:42,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:40:42,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480363349] [2024-05-03 05:40:42,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:40:42,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:40:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:42:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:42:19,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:42:19,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480363349] [2024-05-03 05:42:19,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480363349] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:42:19,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63032048] [2024-05-03 05:42:19,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-03 05:42:19,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:42:19,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:42:19,841 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:42:19,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-05-03 05:42:20,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-03 05:42:20,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:42:20,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 81 conjunts are in the unsatisfiable core [2024-05-03 05:42:20,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:42:25,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 05:42:25,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 13 new quantified variables, introduced 21 case distinctions, treesize of input 87 treesize of output 205 [2024-05-03 05:42:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 296 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-03 05:42:25,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:42:32,945 INFO L349 Elim1Store]: treesize reduction 35, result has 95.8 percent of original size [2024-05-03 05:42:32,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 26 new quantified variables, introduced 91 case distinctions, treesize of input 115 treesize of output 889 [2024-05-03 05:42:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-05-03 05:42:46,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63032048] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:42:46,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:42:46,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 41, 33] total 149 [2024-05-03 05:42:46,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404865138] [2024-05-03 05:42:46,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:42:46,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2024-05-03 05:42:46,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:42:46,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2024-05-03 05:42:46,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=21503, Unknown=0, NotChecked=0, Total=22052 [2024-05-03 05:42:46,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:42:46,860 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:42:46,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 149 states, 149 states have (on average 5.355704697986577) internal successors, (798), 149 states have internal predecessors, (798), 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:42:46,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:42:46,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:42:46,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:42:46,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-03 05:42:46,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-05-03 05:42:46,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-05-03 05:42:46,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-05-03 05:42:46,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-03 05:42:46,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:42:46,861 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:42:53,441 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:53,441 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:42:53,441 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:42:53,469 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:53,469 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:42:53,469 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:42:54,602 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:54,602 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:42:54,602 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:42:54,616 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:54,616 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:42:54,616 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:42:55,749 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:55,749 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:42:55,749 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:42:55,763 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:55,763 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:42:55,763 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:42:56,986 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:56,986 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:42:56,986 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:42:57,000 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:57,000 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:42:57,000 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:42:57,543 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:57,544 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:42:57,544 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:42:57,559 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:57,560 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:42:57,560 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:42:58,118 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:58,118 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:42:58,118 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:42:58,134 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:58,134 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:42:58,134 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:42:58,707 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:58,707 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:42:58,708 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:42:58,724 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:42:58,724 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:42:58,724 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:01,347 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:01,347 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:43:01,347 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:01,393 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:01,393 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:01,393 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:03,375 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:03,375 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:43:03,375 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:03,395 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:03,395 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:03,395 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:03,420 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:03,421 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:03,421 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:03,438 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:03,438 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:03,438 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:03,461 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:03,461 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:03,461 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:03,491 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:03,493 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:03,493 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:03,517 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:03,518 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:03,518 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:03,538 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:03,539 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:03,539 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:03,627 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:03,627 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:03,627 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:03,858 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 4441 states. [2024-05-03 05:43:03,858 INFO L212 cStratifiedReduction]: Copied states 1161 times. [2024-05-03 05:43:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:43:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:43:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:43:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-03 05:43:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-03 05:43:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-05-03 05:43:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-05-03 05:43:03,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-03 05:43:03,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-05-03 05:43:03,859 INFO L78 Accepts]: Start accepts. Automaton has currently 3646 states, but on-demand construction may add more states Word has length 313 [2024-05-03 05:43:03,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:43:03,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-05-03 05:43:04,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:43:04,066 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:43:04,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:43:04,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1360356985, now seen corresponding path program 3 times [2024-05-03 05:43:04,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:43:04,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311305734] [2024-05-03 05:43:04,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:43:04,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:43:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:43:05,301 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 373 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-03 05:43:05,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:43:05,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311305734] [2024-05-03 05:43:05,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311305734] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:43:05,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598680296] [2024-05-03 05:43:05,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-03 05:43:05,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:43:05,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:43:05,302 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:43:05,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-05-03 05:43:05,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-05-03 05:43:05,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:43:05,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 52 conjunts are in the unsatisfiable core [2024-05-03 05:43:05,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:43:06,441 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 373 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-03 05:43:06,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:43:08,139 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 373 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-03 05:43:08,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598680296] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:43:08,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:43:08,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27, 29] total 68 [2024-05-03 05:43:08,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937919396] [2024-05-03 05:43:08,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:43:08,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-05-03 05:43:08,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:43:08,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-05-03 05:43:08,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=4234, Unknown=0, NotChecked=0, Total=4556 [2024-05-03 05:43:08,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:43:08,142 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:43:08,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 7.676470588235294) internal successors, (522), 68 states have internal predecessors, (522), 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:43:08,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:43:08,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:43:08,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:43:08,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-03 05:43:08,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-05-03 05:43:08,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-05-03 05:43:08,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-05-03 05:43:08,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-03 05:43:08,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-05-03 05:43:08,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:43:08,143 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:43:10,555 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:10,556 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:43:10,556 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:10,569 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:10,569 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:10,569 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:13,072 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:13,073 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:43:13,073 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:13,087 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:13,087 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:13,087 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:16,196 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:16,197 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:43:16,197 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:16,223 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:16,223 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:16,223 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:18,290 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:18,290 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:43:18,290 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:18,306 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:18,307 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:18,307 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:22,397 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:22,397 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:43:22,398 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:22,416 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:22,416 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:22,416 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:25,215 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:25,215 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:43:25,215 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:25,234 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:25,234 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:25,234 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:28,698 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:28,698 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:43:28,698 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:28,719 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:43:28,719 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:28,719 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:43:41,862 WARN L293 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 05:43:55,802 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:43:57,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 05:44:00,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 05:44:01,194 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:44:01,194 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:44:01,194 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:44:01,228 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:44:01,228 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:44:01,228 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:44:33,471 WARN L293 SmtUtils]: Spent 6.74s on a formula simplification. DAG size of input: 74 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 05:44:55,904 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:44:55,904 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:44:55,904 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:44:55,919 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:44:55,920 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_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:44:55,920 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:45:31,248 WARN L293 SmtUtils]: Spent 5.45s on a formula simplification. DAG size of input: 64 DAG size of output: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 05:45:33,283 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:46:01,960 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:46:01,960 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:46:01,960 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:46:01,976 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:46:01,976 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_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:46:01,976 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:46:38,219 WARN L293 SmtUtils]: Spent 5.19s on a formula simplification. DAG size of input: 61 DAG size of output: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 05:46:39,645 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:47:02,867 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:47:02,867 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:47:02,868 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:47:02,885 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:47:02,885 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_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:47:02,885 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:47:28,110 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:47:45,730 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:47:45,730 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:47:45,730 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:47:45,752 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:47:45,752 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_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:47:45,752 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:48:06,405 WARN L293 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 54 DAG size of output: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 05:48:07,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 05:48:09,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 05:48:29,760 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:48:29,760 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:48:29,760 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:48:29,781 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:48:29,781 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_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:48:29,781 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:48:51,900 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:48:51,900 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:48:51,900 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:48:51,923 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:48:51,923 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_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:48:51,923 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:09,288 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:09,288 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:49:09,288 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:09,313 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:09,313 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_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:09,313 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:19,119 WARN L293 SmtUtils]: Spent 5.23s on a formula simplification. DAG size of input: 45 DAG size of output: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 05:49:26,047 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 5729 states. [2024-05-03 05:49:26,048 INFO L212 cStratifiedReduction]: Copied states 2039 times. [2024-05-03 05:49:26,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:49:26,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:49:26,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:49:26,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-03 05:49:26,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-03 05:49:26,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-05-03 05:49:26,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-05-03 05:49:26,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-05-03 05:49:26,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-05-03 05:49:26,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 253 states. [2024-05-03 05:49:26,049 INFO L78 Accepts]: Start accepts. Automaton has currently 3789 states, but on-demand construction may add more states Word has length 453 [2024-05-03 05:49:26,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:49:26,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-05-03 05:49:26,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-05-03 05:49:26,256 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:49:26,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:49:26,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2034770675, now seen corresponding path program 4 times [2024-05-03 05:49:26,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:49:26,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607281964] [2024-05-03 05:49:26,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:49:26,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:49:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:49:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-03 05:49:28,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:49:28,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607281964] [2024-05-03 05:49:28,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607281964] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:49:28,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369700552] [2024-05-03 05:49:28,462 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-03 05:49:28,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:49:28,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:49:28,463 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:49:28,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-05-03 05:49:29,474 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-03 05:49:29,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 05:49:29,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 108 conjunts are in the unsatisfiable core [2024-05-03 05:49:29,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:49:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 0 proven. 1471 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-03 05:49:31,222 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:49:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-03 05:49:35,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369700552] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:49:35,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:49:35,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 54, 49] total 119 [2024-05-03 05:49:35,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888934317] [2024-05-03 05:49:35,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:49:35,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 119 states [2024-05-03 05:49:35,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:49:35,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2024-05-03 05:49:35,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=767, Invalid=13275, Unknown=0, NotChecked=0, Total=14042 [2024-05-03 05:49:35,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:49:35,030 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:49:35,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 119 states, 119 states have (on average 7.151260504201681) internal successors, (851), 119 states have internal predecessors, (851), 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:49:35,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:49:35,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 05:49:35,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 05:49:35,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-03 05:49:35,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-05-03 05:49:35,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-05-03 05:49:35,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-05-03 05:49:35,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-05-03 05:49:35,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-05-03 05:49:35,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 253 states. [2024-05-03 05:49:35,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:49:35,031 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:49:35,814 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:35,815 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:49:35,815 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:35,827 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:35,827 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_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:35,827 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:36,351 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:36,351 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:49:36,351 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:36,364 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:36,364 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_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:36,364 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:36,883 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:36,883 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:49:36,883 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:36,897 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:36,897 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_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:36,897 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:37,385 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:37,385 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:49:37,386 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:37,403 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:37,403 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_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:37,404 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:37,927 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:37,928 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:49:37,928 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:37,945 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:37,945 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:37,945 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:38,382 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:38,382 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:49:38,382 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:38,403 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:38,403 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:38,403 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:38,878 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:38,878 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:49:38,878 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:38,897 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:38,897 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:38,897 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:39,408 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:39,413 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:49:39,413 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:39,436 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:39,436 INFO L369 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:39,436 INFO L370 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:39,960 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:39,960 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:49:39,960 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:39,985 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:39,985 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_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:39,985 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:40,536 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:40,536 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:49:40,536 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:40,562 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:40,562 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_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:40,562 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:41,117 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:41,117 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:49:41,117 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:41,144 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:41,144 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_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:41,144 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:49,362 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:49,362 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:49:49,362 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:49,377 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:49:49,377 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_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:49:49,377 INFO L370 cStratifiedReduction]: Actual level: [thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-03 05:50:01,042 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:50:01,042 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:50:01,042 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~post27#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset] [2024-05-03 05:50:01,092 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:50:01,092 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~post27#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset] [2024-05-03 05:50:01,092 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~post27#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset] [2024-05-03 05:50:15,993 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:50:15,994 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:50:15,994 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~post27#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset] [2024-05-03 05:50:16,012 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:50:16,012 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~post27#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset] [2024-05-03 05:50:16,012 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~post27#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset] [2024-05-03 05:50:21,604 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:50:21,604 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:50:21,604 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~post27#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset] [2024-05-03 05:50:21,624 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:50:21,624 INFO L369 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~post27#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset] [2024-05-03 05:50:21,624 INFO L370 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread1Thread1of1ForFork0_#t~post2#1, ~n~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~post27#1, thread1Thread1of1ForFork0_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc26#1.offset] [2024-05-03 05:50:31,457 WARN L854 $PredicateComparison]: unable to prove that (and (< 10 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296)) (< 10 (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296)) (< 10 (mod (+ 12 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296)) (< 10 (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296)) (< 10 (mod (+ 13 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296)) (< 10 (mod (+ 7 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296)) (< 10 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296)) (< 10 (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296)) (< 10 (mod (+ 8 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296)) (< 10 (mod (+ 6 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (<= (div c_~n~0 4294967296) (div (+ (- 15) c_~n~0) 4294967296)) (< 10 (mod (+ 7 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (< 10 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 12) 4294967296)) (< 10 (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 11) 4294967296)) (< 10 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 11) 4294967296)) (< 10 (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (< 10 (mod (+ 6 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296)) (< 10 (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (< 10 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 13) 4294967296)) (< 10 (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (< 10 (mod (+ 9 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (< 10 (mod (+ 5 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296)) (< 10 (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296)) (< 10 (mod (+ 9 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296)) (< 10 (mod (+ 10 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296)) (< 10 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 10) 4294967296)) (< 10 (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 8) 4294967296)) (< 10 (mod (+ 14 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296)) (< 10 (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296))) is different from false Received shutdown request... [2024-05-03 05:53:46,923 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:53:46,923 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-03 05:53:46,929 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:53:46,932 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 5819 states. [2024-05-03 05:53:46,932 INFO L212 cStratifiedReduction]: Copied states 2039 times. [2024-05-03 05:53:46,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-05-03 05:53:47,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-05-03 05:53:47,132 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 301 known predicates. [2024-05-03 05:53:47,134 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 05:53:47,176 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1] [2024-05-03 05:53:47,177 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/3) [2024-05-03 05:53:47,178 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-03 05:53:47,178 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-03 05:53:47,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 05:53:47 BasicIcfg [2024-05-03 05:53:47,181 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-03 05:53:47,181 INFO L158 Benchmark]: Toolchain (without parser) took 837233.03ms. Allocated memory was 173.0MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 99.0MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 412.7MB. Max. memory is 8.0GB. [2024-05-03 05:53:47,181 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 173.0MB. Free memory is still 106.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-03 05:53:47,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.30ms. Allocated memory is still 173.0MB. Free memory was 98.8MB in the beginning and 85.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-03 05:53:47,186 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.85ms. Allocated memory is still 173.0MB. Free memory was 85.8MB in the beginning and 83.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-03 05:53:47,186 INFO L158 Benchmark]: Boogie Preprocessor took 47.14ms. Allocated memory is still 173.0MB. Free memory was 83.6MB in the beginning and 81.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-03 05:53:47,188 INFO L158 Benchmark]: RCFGBuilder took 451.75ms. Allocated memory is still 173.0MB. Free memory was 81.7MB in the beginning and 61.5MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-05-03 05:53:47,191 INFO L158 Benchmark]: TraceAbstraction took 836503.53ms. Allocated memory was 173.0MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 60.2MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 373.9MB. Max. memory is 8.0GB. [2024-05-03 05:53:47,194 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.11ms. Allocated memory is still 173.0MB. Free memory is still 106.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.30ms. Allocated memory is still 173.0MB. Free memory was 98.8MB in the beginning and 85.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.85ms. Allocated memory is still 173.0MB. Free memory was 85.8MB in the beginning and 83.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.14ms. Allocated memory is still 173.0MB. Free memory was 83.6MB in the beginning and 81.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 451.75ms. Allocated memory is still 173.0MB. Free memory was 81.7MB in the beginning and 61.5MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 836503.53ms. Allocated memory was 173.0MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 60.2MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 373.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 34109, independent: 30996, independent conditional: 30996, independent unconditional: 0, dependent: 3113, dependent conditional: 3113, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30996, independent: 30996, independent conditional: 30996, 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: 30996, independent: 30996, independent conditional: 30996, 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: 30996, independent: 30996, independent conditional: 0, independent unconditional: 30996, 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: 30996, independent: 30996, independent conditional: 0, independent unconditional: 30996, 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: 30996, independent: 30996, independent conditional: 0, independent unconditional: 30996, 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: 30996, independent: 30996, independent conditional: 0, independent unconditional: 30996, 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: 30996, independent: 30996, independent conditional: 0, independent unconditional: 30996, 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: 30996, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 30996, unknown conditional: 0, unknown unconditional: 30996] , Statistics on independence cache: Total cache size (in pairs): 30996, Positive cache size: 30996, Positive conditional cache size: 0, Positive unconditional cache size: 30996, 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: 3113 - StatisticsResult: Reduction benchmarks 18.8ms Time before loop, 877.1ms Time in loop, 0.9s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 16, Reduction States: 1500, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 9.7ms Time before loop, 518.8ms Time in loop, 0.5s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 16, Reduction States: 1619, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 29.0ms Time before loop, 630.2ms Time in loop, 0.7s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 16, Reduction States: 1638, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 54.7ms Time before loop, 536.2ms Time in loop, 0.6s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 16, Reduction States: 1646, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 501.7ms Time before loop, 1092.8ms Time in loop, 1.6s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 17, Reduction States: 1824, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 65.0ms Time before loop, 1140.0ms Time in loop, 1.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 18, Reduction States: 1996, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 1699.3ms Time before loop, 3874.1ms Time in loop, 5.6s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 15, Reduction States: 1926, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 11.1ms Time before loop, 1547.8ms Time in loop, 1.6s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 21, Reduction States: 2730, Duplicate States: 200, Protected Variables: 4 - StatisticsResult: Reduction benchmarks 6528.3ms Time before loop, 13249.2ms Time in loop, 19.8s Time in total, Has Loop: 1, wrong guesses: 9, overall guesses: 31, Reduction States: 4690, Duplicate States: 1161, Protected Variables: 4 - StatisticsResult: Reduction benchmarks 4168.1ms Time before loop, 12828.9ms Time in loop, 17.0s Time in total, Has Loop: 1, wrong guesses: 9, overall guesses: 28, Reduction States: 4441, Duplicate States: 1161, Protected Variables: 4 - StatisticsResult: Reduction benchmarks 27.1ms Time before loop, 377877.1ms Time in loop, 377.9s Time in total, Has Loop: 1, wrong guesses: 15, overall guesses: 33, Reduction States: 5729, Duplicate States: 2039, Protected Variables: 8 - StatisticsResult: Reduction benchmarks 337.1ms Time before loop, 251563.8ms Time in loop, 251.9s Time in total, Has Loop: 1, wrong guesses: 15, overall guesses: 31, Reduction States: 5819, Duplicate States: 2039, Protected Variables: 11 - StatisticsResult: Visitor Statistics States: 1482, Transitions: 1645, Traversal time: 0.9s - StatisticsResult: Visitor Statistics States: 1482, Transitions: 1652, Traversal time: 0.5s - StatisticsResult: Visitor Statistics States: 1495, Transitions: 1666, Traversal time: 0.7s - StatisticsResult: Visitor Statistics States: 1502, Transitions: 1673, Traversal time: 0.6s - StatisticsResult: Visitor Statistics States: 1665, Transitions: 1857, Traversal time: 1.6s - StatisticsResult: Visitor Statistics States: 1822, Transitions: 2012, Traversal time: 1.2s - StatisticsResult: Visitor Statistics States: 1761, Transitions: 1955, Traversal time: 5.6s - StatisticsResult: Visitor Statistics States: 2527, Transitions: 2813, Traversal time: 1.6s - StatisticsResult: Visitor Statistics States: 4441, Transitions: 4933, Traversal time: 19.8s - StatisticsResult: Visitor Statistics States: 4203, Transitions: 4662, Traversal time: 17.0s - StatisticsResult: Visitor Statistics States: 5461, Transitions: 6059, Traversal time: 377.9s - StatisticsResult: Visitor Statistics States: 5553, Transitions: 6166, Traversal time: 251.9s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 51, RedundantProofs: 8, ProvenStates: 2619, Times there's more than one choice: 2436, Avg number of choices: 7.395570828560519 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 301 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 338 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 836.3s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 679.2s, 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: 778, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 151.3s InterpolantComputationTime, 4579 NumberOfCodeBlocks, 4579 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 6568 ConstructedInterpolants, 41 QuantifiedInterpolants, 120455 SizeOfPredicates, 236 NumberOfNonLiveVariables, 3859 ConjunctsInSsa, 435 ConjunctsInUnsatCore, 28 InterpolantComputations, 3 PerfectInterpolantSequences, 550/7544 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