/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 16:25:48,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 16:25:48,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-30 16:25:48,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 16:25:48,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 16:25:48,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-30 16:25:48,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 16:25:48,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 16:25:48,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 16:25:48,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 16:25:48,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 16:25:48,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 16:25:48,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 16:25:48,888 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 16:25:48,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 16:25:48,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 16:25:48,889 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 16:25:48,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 16:25:48,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 16:25:48,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 16:25:48,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 16:25:48,892 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 16:25:48,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 16:25:48,893 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 16:25:48,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 16:25:48,893 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 16:25:48,893 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 16:25:48,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 16:25:48,894 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 16:25:48,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 16:25:48,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:25:48,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 16:25:48,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 16:25:48,895 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-30 16:25:48,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 16:25:48,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 16:25:48,895 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-30 16:25:48,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-30 16:25:48,896 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 16:25:48,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 16:25:48,896 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 16:25:48,899 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:25:49,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 16:25:49,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 16:25:49,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 16:25:49,145 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 16:25:49,145 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 16:25:49,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2024-05-30 16:25:50,312 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 16:25:50,436 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 16:25:50,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2024-05-30 16:25:50,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d0d84556f/1b2e615562b94651a29b87f010d7f028/FLAG49b34409d [2024-05-30 16:25:50,454 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d0d84556f/1b2e615562b94651a29b87f010d7f028 [2024-05-30 16:25:50,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 16:25:50,459 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 16:25:50,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 16:25:50,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 16:25:50,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 16:25:50,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:25:50" (1/1) ... [2024-05-30 16:25:50,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47919d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:25:50, skipping insertion in model container [2024-05-30 16:25:50,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:25:50" (1/1) ... [2024-05-30 16:25:50,485 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 16:25:50,601 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c[2476,2489] [2024-05-30 16:25:50,605 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:25:50,612 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 16:25:50,635 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c[2476,2489] [2024-05-30 16:25:50,636 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:25:50,646 INFO L206 MainTranslator]: Completed translation [2024-05-30 16:25:50,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:25:50 WrapperNode [2024-05-30 16:25:50,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 16:25:50,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 16:25:50,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 16:25:50,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 16:25:50,661 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:25:50" (1/1) ... [2024-05-30 16:25:50,668 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:25:50" (1/1) ... [2024-05-30 16:25:50,681 INFO L138 Inliner]: procedures = 21, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2024-05-30 16:25:50,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 16:25:50,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 16:25:50,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 16:25:50,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 16:25:50,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:25:50" (1/1) ... [2024-05-30 16:25:50,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:25:50" (1/1) ... [2024-05-30 16:25:50,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:25:50" (1/1) ... [2024-05-30 16:25:50,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:25:50" (1/1) ... [2024-05-30 16:25:50,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:25:50" (1/1) ... [2024-05-30 16:25:50,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:25:50" (1/1) ... [2024-05-30 16:25:50,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:25:50" (1/1) ... [2024-05-30 16:25:50,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:25:50" (1/1) ... [2024-05-30 16:25:50,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 16:25:50,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 16:25:50,708 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 16:25:50,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 16:25:50,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:25:50" (1/1) ... [2024-05-30 16:25:50,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:25:50,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:25:50,751 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:25:50,769 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:25:50,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 16:25:50,796 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 16:25:50,796 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 16:25:50,796 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 16:25:50,796 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 16:25:50,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 16:25:50,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 16:25:50,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 16:25:50,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 16:25:50,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 16:25:50,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 16:25:50,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 16:25:50,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 16:25:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 16:25:50,800 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:25:50,913 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 16:25:50,914 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 16:25:51,124 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 16:25:51,162 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 16:25:51,162 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-30 16:25:51,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:25:51 BoogieIcfgContainer [2024-05-30 16:25:51,162 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 16:25:51,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 16:25:51,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 16:25:51,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 16:25:51,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 04:25:50" (1/3) ... [2024-05-30 16:25:51,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739396fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:25:51, skipping insertion in model container [2024-05-30 16:25:51,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:25:50" (2/3) ... [2024-05-30 16:25:51,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739396fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:25:51, skipping insertion in model container [2024-05-30 16:25:51,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:25:51" (3/3) ... [2024-05-30 16:25:51,168 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-threaded-sum-2.wvr.c [2024-05-30 16:25:51,175 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 16:25:51,182 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 16:25:51,183 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 16:25:51,183 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 16:25:51,227 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-30 16:25:51,260 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:25:51,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 16:25:51,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:25:51,266 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:25:51,279 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:25:51,311 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 16:25:51,319 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 16:25:51,324 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;@222d8013, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:25:51,324 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 16:25:51,329 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:25:51,454 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:51,454 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:25:51,454 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:25:51,555 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:51,555 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:25:51,555 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:25:51,561 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 102 states. [2024-05-30 16:25:51,561 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:25:51,564 INFO L78 Accepts]: Start accepts. Automaton has currently 109 states, but on-demand construction may add more states Word has length 64 [2024-05-30 16:25:51,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:25:51,566 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:25:51,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:25:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1139017544, now seen corresponding path program 1 times [2024-05-30 16:25:51,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:25:51,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721787998] [2024-05-30 16:25:51,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:25:51,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:25:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:25:51,821 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:25:51,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:25:51,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721787998] [2024-05-30 16:25:51,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721787998] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:25:51,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:25:51,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 16:25:51,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638039395] [2024-05-30 16:25:51,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:25:51,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 16:25:51,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:25:51,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 16:25:51,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 16:25:51,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:25:51,854 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:25:51,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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:25:51,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:25:51,855 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:25:51,938 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:51,939 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:25:51,939 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:25:52,000 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:52,000 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:25:52,000 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:25:52,012 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 108 states. [2024-05-30 16:25:52,012 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:25:52,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:25:52,014 INFO L78 Accepts]: Start accepts. Automaton has currently 115 states, but on-demand construction may add more states Word has length 62 [2024-05-30 16:25:52,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:25:52,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 16:25:52,016 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:25:52,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:25:52,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1025848032, now seen corresponding path program 1 times [2024-05-30 16:25:52,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:25:52,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317411785] [2024-05-30 16:25:52,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:25:52,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:25:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:25:52,411 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:25:52,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:25:52,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317411785] [2024-05-30 16:25:52,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317411785] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:25:52,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:25:52,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 16:25:52,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608574773] [2024-05-30 16:25:52,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:25:52,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 16:25:52,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:25:52,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 16:25:52,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-30 16:25:52,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:25:52,414 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:25:52,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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:25:52,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:25:52,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:25:52,415 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:25:52,573 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:52,573 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:25:52,573 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:25:52,667 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:52,668 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:25:52,668 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:25:52,736 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:52,737 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:25:52,737 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:52,756 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:52,757 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:52,757 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:52,761 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:52,761 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:25:52,762 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:52,812 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:52,813 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:52,813 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:52,822 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:52,823 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:52,823 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:52,878 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:52,879 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:52,879 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:52,905 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 185 states. [2024-05-30 16:25:52,905 INFO L212 cStratifiedReduction]: Copied states 34 times. [2024-05-30 16:25:52,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:25:52,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:25:52,906 INFO L78 Accepts]: Start accepts. Automaton has currently 169 states, but on-demand construction may add more states Word has length 76 [2024-05-30 16:25:52,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:25:52,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 16:25:52,907 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:25:52,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:25:52,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1833598350, now seen corresponding path program 1 times [2024-05-30 16:25:52,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:25:52,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447322846] [2024-05-30 16:25:52,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:25:52,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:25:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:25:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 16:25:53,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:25:53,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447322846] [2024-05-30 16:25:53,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447322846] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:25:53,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:25:53,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-30 16:25:53,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654461577] [2024-05-30 16:25:53,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:25:53,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-30 16:25:53,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:25:53,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-30 16:25:53,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-30 16:25:53,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:25:53,217 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:25:53,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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:25:53,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:25:53,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:25:53,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:25:53,218 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:25:53,303 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:53,303 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:25:53,304 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:53,336 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:53,336 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:53,337 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:53,386 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:53,386 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:53,387 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:53,420 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:53,421 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:53,421 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:53,423 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:53,423 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:25:53,423 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:53,469 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:53,469 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:53,469 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:53,497 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:53,497 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:53,497 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:53,508 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:53,508 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:53,508 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:25:53,514 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:53,515 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:25:53,515 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:25:53,515 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:53,515 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:25:53,515 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:25:53,520 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:53,520 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:25:53,520 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:25:53,528 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:53,529 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:25:53,529 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:25:53,549 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:53,549 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:25:53,549 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:25:53,549 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:53,549 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:25:53,549 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:25:53,552 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:53,552 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:25:53,552 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:25:53,556 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:53,557 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:25:53,558 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:25:53,582 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:25:53,582 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:25:53,583 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:25:53,592 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 226 states. [2024-05-30 16:25:53,592 INFO L212 cStratifiedReduction]: Copied states 45 times. [2024-05-30 16:25:53,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:25:53,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:25:53,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:25:53,593 INFO L78 Accepts]: Start accepts. Automaton has currently 204 states, but on-demand construction may add more states Word has length 72 [2024-05-30 16:25:53,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:25:53,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-30 16:25:53,596 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:25:53,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:25:53,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1531062961, now seen corresponding path program 2 times [2024-05-30 16:25:53,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:25:53,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543705667] [2024-05-30 16:25:53,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:25:53,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:25:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:25:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:25:55,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:25:55,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543705667] [2024-05-30 16:25:55,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543705667] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:25:55,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936666089] [2024-05-30 16:25:55,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:25:55,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:25:55,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:25:55,716 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:25:55,732 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:25:55,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:25:55,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:25:55,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-30 16:25:55,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:25:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:25:56,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:25:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:25:59,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936666089] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:25:59,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:25:59,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 17] total 36 [2024-05-30 16:25:59,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388918457] [2024-05-30 16:25:59,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:25:59,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-05-30 16:25:59,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:25:59,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-05-30 16:25:59,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1066, Unknown=0, NotChecked=0, Total=1260 [2024-05-30 16:25:59,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:25:59,381 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:25:59,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.805555555555555) internal successors, (173), 36 states have internal predecessors, (173), 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:25:59,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:25:59,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:25:59,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:25:59,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:25:59,381 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:26:01,552 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:26:01,552 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:26:01,553 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ~t~0, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:01,564 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:26:01,564 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ~t~0, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:01,565 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ~t~0, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:01,582 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:26:01,582 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ~t~0, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:01,582 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:01,586 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:26:01,587 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:01,587 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:01,596 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:26:01,596 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:01,597 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:01,610 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:26:01,610 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:01,610 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:01,613 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:26:01,613 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:01,613 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:01,614 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:26:01,614 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:01,614 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:01,616 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:26:01,617 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:01,617 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:01,631 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:26:01,634 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:01,635 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:01,717 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 218 states. [2024-05-30 16:26:01,717 INFO L212 cStratifiedReduction]: Copied states 15 times. [2024-05-30 16:26:01,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:26:01,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:26:01,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:26:01,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-05-30 16:26:01,718 INFO L78 Accepts]: Start accepts. Automaton has currently 234 states, but on-demand construction may add more states Word has length 85 [2024-05-30 16:26:01,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:26:01,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-30 16:26:01,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:26:01,919 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:26:01,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:26:01,920 INFO L85 PathProgramCache]: Analyzing trace with hash -24907081, now seen corresponding path program 3 times [2024-05-30 16:26:01,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:26:01,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694776843] [2024-05-30 16:26:01,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:26:01,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:26:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:26:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-30 16:26:02,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:26:02,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694776843] [2024-05-30 16:26:02,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694776843] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:26:02,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59309139] [2024-05-30 16:26:02,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:26:02,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:26:02,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:26:02,202 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:26:02,224 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:26:02,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-05-30 16:26:02,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:26:02,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 17 conjunts are in the unsatisfiable core [2024-05-30 16:26:02,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:26:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-05-30 16:26:02,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:26:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-30 16:26:02,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59309139] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:26:02,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:26:02,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 6] total 16 [2024-05-30 16:26:02,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397215179] [2024-05-30 16:26:02,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:26:02,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-05-30 16:26:02,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:26:02,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-05-30 16:26:02,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-05-30 16:26:02,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:26:02,555 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:26:02,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 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:26:02,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:26:02,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:26:02,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:26:02,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-05-30 16:26:02,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:26:02,556 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:26:02,891 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:26:02,891 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:26:02,891 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ~t~0, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:02,901 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:26:02,901 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ~t~0, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:02,901 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ~t~0, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:03,078 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:26:03,078 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ~t~0, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:03,078 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:03,081 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:26:03,081 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:03,081 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:03,146 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:26:03,146 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:03,146 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:03,160 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:26:03,160 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:03,160 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:03,163 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:26:03,163 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:03,163 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:03,163 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:26:03,163 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:03,163 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:03,166 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:26:03,167 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:03,167 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:03,180 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:26:03,180 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:03,181 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:26:03,368 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 218 states. [2024-05-30 16:26:03,369 INFO L212 cStratifiedReduction]: Copied states 12 times. [2024-05-30 16:26:03,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:26:03,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:26:03,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:26:03,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:26:03,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:26:03,369 INFO L78 Accepts]: Start accepts. Automaton has currently 259 states, but on-demand construction may add more states Word has length 81 [2024-05-30 16:26:03,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:26:03,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-30 16:26:03,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:26:03,576 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:26:03,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:26:03,577 INFO L85 PathProgramCache]: Analyzing trace with hash 577781522, now seen corresponding path program 4 times [2024-05-30 16:26:03,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:26:03,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349254178] [2024-05-30 16:26:03,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:26:03,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:26:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:26:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:26:08,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:26:08,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349254178] [2024-05-30 16:26:08,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349254178] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:26:08,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825888699] [2024-05-30 16:26:08,786 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 16:26:08,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:26:08,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:26:08,788 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:26:08,811 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:26:09,361 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 16:26:09,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:26:09,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 31 conjunts are in the unsatisfiable core [2024-05-30 16:26:09,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:26:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:26:12,546 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:27:13,364 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:27:13,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825888699] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:27:13,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:27:13,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 47 [2024-05-30 16:27:13,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301030564] [2024-05-30 16:27:13,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:27:13,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-05-30 16:27:13,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:27:13,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-05-30 16:27:13,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1851, Unknown=7, NotChecked=0, Total=2162 [2024-05-30 16:27:13,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:27:13,367 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:27:13,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 4.148936170212766) internal successors, (195), 47 states have internal predecessors, (195), 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:27:13,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:27:13,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:27:13,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:27:13,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:27:13,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:27:13,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:27:13,368 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:27:26,632 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:28,652 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:30,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:27:55,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 16:28:06,323 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:28:06,323 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:28:06,323 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~s~0, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:28:06,349 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:28:06,349 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~s~0, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:28:06,349 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~s~0, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:28:06,377 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:28:06,377 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~s~0, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:28:06,377 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~s~0, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:28:06,388 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:28:06,388 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~s~0, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:28:06,388 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~s~0, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:28:06,401 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:28:06,401 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~s~0, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:28:06,401 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~s~0, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:28:06,405 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:28:06,406 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~s~0, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:28:06,406 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~s~0, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:28:06,406 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:28:06,406 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~s~0, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:28:06,406 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~s~0, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:28:06,413 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:28:06,413 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~s~0, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:28:06,413 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~s~0, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:28:06,426 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:28:06,426 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~s~0, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:28:06,426 INFO L395 cStratifiedReduction]: Actual level: [thread1Thread1of1ForFork1_~cond~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~s~0, ~t~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~cond~1] [2024-05-30 16:28:06,552 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 254 states. [2024-05-30 16:28:06,553 INFO L212 cStratifiedReduction]: Copied states 6 times. [2024-05-30 16:28:06,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:28:06,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:28:06,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:28:06,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:28:06,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:28:06,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-05-30 16:28:06,553 INFO L78 Accepts]: Start accepts. Automaton has currently 301 states, but on-demand construction may add more states Word has length 99 [2024-05-30 16:28:06,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:28:06,567 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:28:06,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:28:06,754 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:28:06,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:28:06,755 INFO L85 PathProgramCache]: Analyzing trace with hash -530071630, now seen corresponding path program 5 times [2024-05-30 16:28:06,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:28:06,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784151799] [2024-05-30 16:28:06,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:28:06,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:28:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:31:45,033 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:31:45,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:31:45,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784151799] [2024-05-30 16:31:45,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784151799] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:31:45,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475031139] [2024-05-30 16:31:45,034 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 16:31:45,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:31:45,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:31:45,037 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:31:45,037 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:31:45,833 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-05-30 16:31:45,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:31:45,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 37 conjunts are in the unsatisfiable core [2024-05-30 16:31:45,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:32:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:32:26,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2024-05-30 16:40:16,523 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 16:40:16,523 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:40:16,523 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:40:17,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-05-30 16:40:17,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-30 16:40:17,729 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-05-30 16:40:17,741 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 16:40:17,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-30 16:40:17,741 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 100 with TraceHistMax 11,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2024-05-30 16:40:17,746 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1] [2024-05-30 16:40:17,748 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/3) [2024-05-30 16:40:17,751 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 16:40:17,751 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 16:40:17,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 04:40:17 BasicIcfg [2024-05-30 16:40:17,753 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 16:40:17,754 INFO L158 Benchmark]: Toolchain (without parser) took 867294.65ms. Allocated memory was 190.8MB in the beginning and 947.9MB in the end (delta: 757.1MB). Free memory was 125.2MB in the beginning and 587.5MB in the end (delta: -462.3MB). Peak memory consumption was 296.9MB. Max. memory is 8.0GB. [2024-05-30 16:40:17,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2024-05-30 16:40:17,768 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory was 163.2MB in the beginning and 163.2MB in the end (delta: 64.2kB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 16:40:17,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.78ms. Allocated memory is still 190.8MB. Free memory was 125.0MB in the beginning and 113.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-30 16:40:17,771 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.08ms. Allocated memory is still 190.8MB. Free memory was 113.2MB in the beginning and 111.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-30 16:40:17,771 INFO L158 Benchmark]: Boogie Preprocessor took 26.08ms. Allocated memory is still 190.8MB. Free memory was 111.6MB in the beginning and 110.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 16:40:17,771 INFO L158 Benchmark]: RCFGBuilder took 453.99ms. Allocated memory was 190.8MB in the beginning and 242.2MB in the end (delta: 51.4MB). Free memory was 110.3MB in the beginning and 203.6MB in the end (delta: -93.3MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2024-05-30 16:40:17,771 INFO L158 Benchmark]: TraceAbstraction took 866589.30ms. Allocated memory was 242.2MB in the beginning and 947.9MB in the end (delta: 705.7MB). Free memory was 202.0MB in the beginning and 587.5MB in the end (delta: -385.4MB). Peak memory consumption was 320.8MB. Max. memory is 8.0GB. [2024-05-30 16:40:17,773 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory was 163.2MB in the beginning and 163.2MB in the end (delta: 64.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 184.78ms. Allocated memory is still 190.8MB. Free memory was 125.0MB in the beginning and 113.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.08ms. Allocated memory is still 190.8MB. Free memory was 113.2MB in the beginning and 111.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.08ms. Allocated memory is still 190.8MB. Free memory was 111.6MB in the beginning and 110.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 453.99ms. Allocated memory was 190.8MB in the beginning and 242.2MB in the end (delta: 51.4MB). Free memory was 110.3MB in the beginning and 203.6MB in the end (delta: -93.3MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. * TraceAbstraction took 866589.30ms. Allocated memory was 242.2MB in the beginning and 947.9MB in the end (delta: 705.7MB). Free memory was 202.0MB in the beginning and 587.5MB in the end (delta: -385.4MB). Peak memory consumption was 320.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 882, independent: 756, independent conditional: 756, independent unconditional: 0, dependent: 126, dependent conditional: 126, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 788, independent: 756, independent conditional: 756, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 788, independent: 756, independent conditional: 756, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 926, independent: 756, independent conditional: 0, independent unconditional: 756, dependent: 170, dependent conditional: 138, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 926, independent: 756, independent conditional: 0, independent unconditional: 756, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 926, independent: 756, independent conditional: 0, independent unconditional: 756, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 788, independent: 756, independent conditional: 0, independent unconditional: 756, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 788, independent: 756, independent conditional: 0, independent unconditional: 756, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 32, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 926, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 788, unknown conditional: 0, unknown unconditional: 788] , Statistics on independence cache: Total cache size (in pairs): 788, Positive cache size: 756, Positive conditional cache size: 0, Positive unconditional cache size: 756, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 138, Maximal queried relation: 6, Independence queries for same thread: 94 - StatisticsResult: Reduction benchmarks 16.0ms Time before loop, 215.0ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 4, Reduction States: 102, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 24.0ms Time before loop, 132.4ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 4, Reduction States: 108, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 90.2ms Time before loop, 398.8ms Time in loop, 0.5s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 13, Reduction States: 185, Duplicate States: 34, Protected Variables: 4 - StatisticsResult: Reduction benchmarks 35.7ms Time before loop, 337.9ms Time in loop, 0.4s Time in total, Has Loop: 1, wrong guesses: 4, overall guesses: 21, Reduction States: 226, Duplicate States: 45, Protected Variables: 5 - StatisticsResult: Reduction benchmarks 2108.4ms Time before loop, 226.9ms Time in loop, 2.3s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 14, Reduction States: 218, Duplicate States: 15, Protected Variables: 5 - StatisticsResult: Reduction benchmarks 233.9ms Time before loop, 578.6ms Time in loop, 0.8s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 13, Reduction States: 218, Duplicate States: 12, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 52890.9ms Time before loop, 293.7ms Time in loop, 53.2s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 12, Reduction States: 254, Duplicate States: 6, Protected Variables: 6 - StatisticsResult: Visitor Statistics States: 84, Transitions: 89, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 84, Transitions: 91, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 151, Transitions: 179, Traversal time: 0.5s - StatisticsResult: Visitor Statistics States: 192, Transitions: 240, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 167, Transitions: 198, Traversal time: 2.3s - StatisticsResult: Visitor Statistics States: 167, Transitions: 199, Traversal time: 0.8s - StatisticsResult: Visitor Statistics States: 179, Transitions: 211, Traversal time: 53.2s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 8, RedundantProofs: 3, ProvenStates: 100, Times there's more than one choice: 82, Avg number of choices: 3.42 - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 100 with TraceHistMax 11,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 98 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 866.5s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 57.6s, 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: 134, 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.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 75.8s InterpolantComputationTime, 678 NumberOfCodeBlocks, 663 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 17249 SizeOfPredicates, 41 NumberOfNonLiveVariables, 493 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 126/260 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