/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/parallel-misc-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 16:14:52,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 16:14:52,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-30 16:14:52,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 16:14:52,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 16:14:52,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-30 16:14:52,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 16:14:52,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 16:14:52,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 16:14:52,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 16:14:52,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 16:14:52,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 16:14:52,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 16:14:52,225 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 16:14:52,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 16:14:52,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 16:14:52,226 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 16:14:52,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 16:14:52,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 16:14:52,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 16:14:52,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 16:14:52,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 16:14:52,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 16:14:52,228 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 16:14:52,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 16:14:52,229 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 16:14:52,229 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 16:14:52,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 16:14:52,229 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 16:14:52,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 16:14:52,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:14:52,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 16:14:52,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 16:14:52,231 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-30 16:14:52,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 16:14:52,232 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 16:14:52,232 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-30 16:14:52,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-30 16:14:52,232 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 16:14:52,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 16:14:52,232 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 16:14:52,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-05-30 16:14:52,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 16:14:52,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 16:14:52,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 16:14:52,503 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 16:14:52,503 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 16:14:52,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2024-05-30 16:14:53,672 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 16:14:53,887 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 16:14:53,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2024-05-30 16:14:53,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/534e8906f/ed62d681ac514508bb3e019dc0876aec/FLAGf5db0511f [2024-05-30 16:14:53,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/534e8906f/ed62d681ac514508bb3e019dc0876aec [2024-05-30 16:14:53,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 16:14:53,925 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 16:14:53,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 16:14:53,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 16:14:53,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 16:14:53,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:14:53" (1/1) ... [2024-05-30 16:14:53,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a68648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:53, skipping insertion in model container [2024-05-30 16:14:53,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:14:53" (1/1) ... [2024-05-30 16:14:53,958 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 16:14:54,184 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/parallel-misc-2.wvr.c[2554,2567] [2024-05-30 16:14:54,189 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:14:54,199 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 16:14:54,235 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/parallel-misc-2.wvr.c[2554,2567] [2024-05-30 16:14:54,235 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:14:54,250 INFO L206 MainTranslator]: Completed translation [2024-05-30 16:14:54,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:54 WrapperNode [2024-05-30 16:14:54,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 16:14:54,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 16:14:54,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 16:14:54,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 16:14:54,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:54" (1/1) ... [2024-05-30 16:14:54,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:54" (1/1) ... [2024-05-30 16:14:54,298 INFO L138 Inliner]: procedures = 21, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2024-05-30 16:14:54,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 16:14:54,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 16:14:54,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 16:14:54,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 16:14:54,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:54" (1/1) ... [2024-05-30 16:14:54,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:54" (1/1) ... [2024-05-30 16:14:54,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:54" (1/1) ... [2024-05-30 16:14:54,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:54" (1/1) ... [2024-05-30 16:14:54,328 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:54" (1/1) ... [2024-05-30 16:14:54,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:54" (1/1) ... [2024-05-30 16:14:54,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:54" (1/1) ... [2024-05-30 16:14:54,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:54" (1/1) ... [2024-05-30 16:14:54,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 16:14:54,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 16:14:54,335 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 16:14:54,335 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 16:14:54,336 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:54" (1/1) ... [2024-05-30 16:14:54,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:14:54,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:14:54,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-30 16:14:54,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-30 16:14:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 16:14:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 16:14:54,433 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 16:14:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 16:14:54,433 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 16:14:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 16:14:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 16:14:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 16:14:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 16:14:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 16:14:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 16:14:54,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 16:14:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 16:14:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 16:14:54,438 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 16:14:54,528 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 16:14:54,530 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 16:14:54,765 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 16:14:54,791 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 16:14:54,791 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-30 16:14:54,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:14:54 BoogieIcfgContainer [2024-05-30 16:14:54,792 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 16:14:54,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 16:14:54,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 16:14:54,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 16:14:54,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 04:14:53" (1/3) ... [2024-05-30 16:14:54,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b2a97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:14:54, skipping insertion in model container [2024-05-30 16:14:54,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:54" (2/3) ... [2024-05-30 16:14:54,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b2a97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:14:54, skipping insertion in model container [2024-05-30 16:14:54,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:14:54" (3/3) ... [2024-05-30 16:14:54,800 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2024-05-30 16:14:54,809 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 16:14:54,819 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 16:14:54,820 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 16:14:54,820 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 16:14:54,883 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-30 16:14:54,922 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:14:54,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 16:14:54,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:14:54,924 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 16:14:54,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-30 16:14:54,968 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 16:14:54,977 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 16:14:54,983 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;@25a86713, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:14:54,984 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 16:14:54,991 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:14:55,115 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:55,115 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:55,115 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:55,179 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:55,179 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:55,179 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:55,204 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:55,205 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:55,205 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:55,332 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:55,332 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:55,332 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:55,374 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:55,375 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:55,375 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:55,442 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:55,442 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:55,442 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:55,490 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:55,490 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:55,490 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:55,504 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 204 states. [2024-05-30 16:14:55,504 INFO L212 cStratifiedReduction]: Copied states 11 times. [2024-05-30 16:14:55,507 INFO L78 Accepts]: Start accepts. Automaton has currently 202 states, but on-demand construction may add more states Word has length 73 [2024-05-30 16:14:55,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:14:55,510 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:14:55,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:14:55,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1594442156, now seen corresponding path program 1 times [2024-05-30 16:14:55,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:14:55,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464505332] [2024-05-30 16:14:55,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:14:55,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:14:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:14:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:14:55,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:14:55,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464505332] [2024-05-30 16:14:55,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464505332] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:14:55,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:14:55,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 16:14:55,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92345388] [2024-05-30 16:14:55,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:14:55,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 16:14:55,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:14:55,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 16:14:55,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 16:14:55,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:55,813 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:14:55,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:14:55,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:55,816 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:14:55,858 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:55,859 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:55,859 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:55,885 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:55,886 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:55,886 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:55,910 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:55,910 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:55,911 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:55,964 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:55,965 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:55,965 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:55,987 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:55,988 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:55,988 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:56,020 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:56,021 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:56,021 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:56,045 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:56,045 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:56,045 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:56,062 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 233 states. [2024-05-30 16:14:56,062 INFO L212 cStratifiedReduction]: Copied states 11 times. [2024-05-30 16:14:56,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:56,063 INFO L78 Accepts]: Start accepts. Automaton has currently 231 states, but on-demand construction may add more states Word has length 71 [2024-05-30 16:14:56,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:14:56,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 16:14:56,065 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:14:56,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:14:56,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1938024875, now seen corresponding path program 1 times [2024-05-30 16:14:56,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:14:56,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452062055] [2024-05-30 16:14:56,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:14:56,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:14:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:14:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:14:56,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:14:56,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452062055] [2024-05-30 16:14:56,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452062055] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:14:56,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:14:56,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-30 16:14:56,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352272850] [2024-05-30 16:14:56,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:14:56,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-30 16:14:56,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:14:56,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-30 16:14:56,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-30 16:14:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:56,588 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:14:56,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:14:56,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:56,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:56,590 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:14:56,695 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:56,695 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:56,696 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:56,710 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:56,711 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:56,711 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:56,726 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:56,726 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:56,726 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:56,753 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 204 states. [2024-05-30 16:14:56,754 INFO L212 cStratifiedReduction]: Copied states 3 times. [2024-05-30 16:14:56,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:56,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:14:56,758 INFO L78 Accepts]: Start accepts. Automaton has currently 210 states, but on-demand construction may add more states Word has length 78 [2024-05-30 16:14:56,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:14:56,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 16:14:56,759 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:14:56,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:14:56,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1084983360, now seen corresponding path program 1 times [2024-05-30 16:14:56,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:14:56,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982293786] [2024-05-30 16:14:56,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:14:56,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:14:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:14:57,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:14:57,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:14:57,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982293786] [2024-05-30 16:14:57,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982293786] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:14:57,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833333403] [2024-05-30 16:14:57,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:14:57,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:14:57,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:14:57,102 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:14:57,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-30 16:14:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:14:57,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2024-05-30 16:14:57,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:14:57,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:14:57,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:14:57,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:14:57,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833333403] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:14:57,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:14:57,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-05-30 16:14:57,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433599524] [2024-05-30 16:14:57,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:14:57,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-30 16:14:57,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:14:57,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-30 16:14:57,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-05-30 16:14:57,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:57,650 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:14:57,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:14:57,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:57,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:14:57,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:57,651 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:14:57,850 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:57,850 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:57,851 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:57,870 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:57,870 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:57,870 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:57,900 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:57,900 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:57,900 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:57,926 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:57,926 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:57,926 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:57,950 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:57,950 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:57,951 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:57,967 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:57,967 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:57,968 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:57,998 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 287 states. [2024-05-30 16:14:57,998 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:14:57,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:57,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:14:57,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:14:57,999 INFO L78 Accepts]: Start accepts. Automaton has currently 304 states, but on-demand construction may add more states Word has length 85 [2024-05-30 16:14:58,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:14:58,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-30 16:14:58,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-05-30 16:14:58,206 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:14:58,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:14:58,207 INFO L85 PathProgramCache]: Analyzing trace with hash -529861384, now seen corresponding path program 1 times [2024-05-30 16:14:58,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:14:58,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666440264] [2024-05-30 16:14:58,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:14:58,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:14:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:14:58,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:14:58,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:14:58,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666440264] [2024-05-30 16:14:58,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666440264] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:14:58,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375963151] [2024-05-30 16:14:58,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:14:58,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:14:58,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:14:58,609 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:14:58,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-30 16:14:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:14:58,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 11 conjunts are in the unsatisfiable core [2024-05-30 16:14:58,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:14:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:14:58,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:14:59,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:14:59,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375963151] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:14:59,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:14:59,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-05-30 16:14:59,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935312739] [2024-05-30 16:14:59,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:14:59,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-05-30 16:14:59,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:14:59,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-05-30 16:14:59,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-05-30 16:14:59,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:59,144 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:14:59,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.6) internal successors, (152), 20 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:14:59,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:59,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:14:59,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:14:59,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:59,145 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:14:59,726 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:59,726 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:59,726 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:59,735 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:59,736 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:59,736 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:59,756 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:59,756 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:14:59,756 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:14:59,816 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:59,816 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:14:59,816 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:14:59,847 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:59,848 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:14:59,850 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:14:59,880 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:59,883 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:14:59,883 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:14:59,906 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:59,906 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:14:59,906 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:14:59,979 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 376 states. [2024-05-30 16:14:59,979 INFO L212 cStratifiedReduction]: Copied states 10 times. [2024-05-30 16:14:59,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:59,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:14:59,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:14:59,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-30 16:14:59,980 INFO L78 Accepts]: Start accepts. Automaton has currently 391 states, but on-demand construction may add more states Word has length 99 [2024-05-30 16:14:59,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:14:59,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-30 16:15:00,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:15:00,189 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:15:00,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:15:00,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1870469067, now seen corresponding path program 2 times [2024-05-30 16:15:00,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:15:00,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412906558] [2024-05-30 16:15:00,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:15:00,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:15:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:15:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-05-30 16:15:00,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:15:00,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412906558] [2024-05-30 16:15:00,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412906558] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:15:00,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:15:00,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-30 16:15:00,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003650432] [2024-05-30 16:15:00,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:15:00,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-30 16:15:00,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:15:00,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-30 16:15:00,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-30 16:15:00,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:15:00,368 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:15:00,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:15:00,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:15:00,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:15:00,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:15:00,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-30 16:15:00,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:15:00,369 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:15:00,407 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,407 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:15:00,408 INFO L395 cStratifiedReduction]: Actual level: [~d1~0] [2024-05-30 16:15:00,413 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,413 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~d1~0] [2024-05-30 16:15:00,413 INFO L395 cStratifiedReduction]: Actual level: [~d1~0] [2024-05-30 16:15:00,422 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,422 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~d1~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,422 INFO L395 cStratifiedReduction]: Actual level: [~d1~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,432 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,432 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~d1~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,432 INFO L395 cStratifiedReduction]: Actual level: [~d1~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,443 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,443 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~d1~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,443 INFO L395 cStratifiedReduction]: Actual level: [~d1~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,460 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,461 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~d1~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,461 INFO L395 cStratifiedReduction]: Actual level: [~d1~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,469 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 372 states. [2024-05-30 16:15:00,469 INFO L212 cStratifiedReduction]: Copied states 10 times. [2024-05-30 16:15:00,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:15:00,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:15:00,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:15:00,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-30 16:15:00,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:15:00,469 INFO L78 Accepts]: Start accepts. Automaton has currently 412 states, but on-demand construction may add more states Word has length 106 [2024-05-30 16:15:00,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:15:00,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-30 16:15:00,470 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:15:00,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:15:00,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1994487552, now seen corresponding path program 1 times [2024-05-30 16:15:00,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:15:00,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728013299] [2024-05-30 16:15:00,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:15:00,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:15:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:15:00,631 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-05-30 16:15:00,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:15:00,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728013299] [2024-05-30 16:15:00,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728013299] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:15:00,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:15:00,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-30 16:15:00,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131103607] [2024-05-30 16:15:00,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:15:00,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-30 16:15:00,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:15:00,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-30 16:15:00,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-30 16:15:00,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:15:00,633 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:15:00,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:15:00,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:15:00,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:15:00,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:15:00,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-30 16:15:00,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:15:00,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:15:00,634 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:15:00,671 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,672 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:15:00,672 INFO L395 cStratifiedReduction]: Actual level: [~d2~0] [2024-05-30 16:15:00,680 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,680 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~d2~0] [2024-05-30 16:15:00,681 INFO L395 cStratifiedReduction]: Actual level: [~d2~0] [2024-05-30 16:15:00,700 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,701 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:15:00,701 INFO L395 cStratifiedReduction]: Actual level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,710 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,710 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,710 INFO L395 cStratifiedReduction]: Actual level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,719 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,719 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,720 INFO L395 cStratifiedReduction]: Actual level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,723 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,724 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,724 INFO L395 cStratifiedReduction]: Actual level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,729 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,729 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,729 INFO L395 cStratifiedReduction]: Actual level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,737 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,737 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,737 INFO L395 cStratifiedReduction]: Actual level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,743 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,743 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,743 INFO L395 cStratifiedReduction]: Actual level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,791 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,792 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,792 INFO L395 cStratifiedReduction]: Actual level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,825 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,825 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,825 INFO L395 cStratifiedReduction]: Actual level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,841 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,841 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,841 INFO L395 cStratifiedReduction]: Actual level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,850 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,850 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,850 INFO L395 cStratifiedReduction]: Actual level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,866 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,867 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,867 INFO L395 cStratifiedReduction]: Actual level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,882 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:15:00,882 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,883 INFO L395 cStratifiedReduction]: Actual level: [~d2~0, ~i1~0, ~i2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~N~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post4, thread1Thread1of1ForFork0_#t~post3] [2024-05-30 16:15:00,890 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 627 states. [2024-05-30 16:15:00,890 INFO L212 cStratifiedReduction]: Copied states 76 times. [2024-05-30 16:15:00,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:15:00,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:15:00,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:15:00,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-30 16:15:00,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:15:00,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:15:00,894 INFO L78 Accepts]: Start accepts. Automaton has currently 665 states, but on-demand construction may add more states Word has length 113 [2024-05-30 16:15:00,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:15:00,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-30 16:15:00,895 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:15:00,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:15:00,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1752290920, now seen corresponding path program 1 times [2024-05-30 16:15:00,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:15:00,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682034616] [2024-05-30 16:15:00,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:15:00,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:15:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:15:01,471 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-05-30 16:15:01,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:15:01,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682034616] [2024-05-30 16:15:01,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682034616] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:15:01,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461053979] [2024-05-30 16:15:01,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:15:01,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:15:01,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:15:01,473 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:15:01,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-30 16:15:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:15:01,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 20 conjunts are in the unsatisfiable core [2024-05-30 16:15:01,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:15:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-05-30 16:15:02,262 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:15:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-05-30 16:15:03,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461053979] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:15:03,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:15:03,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2024-05-30 16:15:03,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136462188] [2024-05-30 16:15:03,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:15:03,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-05-30 16:15:03,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:15:03,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-05-30 16:15:03,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2024-05-30 16:15:03,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:15:03,172 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:15:03,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.709677419354839) internal successors, (177), 31 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:15:03,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:15:03,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:15:03,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:15:03,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-30 16:15:03,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:15:03,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:15:03,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:15:03,173 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:15:05,784 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 330 states. [2024-05-30 16:15:05,784 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:15:05,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:15:05,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:15:05,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:15:05,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-30 16:15:05,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:15:05,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:15:05,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-05-30 16:15:05,787 INFO L78 Accepts]: Start accepts. Automaton has currently 331 states, but on-demand construction may add more states Word has length 141 [2024-05-30 16:15:05,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:15:05,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-30 16:15:05,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:15:05,989 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:15:05,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:15:05,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1997622552, now seen corresponding path program 2 times [2024-05-30 16:15:05,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:15:05,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325356712] [2024-05-30 16:15:05,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:15:05,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:15:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:15:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 32 proven. 113 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-05-30 16:15:07,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:15:07,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325356712] [2024-05-30 16:15:07,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325356712] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:15:07,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903957890] [2024-05-30 16:15:07,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:15:07,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:15:07,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:15:07,405 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:15:07,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-30 16:15:08,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:15:08,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:15:08,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 32 conjunts are in the unsatisfiable core [2024-05-30 16:15:08,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:15:09,161 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 70 proven. 80 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-05-30 16:15:09,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:15:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 39 proven. 111 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-05-30 16:15:10,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903957890] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:15:10,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:15:10,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 19] total 57 [2024-05-30 16:15:10,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379283791] [2024-05-30 16:15:10,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:15:10,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-05-30 16:15:10,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:15:10,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-05-30 16:15:10,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=2845, Unknown=0, NotChecked=0, Total=3192 [2024-05-30 16:15:10,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:15:10,722 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:15:10,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 5.333333333333333) internal successors, (304), 57 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:15:10,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:15:10,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:15:10,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:15:10,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-30 16:15:10,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:15:10,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:15:10,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-05-30 16:15:10,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:15:10,723 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:15:21,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:15:26,483 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 360 states. [2024-05-30 16:15:26,483 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:15:26,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:15:26,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:15:26,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:15:26,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-30 16:15:26,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:15:26,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:15:26,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-05-30 16:15:26,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:15:26,484 INFO L78 Accepts]: Start accepts. Automaton has currently 361 states, but on-demand construction may add more states Word has length 169 [2024-05-30 16:15:26,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:15:26,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-30 16:15:26,686 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,SelfDestructingSolverStorable7 [2024-05-30 16:15:26,686 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:15:26,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:15:26,687 INFO L85 PathProgramCache]: Analyzing trace with hash 320367320, now seen corresponding path program 3 times [2024-05-30 16:15:26,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:15:26,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026265421] [2024-05-30 16:15:26,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:15:26,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:15:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:15:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 55 proven. 229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:15:31,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:15:31,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026265421] [2024-05-30 16:15:31,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026265421] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:15:31,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110042841] [2024-05-30 16:15:31,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:15:31,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:15:31,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:15:31,166 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:15:31,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-30 16:15:31,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-05-30 16:15:31,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:15:31,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 49 conjunts are in the unsatisfiable core [2024-05-30 16:15:31,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:15:34,144 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-05-30 16:15:34,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:15:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 67 proven. 189 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-05-30 16:15:39,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110042841] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:15:39,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:15:39,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 22, 27] total 81 [2024-05-30 16:15:39,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995515039] [2024-05-30 16:15:39,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:15:39,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2024-05-30 16:15:39,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:15:39,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2024-05-30 16:15:39,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=6152, Unknown=0, NotChecked=0, Total=6480 [2024-05-30 16:15:39,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:15:39,471 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:15:39,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 4.333333333333333) internal successors, (351), 81 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:15:39,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:15:39,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:15:39,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:15:39,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-30 16:15:39,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:15:39,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 16:15:39,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-05-30 16:15:39,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-30 16:15:39,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:15:39,472 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:16:14,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:16:17,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:18:16,886 WARN L293 SmtUtils]: Spent 1.31m on a formula simplification. DAG size of input: 135 DAG size of output: 96 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 16:18:19,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:18:56,793 WARN L293 SmtUtils]: Spent 17.20s on a formula simplification. DAG size of input: 91 DAG size of output: 69 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 16:18:59,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:19:02,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:19:04,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:21:22,431 WARN L293 SmtUtils]: Spent 1.40m on a formula simplification. DAG size of input: 129 DAG size of output: 120 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 16:22:31,878 WARN L293 SmtUtils]: Spent 27.87s on a formula simplification. DAG size of input: 99 DAG size of output: 77 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 16:24:49,064 WARN L293 SmtUtils]: Spent 1.52m on a formula simplification. DAG size of input: 120 DAG size of output: 92 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 16:24:52,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:26:20,604 WARN L293 SmtUtils]: Spent 46.46s on a formula simplification. DAG size of input: 110 DAG size of output: 92 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 16:26:21,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:26:23,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:26:25,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:26:34,013 WARN L293 SmtUtils]: Spent 5.50s on a formula simplification. DAG size of input: 67 DAG size of output: 59 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 16:26:35,202 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-30 16:26:36,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:27:34,474 WARN L293 SmtUtils]: Spent 34.63s on a formula simplification. DAG size of input: 105 DAG size of output: 97 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 16:27:36,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:27:38,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:27:39,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2024-05-30 16:29:23,065 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 16:29:23,065 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 16:29:23,065 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 16:29:23,406 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 305 states. [2024-05-30 16:29:23,406 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:29:23,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-30 16:29:23,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:29:23,608 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-14-4-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-11-2-1 context. [2024-05-30 16:29:23,611 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 16:29:23,617 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2024-05-30 16:29:23,618 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/3) [2024-05-30 16:29:23,620 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 16:29:23,620 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 16:29:23,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 04:29:23 BasicIcfg [2024-05-30 16:29:23,623 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 16:29:23,624 INFO L158 Benchmark]: Toolchain (without parser) took 869700.20ms. Allocated memory was 164.6MB in the beginning and 494.9MB in the end (delta: 330.3MB). Free memory was 95.2MB in the beginning and 275.9MB in the end (delta: -180.7MB). Peak memory consumption was 151.1MB. Max. memory is 8.0GB. [2024-05-30 16:29:23,624 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 164.6MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 16:29:23,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.87ms. Allocated memory is still 164.6MB. Free memory was 94.9MB in the beginning and 83.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-30 16:29:23,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.66ms. Allocated memory is still 164.6MB. Free memory was 83.4MB in the beginning and 81.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 16:29:23,625 INFO L158 Benchmark]: Boogie Preprocessor took 35.25ms. Allocated memory is still 164.6MB. Free memory was 81.7MB in the beginning and 80.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-30 16:29:23,625 INFO L158 Benchmark]: RCFGBuilder took 456.57ms. Allocated memory was 164.6MB in the beginning and 285.2MB in the end (delta: 120.6MB). Free memory was 80.3MB in the beginning and 248.4MB in the end (delta: -168.1MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. [2024-05-30 16:29:23,625 INFO L158 Benchmark]: TraceAbstraction took 868828.97ms. Allocated memory was 285.2MB in the beginning and 494.9MB in the end (delta: 209.7MB). Free memory was 247.3MB in the beginning and 275.9MB in the end (delta: -28.6MB). Peak memory consumption was 182.2MB. Max. memory is 8.0GB. [2024-05-30 16:29:23,626 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 164.6MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 324.87ms. Allocated memory is still 164.6MB. Free memory was 94.9MB in the beginning and 83.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.66ms. Allocated memory is still 164.6MB. Free memory was 83.4MB in the beginning and 81.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.25ms. Allocated memory is still 164.6MB. Free memory was 81.7MB in the beginning and 80.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 456.57ms. Allocated memory was 164.6MB in the beginning and 285.2MB in the end (delta: 120.6MB). Free memory was 80.3MB in the beginning and 248.4MB in the end (delta: -168.1MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. * TraceAbstraction took 868828.97ms. Allocated memory was 285.2MB in the beginning and 494.9MB in the end (delta: 209.7MB). Free memory was 247.3MB in the beginning and 275.9MB in the end (delta: -28.6MB). Peak memory consumption was 182.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1587, independent: 1305, independent conditional: 1305, independent unconditional: 0, dependent: 282, dependent conditional: 282, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1305, independent: 1305, independent conditional: 1305, 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: 1305, independent: 1305, independent conditional: 1305, 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: 1305, independent: 1305, independent conditional: 0, independent unconditional: 1305, 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: 1305, independent: 1305, independent conditional: 0, independent unconditional: 1305, 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: 1305, independent: 1305, independent conditional: 0, independent unconditional: 1305, 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: 1305, independent: 1305, independent conditional: 0, independent unconditional: 1305, 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: 1305, independent: 1305, independent conditional: 0, independent unconditional: 1305, 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: 1305, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1305, unknown conditional: 0, unknown unconditional: 1305] , Statistics on independence cache: Total cache size (in pairs): 1305, Positive cache size: 1305, Positive conditional cache size: 0, Positive unconditional cache size: 1305, 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: 282 - StatisticsResult: Reduction benchmarks 26.1ms Time before loop, 486.3ms Time in loop, 0.5s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 9, Reduction States: 204, Duplicate States: 11, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 27.9ms Time before loop, 217.8ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 9, Reduction States: 233, Duplicate States: 11, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 88.2ms Time before loop, 75.4ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 5, Reduction States: 204, Duplicate States: 3, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 150.7ms Time before loop, 196.3ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 8, Reduction States: 287, Duplicate States: 0, Protected Variables: 5 - StatisticsResult: Reduction benchmarks 405.1ms Time before loop, 429.3ms Time in loop, 0.8s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 9, Reduction States: 376, Duplicate States: 10, Protected Variables: 7 - StatisticsResult: Reduction benchmarks 27.6ms Time before loop, 72.1ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 8, Reduction States: 372, Duplicate States: 10, Protected Variables: 7 - StatisticsResult: Reduction benchmarks 14.7ms Time before loop, 241.2ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 4, overall guesses: 17, Reduction States: 627, Duplicate States: 76, Protected Variables: 1 - StatisticsResult: Reduction benchmarks 2308.5ms Time before loop, 302.0ms Time in loop, 2.6s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 2, Reduction States: 330, Duplicate States: 0, Protected Variables: 1 - StatisticsResult: Reduction benchmarks 8251.7ms Time before loop, 7507.8ms Time in loop, 15.8s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 2, Reduction States: 360, Duplicate States: 0, Protected Variables: 1 - StatisticsResult: Reduction benchmarks 823934.1ms Time before loop, 0.0ms Time in loop, 823.9s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 305, Duplicate States: 0, Protected Variables: 1 - StatisticsResult: Visitor Statistics States: 169, Transitions: 219, Traversal time: 0.5s - StatisticsResult: Visitor Statistics States: 169, Transitions: 221, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 124, Transitions: 144, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 202, Transitions: 243, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 274, Transitions: 336, Traversal time: 0.8s - StatisticsResult: Visitor Statistics States: 255, Transitions: 309, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 487, Transitions: 594, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 149, Transitions: 157, Traversal time: 2.6s - StatisticsResult: Visitor Statistics States: 172, Transitions: 181, Traversal time: 15.8s - StatisticsResult: Visitor Statistics States: 122, Transitions: 128, Traversal time: 823.9s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 28, RedundantProofs: 7, ProvenStates: 212, Times there's more than one choice: 122, Avg number of choices: 2.9858490566037736 - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-14-4-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-11-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 123 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 868.7s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 844.8s, 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: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 19.9s InterpolantComputationTime, 1521 NumberOfCodeBlocks, 1521 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2088 ConstructedInterpolants, 0 QuantifiedInterpolants, 17161 SizeOfPredicates, 84 NumberOfNonLiveVariables, 1145 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 598/1534 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