/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-2-unrolled.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 16:14:43,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 16:14:43,859 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-30 16:14:43,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 16:14:43,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 16:14:43,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-30 16:14:43,894 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 16:14:43,894 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 16:14:43,895 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 16:14:43,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 16:14:43,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 16:14:43,898 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 16:14:43,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 16:14:43,900 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 16:14:43,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 16:14:43,900 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 16:14:43,900 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 16:14:43,900 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 16:14:43,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 16:14:43,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 16:14:43,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 16:14:43,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 16:14:43,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 16:14:43,901 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 16:14:43,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 16:14:43,902 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 16:14:43,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 16:14:43,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 16:14:43,902 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 16:14:43,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 16:14:43,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:14:43,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 16:14:43,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 16:14:43,904 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-30 16:14:43,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 16:14:43,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 16:14:43,904 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-30 16:14:43,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-30 16:14:43,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 16:14:43,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 16:14:43,904 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 16:14:43,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-05-30 16:14:44,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 16:14:44,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 16:14:44,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 16:14:44,141 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 16:14:44,141 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 16:14:44,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2-unrolled.wvr.c [2024-05-30 16:14:45,169 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 16:14:45,318 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 16:14:45,318 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2-unrolled.wvr.c [2024-05-30 16:14:45,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/93de10e8b/de2f396fdc1b4ddc9d196a2a04e5ed31/FLAGdc6613856 [2024-05-30 16:14:45,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/93de10e8b/de2f396fdc1b4ddc9d196a2a04e5ed31 [2024-05-30 16:14:45,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 16:14:45,340 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 16:14:45,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 16:14:45,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 16:14:45,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 16:14:45,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:14:45" (1/1) ... [2024-05-30 16:14:45,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b126e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:45, skipping insertion in model container [2024-05-30 16:14:45,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:14:45" (1/1) ... [2024-05-30 16:14:45,368 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 16:14:45,523 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2-unrolled.wvr.c[2332,2345] [2024-05-30 16:14:45,527 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:14:45,534 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 16:14:45,562 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2-unrolled.wvr.c[2332,2345] [2024-05-30 16:14:45,562 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:14:45,573 INFO L206 MainTranslator]: Completed translation [2024-05-30 16:14:45,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:45 WrapperNode [2024-05-30 16:14:45,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 16:14:45,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 16:14:45,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 16:14:45,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 16:14:45,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:45" (1/1) ... [2024-05-30 16:14:45,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:45" (1/1) ... [2024-05-30 16:14:45,605 INFO L138 Inliner]: procedures = 20, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-05-30 16:14:45,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 16:14:45,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 16:14:45,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 16:14:45,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 16:14:45,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:45" (1/1) ... [2024-05-30 16:14:45,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:45" (1/1) ... [2024-05-30 16:14:45,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:45" (1/1) ... [2024-05-30 16:14:45,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:45" (1/1) ... [2024-05-30 16:14:45,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:45" (1/1) ... [2024-05-30 16:14:45,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:45" (1/1) ... [2024-05-30 16:14:45,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:45" (1/1) ... [2024-05-30 16:14:45,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:45" (1/1) ... [2024-05-30 16:14:45,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 16:14:45,637 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 16:14:45,638 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 16:14:45,638 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 16:14:45,638 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:45" (1/1) ... [2024-05-30 16:14:45,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:14:45,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:14:45,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-30 16:14:45,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-30 16:14:45,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 16:14:45,764 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 16:14:45,764 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 16:14:45,764 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 16:14:45,764 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 16:14:45,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 16:14:45,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 16:14:45,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 16:14:45,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 16:14:45,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 16:14:45,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 16:14:45,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 16:14:45,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 16:14:45,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 16:14:45,766 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 16:14:45,837 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 16:14:45,839 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 16:14:46,048 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 16:14:46,069 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 16:14:46,069 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-30 16:14:46,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:14:46 BoogieIcfgContainer [2024-05-30 16:14:46,070 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 16:14:46,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 16:14:46,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 16:14:46,074 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 16:14:46,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 04:14:45" (1/3) ... [2024-05-30 16:14:46,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321b1f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:14:46, skipping insertion in model container [2024-05-30 16:14:46,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:14:45" (2/3) ... [2024-05-30 16:14:46,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321b1f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:14:46, skipping insertion in model container [2024-05-30 16:14:46,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:14:46" (3/3) ... [2024-05-30 16:14:46,077 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-2-unrolled.wvr.c [2024-05-30 16:14:46,085 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 16:14:46,093 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 16:14:46,094 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 16:14:46,094 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 16:14:46,173 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-30 16:14:46,216 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:14:46,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 16:14:46,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:14:46,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 16:14:46,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-30 16:14:46,270 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 16:14:46,277 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 16:14:46,283 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;@6ae02ab1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:14:46,283 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 16:14:46,290 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:14:46,388 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:46,388 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:46,388 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:46,426 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:46,426 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:46,426 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:46,455 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:46,455 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:46,455 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:46,487 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:46,487 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:46,487 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:46,503 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:46,503 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:46,503 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:46,526 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:46,526 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:46,526 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:46,556 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:46,556 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:46,556 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:46,570 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:46,570 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:46,570 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:46,579 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 213 states. [2024-05-30 16:14:46,579 INFO L212 cStratifiedReduction]: Copied states 8 times. [2024-05-30 16:14:46,582 INFO L78 Accepts]: Start accepts. Automaton has currently 215 states, but on-demand construction may add more states Word has length 65 [2024-05-30 16:14:46,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:14:46,584 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:14:46,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:14:46,589 INFO L85 PathProgramCache]: Analyzing trace with hash 145907095, now seen corresponding path program 1 times [2024-05-30 16:14:46,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:14:46,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754231684] [2024-05-30 16:14:46,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:14:46,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:14:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:14:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:14:46,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:14:46,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754231684] [2024-05-30 16:14:46,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754231684] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:14:46,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:14:46,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 16:14:46,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236113625] [2024-05-30 16:14:46,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:14:46,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 16:14:46,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:14:46,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 16:14:46,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 16:14:46,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:46,842 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:14:46,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:14:46,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:46,843 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:14:46,868 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:46,869 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:46,869 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:46,875 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:46,876 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:46,876 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:46,887 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:46,888 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:46,888 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:46,899 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:46,900 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:46,900 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:46,920 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:46,921 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:46,921 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:46,927 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:46,927 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:46,927 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:46,933 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:46,934 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:46,934 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:46,940 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:46,940 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:46,940 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:46,946 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 243 states. [2024-05-30 16:14:46,947 INFO L212 cStratifiedReduction]: Copied states 8 times. [2024-05-30 16:14:46,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:46,947 INFO L78 Accepts]: Start accepts. Automaton has currently 245 states, but on-demand construction may add more states Word has length 63 [2024-05-30 16:14:46,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:14:46,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 16:14:46,948 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:14:46,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:14:46,948 INFO L85 PathProgramCache]: Analyzing trace with hash -15943504, now seen corresponding path program 1 times [2024-05-30 16:14:46,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:14:46,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103190896] [2024-05-30 16:14:46,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:14:46,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:14:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:14:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:14:47,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:14:47,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103190896] [2024-05-30 16:14:47,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103190896] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:14:47,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:14:47,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-30 16:14:47,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048586846] [2024-05-30 16:14:47,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:14:47,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-30 16:14:47,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:14:47,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-30 16:14:47,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-30 16:14:47,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:47,285 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:14:47,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:14:47,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:47,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:47,286 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:14:47,343 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:47,344 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:47,345 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:47,365 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 180 states. [2024-05-30 16:14:47,365 INFO L212 cStratifiedReduction]: Copied states 1 times. [2024-05-30 16:14:47,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:47,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:14:47,370 INFO L78 Accepts]: Start accepts. Automaton has currently 189 states, but on-demand construction may add more states Word has length 72 [2024-05-30 16:14:47,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:14:47,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 16:14:47,371 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:14:47,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:14:47,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1855692341, now seen corresponding path program 1 times [2024-05-30 16:14:47,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:14:47,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246503827] [2024-05-30 16:14:47,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:14:47,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:14:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:14:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 16:14:47,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:14:47,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246503827] [2024-05-30 16:14:47,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246503827] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:14:47,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:14:47,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-30 16:14:47,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93581741] [2024-05-30 16:14:47,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:14:47,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-30 16:14:47,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:14:47,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-30 16:14:47,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-30 16:14:47,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:47,754 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:14:47,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:14:47,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:47,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:14:47,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:47,755 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:14:47,847 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:47,847 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:47,847 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:47,868 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 187 states. [2024-05-30 16:14:47,869 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:14:47,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:47,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:14:47,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:14:47,869 INFO L78 Accepts]: Start accepts. Automaton has currently 202 states, but on-demand construction may add more states Word has length 81 [2024-05-30 16:14:47,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:14:47,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-30 16:14:47,871 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:14:47,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:14:47,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1734368405, now seen corresponding path program 1 times [2024-05-30 16:14:47,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:14:47,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578171371] [2024-05-30 16:14:47,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:14:47,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:14:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:14:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 16:14:48,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:14:48,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578171371] [2024-05-30 16:14:48,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578171371] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:14:48,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:14:48,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-30 16:14:48,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502811674] [2024-05-30 16:14:48,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:14:48,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-30 16:14:48,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:14:48,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-30 16:14:48,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-30 16:14:48,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:48,167 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:14:48,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:14:48,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:48,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:14:48,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:14:48,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:48,168 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:14:48,239 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,239 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:48,240 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:48,280 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,280 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:48,280 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,284 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,285 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,285 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,315 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,316 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,316 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,329 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,330 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,330 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,345 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,346 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,346 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,352 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,352 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,352 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,368 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,368 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,368 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,384 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,385 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,385 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,397 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,398 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,398 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,404 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,404 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,404 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,409 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,410 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,410 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,454 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,454 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,454 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,459 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,460 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,460 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,466 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,466 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,466 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,472 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,472 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,472 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,473 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,474 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:48,474 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,481 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,483 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,485 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,500 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,500 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,502 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,510 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,511 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,511 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,563 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,564 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,564 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,572 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,573 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,573 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,580 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,580 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,580 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,592 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,592 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,592 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,606 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,606 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,606 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,614 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,614 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,614 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,624 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,624 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,624 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,633 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,633 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,633 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,645 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,645 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,645 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,657 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,657 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,660 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,669 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,669 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,669 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,677 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,677 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,677 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,679 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,679 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,679 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,707 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,707 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,707 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,712 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,712 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,712 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,717 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,717 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,717 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,725 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,725 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,725 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,742 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,743 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,744 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,751 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,752 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,752 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,761 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,762 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,762 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,795 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,795 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,795 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,808 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,808 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,809 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,815 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,815 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,815 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,822 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,822 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,823 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,829 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,830 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,830 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,831 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,832 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,832 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,857 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,857 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,857 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,862 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,862 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,862 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,866 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,867 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,867 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,875 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,875 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,875 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,887 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,887 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,887 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,897 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,897 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,897 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,903 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,903 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,904 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,910 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,911 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,911 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,920 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,920 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,921 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,926 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,926 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,926 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,933 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,933 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,933 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,942 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,942 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,942 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,944 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,944 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,944 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,979 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,979 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,979 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,989 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,989 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,989 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,996 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:48,996 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:48,996 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:49,001 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:49,002 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:49,002 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:49,008 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:49,008 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:49,009 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:49,013 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:49,013 INFO L394 cStratifiedReduction]: Guessed abstraction level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:49,013 INFO L395 cStratifiedReduction]: Actual level: [~pos~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-30 16:14:49,015 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1277 states. [2024-05-30 16:14:49,015 INFO L212 cStratifiedReduction]: Copied states 73 times. [2024-05-30 16:14:49,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:14:49,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 16:14:49,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:14:49,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:14:49,018 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 16:14:49,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-30 16:14:49,025 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-05-30 16:14:49,027 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/3) [2024-05-30 16:14:49,034 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:14:49,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 16:14:49,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:14:49,282 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 16:14:49,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-05-30 16:14:49,287 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 16:14:49,287 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 16:14:49,288 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;@6ae02ab1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:14:49,288 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 16:14:49,288 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:14:49,299 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 36 states. [2024-05-30 16:14:49,299 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:14:49,300 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 16:14:49,300 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-05-30 16:14:49,301 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/3) [2024-05-30 16:14:49,302 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:14:49,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 16:14:49,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:14:49,305 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 16:14:49,308 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 16:14:49,309 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-30 16:14:49,309 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;@6ae02ab1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:14:49,309 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 16:14:49,309 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:14:49,322 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:49,322 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:49,322 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:49,329 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:49,329 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:49,329 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:49,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-05-30 16:14:49,338 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:49,339 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:49,339 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:49,343 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:49,343 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:49,343 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:49,347 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:49,347 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:49,347 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:49,355 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:14:49,355 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:14:49,355 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:14:49,356 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 113 states. [2024-05-30 16:14:49,356 INFO L212 cStratifiedReduction]: Copied states 5 times. [2024-05-30 16:14:49,357 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-30 16:14:49,358 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-05-30 16:14:49,358 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (3/3) [2024-05-30 16:14:49,359 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 16:14:49,359 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 16:14:49,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 04:14:49 BasicIcfg [2024-05-30 16:14:49,362 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 16:14:49,362 INFO L158 Benchmark]: Toolchain (without parser) took 4021.86ms. Allocated memory was 278.9MB in the beginning and 356.5MB in the end (delta: 77.6MB). Free memory was 204.9MB in the beginning and 197.0MB in the end (delta: 7.9MB). Peak memory consumption was 86.3MB. Max. memory is 8.0GB. [2024-05-30 16:14:49,362 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 195.0MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 16:14:49,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.96ms. Allocated memory is still 278.9MB. Free memory was 204.7MB in the beginning and 193.0MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-30 16:14:49,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.75ms. Allocated memory is still 278.9MB. Free memory was 193.0MB in the beginning and 191.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-30 16:14:49,362 INFO L158 Benchmark]: Boogie Preprocessor took 31.10ms. Allocated memory is still 278.9MB. Free memory was 191.5MB in the beginning and 190.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 16:14:49,363 INFO L158 Benchmark]: RCFGBuilder took 432.40ms. Allocated memory is still 278.9MB. Free memory was 190.2MB in the beginning and 232.1MB in the end (delta: -41.9MB). Peak memory consumption was 6.1MB. Max. memory is 8.0GB. [2024-05-30 16:14:49,363 INFO L158 Benchmark]: TraceAbstraction took 3289.80ms. Allocated memory was 278.9MB in the beginning and 356.5MB in the end (delta: 77.6MB). Free memory was 231.0MB in the beginning and 197.0MB in the end (delta: 34.1MB). Peak memory consumption was 111.7MB. Max. memory is 8.0GB. [2024-05-30 16:14:49,365 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 195.0MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.96ms. Allocated memory is still 278.9MB. Free memory was 204.7MB in the beginning and 193.0MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.75ms. Allocated memory is still 278.9MB. Free memory was 193.0MB in the beginning and 191.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.10ms. Allocated memory is still 278.9MB. Free memory was 191.5MB in the beginning and 190.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 432.40ms. Allocated memory is still 278.9MB. Free memory was 190.2MB in the beginning and 232.1MB in the end (delta: -41.9MB). Peak memory consumption was 6.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3289.80ms. Allocated memory was 278.9MB in the beginning and 356.5MB in the end (delta: 77.6MB). Free memory was 231.0MB in the beginning and 197.0MB in the end (delta: 34.1MB). Peak memory consumption was 111.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2520, independent: 2273, independent conditional: 2273, independent unconditional: 0, dependent: 247, dependent conditional: 247, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2273, independent: 2273, independent conditional: 2273, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2273, independent: 2273, independent conditional: 2273, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2273, independent: 2273, independent conditional: 0, independent unconditional: 2273, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2273, independent: 2273, independent conditional: 0, independent unconditional: 2273, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2273, independent: 2273, independent conditional: 0, independent unconditional: 2273, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2273, independent: 2273, independent conditional: 0, independent unconditional: 2273, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2273, independent: 2245, independent conditional: 0, independent unconditional: 2245, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2273, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2273, unknown conditional: 0, unknown unconditional: 2273] , Statistics on independence cache: Total cache size (in pairs): 2273, Positive cache size: 2273, Positive conditional cache size: 0, Positive unconditional cache size: 2273, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 247 - StatisticsResult: Reduction benchmarks 32.0ms Time before loop, 256.7ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 10, Reduction States: 213, Duplicate States: 8, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 19.4ms Time before loop, 83.6ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 10, Reduction States: 243, Duplicate States: 8, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 47.9ms Time before loop, 30.9ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 3, Reduction States: 180, Duplicate States: 1, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 63.8ms Time before loop, 49.7ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 3, Reduction States: 187, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 54.0ms Time before loop, 793.2ms Time in loop, 0.8s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 65, Reduction States: 1277, Duplicate States: 73, Protected Variables: 3 - StatisticsResult: Visitor Statistics States: 178, Transitions: 211, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 178, Transitions: 213, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 96, Transitions: 103, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 102, Transitions: 108, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 1212, Transitions: 1499, Traversal time: 0.8s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 5, RedundantProofs: 2, ProvenStates: 201, Times there's more than one choice: 181, Avg number of choices: 3.616915422885572 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 1 - StatisticsResult: Reduction benchmarks 11.0ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 36, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 37, Transitions: 37, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 0, Times there's more than one choice: 0, Avg number of choices: NaN - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 114, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 80, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 80, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 80, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 80, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 80, unknown conditional: 0, unknown unconditional: 80] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 80, Positive conditional cache size: 0, Positive unconditional cache size: 80, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 34 - StatisticsResult: Reduction benchmarks 1.4ms Time before loop, 45.8ms Time in loop, 0.0s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 6, Reduction States: 113, Duplicate States: 5, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 114, Transitions: 136, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 0, Times there's more than one choice: 0, Avg number of choices: NaN - PositiveResult [Line: 87]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 119 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.5s, 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: 31, 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.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 1081 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 3/3 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 119 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 119 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-30 16:14:49,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2024-05-30 16:14:49,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2024-05-30 16:14:49,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-30 16:14:49,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...