/usr/lib/jvm/java-1.11.0-openjdk-amd64/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-bakery-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-26 00:48:15,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 00:48:15,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-01-26 00:48:15,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 00:48:15,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 00:48:15,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-01-26 00:48:15,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 00:48:15,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 00:48:15,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 00:48:15,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 00:48:15,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 00:48:15,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 00:48:15,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 00:48:15,286 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 00:48:15,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 00:48:15,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 00:48:15,286 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 00:48:15,286 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 00:48:15,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 00:48:15,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 00:48:15,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 00:48:15,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 00:48:15,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 00:48:15,287 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 00:48:15,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 00:48:15,288 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 00:48:15,288 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 00:48:15,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 00:48:15,288 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-26 00:48:15,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 00:48:15,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 00:48:15,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 00:48:15,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 00:48:15,289 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-01-26 00:48:15,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-01-26 00:48:15,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 00:48:15,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 00:48:15,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 00:48:15,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-26 00:48:15,290 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 00:48:15,290 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-01-26 00:48:15,290 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-01-26 00:48:15,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 00:48:15,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 00:48:15,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 00:48:15,618 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 00:48:15,619 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 00:48:15,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c [2024-01-26 00:48:17,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 00:48:17,510 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 00:48:17,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c [2024-01-26 00:48:17,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9d73dc471/55ec50bfdb5f46ca918ad08550f859c1/FLAGafa5056de [2024-01-26 00:48:17,557 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9d73dc471/55ec50bfdb5f46ca918ad08550f859c1 [2024-01-26 00:48:17,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 00:48:17,559 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 00:48:17,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 00:48:17,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 00:48:17,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 00:48:17,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 12:48:17" (1/1) ... [2024-01-26 00:48:17,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cdc9775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:17, skipping insertion in model container [2024-01-26 00:48:17,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 12:48:17" (1/1) ... [2024-01-26 00:48:17,624 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 00:48:17,929 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-bakery-4.wvr.c[8030,8043] [2024-01-26 00:48:17,940 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 00:48:17,962 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 00:48:18,022 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-bakery-4.wvr.c[8030,8043] [2024-01-26 00:48:18,023 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 00:48:18,043 INFO L206 MainTranslator]: Completed translation [2024-01-26 00:48:18,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:18 WrapperNode [2024-01-26 00:48:18,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 00:48:18,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 00:48:18,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 00:48:18,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 00:48:18,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:18" (1/1) ... [2024-01-26 00:48:18,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:18" (1/1) ... [2024-01-26 00:48:18,131 INFO L138 Inliner]: procedures = 23, calls = 176, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 408 [2024-01-26 00:48:18,131 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 00:48:18,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 00:48:18,132 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 00:48:18,132 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 00:48:18,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:18" (1/1) ... [2024-01-26 00:48:18,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:18" (1/1) ... [2024-01-26 00:48:18,164 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:18" (1/1) ... [2024-01-26 00:48:18,165 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:18" (1/1) ... [2024-01-26 00:48:18,177 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:18" (1/1) ... [2024-01-26 00:48:18,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:18" (1/1) ... [2024-01-26 00:48:18,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:18" (1/1) ... [2024-01-26 00:48:18,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:18" (1/1) ... [2024-01-26 00:48:18,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 00:48:18,208 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 00:48:18,208 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 00:48:18,208 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 00:48:18,208 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:18" (1/1) ... [2024-01-26 00:48:18,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 00:48:18,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:48:18,254 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-01-26 00:48:18,306 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-01-26 00:48:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 00:48:18,321 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 00:48:18,336 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 00:48:18,336 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 00:48:18,336 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 00:48:18,336 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-26 00:48:18,336 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-26 00:48:18,337 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-01-26 00:48:18,337 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-01-26 00:48:18,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-26 00:48:18,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 00:48:18,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-26 00:48:18,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-26 00:48:18,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-26 00:48:18,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 00:48:18,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 00:48:18,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-26 00:48:18,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 00:48:18,340 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-26 00:48:18,482 INFO L241 CfgBuilder]: Building ICFG [2024-01-26 00:48:18,483 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 00:48:19,073 INFO L282 CfgBuilder]: Performing block encoding [2024-01-26 00:48:19,353 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 00:48:19,354 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-26 00:48:19,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 12:48:19 BoogieIcfgContainer [2024-01-26 00:48:19,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 00:48:19,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 00:48:19,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 00:48:19,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 00:48:19,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 12:48:17" (1/3) ... [2024-01-26 00:48:19,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77cb94cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 12:48:19, skipping insertion in model container [2024-01-26 00:48:19,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:48:18" (2/3) ... [2024-01-26 00:48:19,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77cb94cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 12:48:19, skipping insertion in model container [2024-01-26 00:48:19,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 12:48:19" (3/3) ... [2024-01-26 00:48:19,364 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-4.wvr.c [2024-01-26 00:48:19,376 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-26 00:48:19,382 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 00:48:19,382 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-26 00:48:19,383 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 00:48:19,496 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-26 00:48:19,560 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 00:48:19,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 00:48:19,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 00:48:19,572 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-01-26 00:48:19,618 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-01-26 00:48:19,654 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 00:48:19,661 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-26 00:48:19,666 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;@20336f8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 00:48:19,666 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2024-01-26 00:48:19,774 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:48:19,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:48:19,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1143751545, now seen corresponding path program 1 times [2024-01-26 00:48:19,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:48:19,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912663494] [2024-01-26 00:48:19,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:48:19,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:48:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:48:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:48:20,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:48:20,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912663494] [2024-01-26 00:48:20,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912663494] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:48:20,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:48:20,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 00:48:20,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156776937] [2024-01-26 00:48:20,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:48:20,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-26 00:48:20,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:48:20,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-26 00:48:20,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-26 00:48:20,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:20,336 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:48:20,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 98.0) internal successors, (196), 2 states have internal predecessors, (196), 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-01-26 00:48:20,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:20,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:20,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 00:48:20,474 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:48:20,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:48:20,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1506351633, now seen corresponding path program 1 times [2024-01-26 00:48:20,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:48:20,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940545654] [2024-01-26 00:48:20,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:48:20,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:48:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:48:21,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:48:21,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:48:21,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940545654] [2024-01-26 00:48:21,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940545654] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:48:21,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:48:21,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-01-26 00:48:21,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532527925] [2024-01-26 00:48:21,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:48:21,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-01-26 00:48:21,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:48:21,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-01-26 00:48:21,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-01-26 00:48:21,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:21,859 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:48:21,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.933333333333334) internal successors, (194), 15 states have internal predecessors, (194), 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-01-26 00:48:21,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:21,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 00:48:22,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:22,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:48:22,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-26 00:48:22,890 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:48:22,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:48:22,891 INFO L85 PathProgramCache]: Analyzing trace with hash 508543679, now seen corresponding path program 2 times [2024-01-26 00:48:22,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:48:22,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12888298] [2024-01-26 00:48:22,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:48:22,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:48:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:48:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:48:24,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:48:24,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12888298] [2024-01-26 00:48:24,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12888298] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:48:24,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:48:24,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-01-26 00:48:24,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378436900] [2024-01-26 00:48:24,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:48:24,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-26 00:48:24,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:48:24,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-26 00:48:24,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-01-26 00:48:24,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:24,463 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:48:24,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.555555555555557) internal successors, (194), 9 states have internal predecessors, (194), 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-01-26 00:48:24,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:24,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:48:24,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 00:48:25,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:25,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:48:25,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 00:48:25,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-26 00:48:25,108 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:48:25,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:48:25,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1863894883, now seen corresponding path program 3 times [2024-01-26 00:48:25,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:48:25,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699221033] [2024-01-26 00:48:25,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:48:25,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:48:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:48:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:48:26,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:48:26,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699221033] [2024-01-26 00:48:26,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699221033] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:48:26,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:48:26,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-01-26 00:48:26,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761917344] [2024-01-26 00:48:26,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:48:26,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-01-26 00:48:26,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:48:26,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-01-26 00:48:26,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-01-26 00:48:26,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:26,710 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:48:26,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.4) internal successors, (194), 10 states have internal predecessors, (194), 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-01-26 00:48:26,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:26,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:48:26,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 00:48:26,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 00:48:31,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:31,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:48:31,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 00:48:31,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 00:48:31,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-26 00:48:31,944 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:48:31,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:48:31,945 INFO L85 PathProgramCache]: Analyzing trace with hash 964112821, now seen corresponding path program 4 times [2024-01-26 00:48:31,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:48:31,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511129916] [2024-01-26 00:48:31,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:48:31,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:48:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:48:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:48:32,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:48:32,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511129916] [2024-01-26 00:48:32,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511129916] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:48:32,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:48:32,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-26 00:48:32,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360019782] [2024-01-26 00:48:32,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:48:32,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 00:48:32,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:48:32,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 00:48:32,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 00:48:32,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:32,115 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:48:32,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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-01-26 00:48:32,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:32,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-01-26 00:48:32,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 00:48:32,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 00:48:32,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 00:48:33,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:33,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:48:33,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-26 00:48:33,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 00:48:33,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:48:33,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-26 00:48:33,704 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:48:33,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:48:33,705 INFO L85 PathProgramCache]: Analyzing trace with hash -307772355, now seen corresponding path program 5 times [2024-01-26 00:48:33,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:48:33,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232394617] [2024-01-26 00:48:33,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:48:33,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:48:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:48:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:48:33,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:48:33,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232394617] [2024-01-26 00:48:33,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232394617] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:48:33,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:48:33,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-26 00:48:33,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194839681] [2024-01-26 00:48:33,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:48:33,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-26 00:48:33,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:48:33,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-26 00:48:33,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-26 00:48:33,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:33,898 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:48:33,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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-01-26 00:48:33,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:48:33,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:48:33,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-01-26 00:48:33,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 00:48:33,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:48:33,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 00:52:18,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:52:18,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:52:18,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-26 00:52:18,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-26 00:52:18,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:52:18,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:52:18,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-26 00:52:18,373 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 00:52:18,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 00:52:18,374 INFO L85 PathProgramCache]: Analyzing trace with hash -306744163, now seen corresponding path program 6 times [2024-01-26 00:52:18,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 00:52:18,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83349731] [2024-01-26 00:52:18,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 00:52:18,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 00:52:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 00:52:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 00:52:19,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 00:52:19,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83349731] [2024-01-26 00:52:19,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83349731] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 00:52:19,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 00:52:19,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-01-26 00:52:19,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254932462] [2024-01-26 00:52:19,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 00:52:19,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-01-26 00:52:19,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 00:52:19,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-01-26 00:52:19,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-01-26 00:52:19,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:52:19,541 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 00:52:19,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.4) internal successors, (194), 10 states have internal predecessors, (194), 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-01-26 00:52:19,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 00:52:19,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-01-26 00:52:19,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-01-26 00:52:19,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-01-26 00:52:19,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:52:19,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-01-26 00:52:19,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Received shutdown request... [2024-01-26 01:03:13,398 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 01:03:13,401 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 01:03:13,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-26 01:03:13,719 WARN L619 AbstractCegarLoop]: Verification canceled: while executing DynamicStratifiedReduction. [2024-01-26 01:03:13,721 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-26 01:03:13,764 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1] [2024-01-26 01:03:13,765 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/5) [2024-01-26 01:03:13,766 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-26 01:03:13,767 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-26 01:03:13,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 01:03:13 BasicIcfg [2024-01-26 01:03:13,768 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-26 01:03:13,769 INFO L158 Benchmark]: Toolchain (without parser) took 896209.38ms. Allocated memory was 233.8MB in the beginning and 514.9MB in the end (delta: 281.0MB). Free memory was 180.9MB in the beginning and 186.4MB in the end (delta: -5.5MB). Peak memory consumption was 410.2MB. Max. memory is 8.0GB. [2024-01-26 01:03:13,769 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 180.4MB. Free memory is still 129.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-01-26 01:03:13,769 INFO L158 Benchmark]: CACSL2BoogieTranslator took 485.41ms. Allocated memory is still 233.8MB. Free memory was 180.4MB in the beginning and 166.2MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-01-26 01:03:13,769 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.17ms. Allocated memory is still 233.8MB. Free memory was 166.2MB in the beginning and 163.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-01-26 01:03:13,769 INFO L158 Benchmark]: Boogie Preprocessor took 75.42ms. Allocated memory is still 233.8MB. Free memory was 163.1MB in the beginning and 161.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 01:03:13,770 INFO L158 Benchmark]: RCFGBuilder took 1146.37ms. Allocated memory is still 233.8MB. Free memory was 161.0MB in the beginning and 189.2MB in the end (delta: -28.3MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. [2024-01-26 01:03:13,770 INFO L158 Benchmark]: TraceAbstraction took 894412.14ms. Allocated memory was 233.8MB in the beginning and 514.9MB in the end (delta: 281.0MB). Free memory was 188.2MB in the beginning and 186.4MB in the end (delta: 1.8MB). Peak memory consumption was 416.5MB. Max. memory is 8.0GB. [2024-01-26 01:03:13,774 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.10ms. Allocated memory is still 180.4MB. Free memory is still 129.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 485.41ms. Allocated memory is still 233.8MB. Free memory was 180.4MB in the beginning and 166.2MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 83.17ms. Allocated memory is still 233.8MB. Free memory was 166.2MB in the beginning and 163.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 75.42ms. Allocated memory is still 233.8MB. Free memory was 163.1MB in the beginning and 161.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1146.37ms. Allocated memory is still 233.8MB. Free memory was 161.0MB in the beginning and 189.2MB in the end (delta: -28.3MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. * TraceAbstraction took 894412.14ms. Allocated memory was 233.8MB in the beginning and 514.9MB in the end (delta: 281.0MB). Free memory was 188.2MB in the beginning and 186.4MB in the end (delta: 1.8MB). Peak memory consumption was 416.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 38249, independent: 37938, independent conditional: 37938, independent unconditional: 0, dependent: 311, dependent conditional: 311, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38236, independent: 37938, independent conditional: 37938, independent unconditional: 0, dependent: 298, dependent conditional: 298, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38236, independent: 37938, independent conditional: 37938, independent unconditional: 0, dependent: 298, dependent conditional: 298, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40113, independent: 37938, independent conditional: 0, independent unconditional: 37938, dependent: 2175, dependent conditional: 1877, dependent unconditional: 298, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40113, independent: 37938, independent conditional: 0, independent unconditional: 37938, dependent: 2175, dependent conditional: 0, dependent unconditional: 2175, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40113, independent: 37938, independent conditional: 0, independent unconditional: 37938, dependent: 2175, dependent conditional: 0, dependent unconditional: 2175, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38236, independent: 37938, independent conditional: 0, independent unconditional: 37938, dependent: 298, dependent conditional: 0, dependent unconditional: 298, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 38236, independent: 37732, independent conditional: 0, independent unconditional: 37732, dependent: 504, dependent conditional: 0, dependent unconditional: 504, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 504, independent: 206, independent conditional: 0, independent unconditional: 206, dependent: 298, dependent conditional: 0, dependent unconditional: 298, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 504, independent: 206, independent conditional: 0, independent unconditional: 206, dependent: 298, dependent conditional: 0, dependent unconditional: 298, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 504, independent: 206, independent conditional: 0, independent unconditional: 206, dependent: 298, dependent conditional: 0, dependent unconditional: 298, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1033, independent: 286, independent conditional: 0, independent unconditional: 286, dependent: 747, dependent conditional: 0, dependent unconditional: 747, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 40113, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1877, dependent conditional: 0, dependent unconditional: 1877, unknown: 38236, unknown conditional: 0, unknown unconditional: 38236] , Statistics on independence cache: Total cache size (in pairs): 38236, Positive cache size: 37938, Positive conditional cache size: 0, Positive unconditional cache size: 37938, Negative cache size: 298, Negative conditional cache size: 0, Negative unconditional cache size: 298, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1877, Maximal queried relation: 7, Independence queries for same thread: 13 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 6, RedundantProofs: 1, ProvenStates: 1180, Times there's more than one choice: 127, Avg number of choices: 1.2864406779661017 - StatisticsResult: Reduction benchmarks 0.2s Time before loop, 224.3s Time in loop, 224.5s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, ULTIMATE.start_main_~#t4~0#1.offset, thread4Thread1of1ForFork1_#in~_argptr#1.offset, write~int_#ptr.base, thread1_#res#1.base, thread2_#res#1.base, thread3_#res#1.base, thread4_#res#1.base, thread2Thread1of1ForFork2_~_argptr#1.base, ULTIMATE.start_main_#t~mem26#1, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_#t~mem29#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet9#1, thread2Thread1of1ForFork2_#res#1.offset, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_#t~post3#1, ULTIMATE.start_main_~#t3~0#1.offset, thread3Thread1of1ForFork3_~_argptr#1.offset, thread4Thread1of1ForFork1_#in~_argptr#1.base, thread1Thread1of1ForFork0_#res#1.base, thread1_~_argptr#1.base, thread2_~_argptr#1.base, thread3_~_argptr#1.base, thread4_~_argptr#1.base, read~int_#ptr.base, ULTIMATE.start_#t~ret30#1, thread2Thread1of1ForFork2_thidvar0, old(thread2Thread1of1ForFork2_thidvar0), thread2Thread1of1ForFork2_thidvar1, old(thread2Thread1of1ForFork2_thidvar1), thread2Thread1of1ForFork2_thidvar2, old(thread2Thread1of1ForFork2_thidvar2), thread1_#res#1.offset, thread2_#res#1.offset, thread3_#res#1.offset, thread4_#res#1.offset, thread3Thread1of1ForFork3_#in~_argptr#1.offset, thread1Thread1of1ForFork0_~_argptr#1.base, ULTIMATE.start_main_~#t2~0#1.offset, #Ultimate.allocOnStack_~size, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post2#1, read~int_#sizeOfReadType, write~init~int_#sizeOfWrittenType, thread2Thread1of1ForFork2_~_argptr#1.offset, thread3Thread1of1ForFork3_#in~_argptr#1.base, ~e1~0, old(~e1~0), ~e2~0, old(~e2~0), ~e3~0, old(~e3~0), ~e4~0, old(~e4~0), ~i1~0, old(~i1~0), ~i2~0, old(~i2~0), ~i3~0, old(~i3~0), ~i4~0, old(~i4~0), ULTIMATE.start_main_~#t1~0#1.offset, ~n1~0, old(~n1~0), ~n2~0, old(~n2~0), ~n3~0, old(~n3~0), ~n4~0, old(~n4~0), thread1_#t~post1#1, thread2_#t~post2#1, thread3_#t~post3#1, thread4_#t~post4#1, ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_main_#t~pre22#1, ULTIMATE.start_main_#t~pre24#1, #Ultimate.allocOnStack_#res.offset, thread2Thread1of1ForFork2_#in~_argptr#1.offset, ULTIMATE.dealloc_~addr.offset, thread1_~_argptr#1.offset, thread2_~_argptr#1.offset, thread3_~_argptr#1.offset, thread4_~_argptr#1.offset, write~int_#value, write~init~int_#ptr.offset, ULTIMATE.dealloc_~addr.base, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #pthreadsForks, old(#pthreadsForks), thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1_#in~_argptr#1.offset, thread2_#in~_argptr#1.offset, thread3_#in~_argptr#1.offset, thread4_#in~_argptr#1.offset, thread1Thread1of1ForFork0_~_argptr#1.offset, ~i~0, old(~i~0), thread2Thread1of1ForFork2_#in~_argptr#1.base, #valid, old(#valid), thread4Thread1of1ForFork1_#res#1.base, read~int_#value, #Ultimate.allocInit_~size, thread1_assume_abort_if_not_~cond#1, thread2_assume_abort_if_not_~cond#1, thread3_assume_abort_if_not_~cond#1, thread4_assume_abort_if_not_~cond#1, write~init~int_#ptr.base, thread1Thread1of1ForFork0_#in~_argptr#1.offset, thread1_#in~_argptr#1.base, thread2_#in~_argptr#1.base, thread3_#in~_argptr#1.base, thread4_#in~_argptr#1.base, thread4Thread1of1ForFork1_~_argptr#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, #Ultimate.allocInit_ptrBase, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet19#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_main_#t~nondet25#1, thread4Thread1of1ForFork1_#res#1.offset, ULTIMATE.start_main_~#t1~0#1.base, #length, old(#length), thread1Thread1of1ForFork0_#in~_argptr#1.base, ULTIMATE.start_main_~#t2~0#1.base, write~int_#sizeOfWrittenType, thread3Thread1of1ForFork3_#res#1.base, ULTIMATE.start_main_~#t3~0#1.base, #StackHeapBarrier, old(#StackHeapBarrier), thread1_assume_abort_if_not_#in~cond#1, thread2_assume_abort_if_not_#in~cond#1, thread3_assume_abort_if_not_#in~cond#1, thread4_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_~#t4~0#1.base, thread3Thread1of1ForFork3_~_argptr#1.base, thread1Thread1of1ForFork0_thidvar0, old(thread1Thread1of1ForFork0_thidvar0), thread1Thread1of1ForFork0_thidvar1, old(thread1Thread1of1ForFork0_thidvar1), write~int_#ptr.offset, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, old(#memory_int), thread3Thread1of1ForFork3_#res#1.offset, thread4Thread1of1ForFork1_#t~post4#1, #Ultimate.allocOnStack_#res.base, thread4Thread1of1ForFork1_thidvar0, old(thread4Thread1of1ForFork1_thidvar0), thread4Thread1of1ForFork1_thidvar1, old(thread4Thread1of1ForFork1_thidvar1), thread4Thread1of1ForFork1_thidvar2, old(thread4Thread1of1ForFork1_thidvar2), thread4Thread1of1ForFork1_thidvar3, old(thread4Thread1of1ForFork1_thidvar3), thread4Thread1of1ForFork1_thidvar4, old(thread4Thread1of1ForFork1_thidvar4), thread3Thread1of1ForFork3_thidvar0, old(thread3Thread1of1ForFork3_thidvar0), thread3Thread1of1ForFork3_thidvar1, old(thread3Thread1of1ForFork3_thidvar1), thread3Thread1of1ForFork3_thidvar2, old(thread3Thread1of1ForFork3_thidvar2), thread3Thread1of1ForFork3_thidvar3, old(thread3Thread1of1ForFork3_thidvar3), thread4Thread1of1ForFork1_~_argptr#1.offset, thread2Thread1of1ForFork2_#res#1.base, read~int_#ptr.offset], Protected Variables before encountering a loop: [~i1~0, ~i2~0, ~i3~0, ~i4~0, ~n1~0, ~n2~0, ~n3~0, ~n4~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~i~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] - TimeoutResultAtElement [Line: 280]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing DynamicStratifiedReduction. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 9 procedures, 294 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 894.1s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 6, EmptinessCheckTime: 887.4s, 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: 58, 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.6s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1360 NumberOfCodeBlocks, 1360 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1353 ConstructedInterpolants, 0 QuantifiedInterpolants, 2397 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown