/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/test-easy1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-e23131f-m [2024-05-03 05:34:59,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-03 05:34:59,197 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-03 05:34:59,200 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-03 05:34:59,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-03 05:34:59,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-03 05:34:59,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-03 05:34:59,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-03 05:34:59,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-03 05:34:59,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-03 05:34:59,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-03 05:34:59,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-03 05:34:59,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-03 05:34:59,216 INFO L153 SettingsManager]: * Use SBE=true [2024-05-03 05:34:59,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-03 05:34:59,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-03 05:34:59,216 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-03 05:34:59,217 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-03 05:34:59,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-03 05:34:59,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-03 05:34:59,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-03 05:34:59,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-03 05:34:59,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-03 05:34:59,229 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-03 05:34:59,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-03 05:34:59,229 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-03 05:34:59,229 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-03 05:34:59,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-03 05:34:59,230 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-03 05:34:59,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-03 05:34:59,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 05:34:59,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-03 05:34:59,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-03 05:34:59,231 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-03 05:34:59,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-03 05:34:59,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-03 05:34:59,231 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-03 05:34:59,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-03 05:34:59,232 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-03 05:34:59,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-03 05:34:59,232 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-03 05:34:59,232 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-05-03 05:34:59,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-03 05:34:59,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-03 05:34:59,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-03 05:34:59,438 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-03 05:34:59,439 INFO L274 PluginConnector]: CDTParser initialized [2024-05-03 05:34:59,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/test-easy1.wvr.c [2024-05-03 05:35:00,448 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-03 05:35:00,633 INFO L384 CDTParser]: Found 1 translation units. [2024-05-03 05:35:00,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy1.wvr.c [2024-05-03 05:35:00,639 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/86dc0997c/ef6c924b252a437aa49cb3186a79d375/FLAG9d5e9765d [2024-05-03 05:35:00,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/86dc0997c/ef6c924b252a437aa49cb3186a79d375 [2024-05-03 05:35:00,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-03 05:35:00,670 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-03 05:35:00,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-03 05:35:00,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-03 05:35:00,676 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-03 05:35:00,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 05:35:00" (1/1) ... [2024-05-03 05:35:00,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a5e633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:35:00, skipping insertion in model container [2024-05-03 05:35:00,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 05:35:00" (1/1) ... [2024-05-03 05:35:00,696 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-03 05:35:00,816 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/test-easy1.wvr.c[1876,1889] [2024-05-03 05:35:00,820 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 05:35:00,827 INFO L202 MainTranslator]: Completed pre-run [2024-05-03 05:35:00,840 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/test-easy1.wvr.c[1876,1889] [2024-05-03 05:35:00,841 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 05:35:00,852 INFO L206 MainTranslator]: Completed translation [2024-05-03 05:35:00,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:35:00 WrapperNode [2024-05-03 05:35:00,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-03 05:35:00,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-03 05:35:00,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-03 05:35:00,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-03 05:35:00,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:35:00" (1/1) ... [2024-05-03 05:35:00,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:35:00" (1/1) ... [2024-05-03 05:35:00,879 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2024-05-03 05:35:00,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-03 05:35:00,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-03 05:35:00,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-03 05:35:00,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-03 05:35:00,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:35:00" (1/1) ... [2024-05-03 05:35:00,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:35:00" (1/1) ... [2024-05-03 05:35:00,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:35:00" (1/1) ... [2024-05-03 05:35:00,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:35:00" (1/1) ... [2024-05-03 05:35:00,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:35:00" (1/1) ... [2024-05-03 05:35:00,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:35:00" (1/1) ... [2024-05-03 05:35:00,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:35:00" (1/1) ... [2024-05-03 05:35:00,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:35:00" (1/1) ... [2024-05-03 05:35:00,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-03 05:35:00,901 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-03 05:35:00,901 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-03 05:35:00,901 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-03 05:35:00,902 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:35:00" (1/1) ... [2024-05-03 05:35:00,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 05:35:00,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:35:00,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-03 05:35:00,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-03 05:35:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-03 05:35:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-03 05:35:00,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-03 05:35:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-03 05:35:00,991 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-03 05:35:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-03 05:35:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-03 05:35:00,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-03 05:35:00,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-03 05:35:00,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-03 05:35:00,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-03 05:35:00,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-03 05:35:00,993 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-03 05:35:01,056 INFO L241 CfgBuilder]: Building ICFG [2024-05-03 05:35:01,058 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-03 05:35:01,312 INFO L282 CfgBuilder]: Performing block encoding [2024-05-03 05:35:01,319 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-03 05:35:01,319 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-03 05:35:01,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 05:35:01 BoogieIcfgContainer [2024-05-03 05:35:01,319 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-03 05:35:01,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-03 05:35:01,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-03 05:35:01,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-03 05:35:01,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 05:35:00" (1/3) ... [2024-05-03 05:35:01,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d9f278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 05:35:01, skipping insertion in model container [2024-05-03 05:35:01,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 05:35:00" (2/3) ... [2024-05-03 05:35:01,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d9f278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 05:35:01, skipping insertion in model container [2024-05-03 05:35:01,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 05:35:01" (3/3) ... [2024-05-03 05:35:01,332 INFO L112 eAbstractionObserver]: Analyzing ICFG test-easy1.wvr.c [2024-05-03 05:35:01,339 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-03 05:35:01,346 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-03 05:35:01,347 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-03 05:35:01,348 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-03 05:35:01,390 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-03 05:35:01,434 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 05:35:01,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 05:35:01,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:35:01,435 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-03 05:35:01,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-03 05:35:01,508 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 05:35:01,515 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 05:35:01,522 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;@6e645fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 05:35:01,522 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 05:35:01,529 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:35:01,589 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:01,589 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:01,590 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:35:01,606 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:01,606 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:01,606 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:35:01,613 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:01,613 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:01,614 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:35:01,618 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 119 states. [2024-05-03 05:35:01,619 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:35:01,621 INFO L78 Accepts]: Start accepts. Automaton has currently 124 states, but on-demand construction may add more states Word has length 59 [2024-05-03 05:35:01,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:35:01,624 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:35:01,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:35:01,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1096007971, now seen corresponding path program 1 times [2024-05-03 05:35:01,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:35:01,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510395556] [2024-05-03 05:35:01,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:35:01,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:35:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:35:01,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:35:01,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:35:01,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510395556] [2024-05-03 05:35:01,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510395556] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 05:35:01,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 05:35:01,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 05:35:01,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102185679] [2024-05-03 05:35:01,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 05:35:01,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 05:35:01,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:35:01,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 05:35:01,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 05:35:01,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:35:01,838 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:35:01,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:35:01,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:35:01,839 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:35:01,867 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:01,867 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:01,867 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:35:01,872 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:01,873 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:01,873 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:35:01,878 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:01,878 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:01,878 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:35:01,887 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 144 states. [2024-05-03 05:35:01,887 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:35:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:35:01,896 INFO L78 Accepts]: Start accepts. Automaton has currently 149 states, but on-demand construction may add more states Word has length 57 [2024-05-03 05:35:01,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:35:01,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-03 05:35:01,898 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:35:01,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:35:01,899 INFO L85 PathProgramCache]: Analyzing trace with hash -768861252, now seen corresponding path program 1 times [2024-05-03 05:35:01,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:35:01,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549797295] [2024-05-03 05:35:01,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:35:01,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:35:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:35:02,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:35:02,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:35:02,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549797295] [2024-05-03 05:35:02,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549797295] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 05:35:02,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 05:35:02,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-03 05:35:02,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213394014] [2024-05-03 05:35:02,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 05:35:02,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-03 05:35:02,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:35:02,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-03 05:35:02,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-03 05:35:02,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:35:02,243 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:35:02,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:35:02,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:35:02,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:35:02,244 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:35:02,349 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:02,349 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:02,350 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:35:02,360 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:02,361 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:02,361 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:35:02,385 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 150 states. [2024-05-03 05:35:02,385 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:35:02,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:35:02,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:35:02,386 INFO L78 Accepts]: Start accepts. Automaton has currently 155 states, but on-demand construction may add more states Word has length 61 [2024-05-03 05:35:02,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:35:02,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-03 05:35:02,387 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:35:02,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:35:02,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2025176479, now seen corresponding path program 1 times [2024-05-03 05:35:02,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:35:02,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124118919] [2024-05-03 05:35:02,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:35:02,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:35:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:35:02,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:35:02,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:35:02,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124118919] [2024-05-03 05:35:02,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124118919] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:35:02,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617570800] [2024-05-03 05:35:02,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:35:02,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:35:02,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:35:02,713 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:35:02,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-03 05:35:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:35:02,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2024-05-03 05:35:02,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:35:02,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:35:02,957 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:35:03,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:35:03,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617570800] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-03 05:35:03,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-03 05:35:03,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 14 [2024-05-03 05:35:03,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945661788] [2024-05-03 05:35:03,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 05:35:03,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-03 05:35:03,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:35:03,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-03 05:35:03,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-05-03 05:35:03,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:35:03,065 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:35:03,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:35:03,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:35:03,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:35:03,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:35:03,065 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:35:03,107 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:03,107 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:03,107 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:35:03,113 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:03,113 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 05:35:03,113 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 05:35:03,124 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 156 states. [2024-05-03 05:35:03,125 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:35:03,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:35:03,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:35:03,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:35:03,125 INFO L78 Accepts]: Start accepts. Automaton has currently 163 states, but on-demand construction may add more states Word has length 65 [2024-05-03 05:35:03,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:35:03,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-03 05:35:03,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-05-03 05:35:03,333 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:35:03,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:35:03,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1392484678, now seen corresponding path program 1 times [2024-05-03 05:35:03,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:35:03,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144317705] [2024-05-03 05:35:03,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:35:03,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:35:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:35:03,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:35:03,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:35:03,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144317705] [2024-05-03 05:35:03,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144317705] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 05:35:03,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194635594] [2024-05-03 05:35:03,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:35:03,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:35:03,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:35:03,474 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 05:35:03,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-03 05:35:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:35:03,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-03 05:35:03,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 05:35:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:35:03,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 05:35:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:35:03,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194635594] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 05:35:03,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 05:35:03,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 24 [2024-05-03 05:35:03,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215578721] [2024-05-03 05:35:03,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 05:35:03,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-05-03 05:35:03,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:35:03,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-05-03 05:35:03,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2024-05-03 05:35:03,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:35:03,927 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:35:03,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.75) internal successors, (138), 24 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:35:03,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:35:03,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:35:03,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:35:03,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:35:03,928 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:35:04,251 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:04,251 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:04,252 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 05:35:04,257 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:04,257 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 05:35:04,257 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 05:35:04,264 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:04,264 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 05:35:04,264 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2024-05-03 05:35:04,386 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:04,386 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:04,386 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,387 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:04,387 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,387 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,392 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:04,392 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,392 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,395 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:04,395 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,395 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,415 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:04,416 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,416 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,418 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:04,418 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,418 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,422 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:04,422 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,423 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,429 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:04,429 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,430 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,431 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:04,431 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,431 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,431 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:04,431 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:04,432 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,433 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:04,433 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,433 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,435 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:04,435 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,435 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,436 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:04,436 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,436 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,704 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:04,705 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,705 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,793 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:04,793 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,793 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:04,839 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 369 states. [2024-05-03 05:35:04,839 INFO L212 cStratifiedReduction]: Copied states 41 times. [2024-05-03 05:35:04,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:35:04,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:35:04,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:35:04,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:35:04,841 INFO L78 Accepts]: Start accepts. Automaton has currently 359 states, but on-demand construction may add more states Word has length 61 [2024-05-03 05:35:04,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 05:35:04,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-03 05:35:05,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 05:35:05,046 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 05:35:05,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 05:35:05,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1011832097, now seen corresponding path program 1 times [2024-05-03 05:35:05,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 05:35:05,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863190624] [2024-05-03 05:35:05,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 05:35:05,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 05:35:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 05:35:05,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 05:35:05,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 05:35:05,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863190624] [2024-05-03 05:35:05,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863190624] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 05:35:05,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 05:35:05,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-03 05:35:05,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680795510] [2024-05-03 05:35:05,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 05:35:05,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-03 05:35:05,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 05:35:05,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-03 05:35:05,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-05-03 05:35:05,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:35:05,136 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 05:35:05,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 05:35:05,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:35:05,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:35:05,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:35:05,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-03 05:35:05,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:35:05,137 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:35:05,176 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,177 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:05,177 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,179 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,179 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,179 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,180 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,180 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,180 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,191 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,191 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:05,191 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,192 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,192 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,192 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,194 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,194 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,194 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,196 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,196 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,196 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,198 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,198 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,198 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,199 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,199 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,200 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,202 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,203 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,203 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,205 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,206 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,206 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,207 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,207 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,207 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,207 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,207 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:05,207 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,208 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,208 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,208 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,219 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,219 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,219 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,222 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,222 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,222 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,287 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,287 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,287 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,290 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,290 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,290 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,296 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,301 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,302 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,305 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,305 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,305 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,310 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,310 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,310 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,315 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,315 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,315 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,318 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,318 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,318 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,318 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,318 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,318 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,336 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,336 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,336 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,343 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,343 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,343 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,357 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,357 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,357 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,359 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,359 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,359 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,362 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,362 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,363 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,364 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,365 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,365 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,368 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,368 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,368 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,371 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,371 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,372 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,373 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,374 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,374 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,374 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,374 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,374 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,384 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,385 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,385 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,389 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,389 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,389 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,401 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,401 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,401 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,403 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,404 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,404 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,407 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,407 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,407 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,409 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,409 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,409 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,412 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,412 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,412 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,416 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,416 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,417 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,418 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,419 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,419 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,419 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,419 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,419 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,430 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,430 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,430 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,435 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,435 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,435 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,482 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,482 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,482 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,514 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,514 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,514 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,520 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,520 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,520 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,525 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,525 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,526 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,530 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,530 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,530 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,534 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,534 INFO L369 cStratifiedReduction]: Guessed abstraction level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,534 INFO L370 cStratifiedReduction]: Actual level: [~x1~0, ~x2~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork0_#t~post1] [2024-05-03 05:35:05,536 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 965 states. [2024-05-03 05:35:05,536 INFO L212 cStratifiedReduction]: Copied states 27 times. [2024-05-03 05:35:05,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 05:35:05,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-03 05:35:05,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:35:05,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-03 05:35:05,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-03 05:35:05,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 05:35:05,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-03 05:35:05,544 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-05-03 05:35:05,545 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/3) [2024-05-03 05:35:05,547 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 05:35:05,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 05:35:05,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:35:05,573 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-03 05:35:05,579 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 05:35:05,579 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-03 05:35:05,579 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;@6e645fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 05:35:05,579 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 05:35:05,580 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:35:05,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-05-03 05:35:05,581 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 30 states. [2024-05-03 05:35:05,582 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:35:05,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-03 05:35:05,582 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-05-03 05:35:05,583 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/3) [2024-05-03 05:35:05,584 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 05:35:05,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 05:35:05,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 05:35:05,624 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-03 05:35:05,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-05-03 05:35:05,627 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 05:35:05,627 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-03 05:35:05,627 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;@6e645fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 05:35:05,627 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 05:35:05,628 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 05:35:05,639 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,639 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:05,639 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:35:05,642 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,642 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:05,642 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:35:05,644 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,644 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:05,644 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:35:05,645 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,646 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:05,646 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:35:05,647 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,647 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:05,647 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:35:05,648 INFO L368 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-03 05:35:05,648 INFO L369 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-03 05:35:05,648 INFO L370 cStratifiedReduction]: Actual level: [] [2024-05-03 05:35:05,648 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 72 states. [2024-05-03 05:35:05,648 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 05:35:05,649 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-03 05:35:05,649 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-05-03 05:35:05,649 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (3/3) [2024-05-03 05:35:05,650 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-03 05:35:05,650 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-03 05:35:05,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 05:35:05 BasicIcfg [2024-05-03 05:35:05,653 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-03 05:35:05,653 INFO L158 Benchmark]: Toolchain (without parser) took 4982.88ms. Allocated memory was 209.7MB in the beginning and 266.3MB in the end (delta: 56.6MB). Free memory was 138.4MB in the beginning and 199.9MB in the end (delta: -61.5MB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-03 05:35:05,653 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 209.7MB. Free memory is still 176.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-03 05:35:05,653 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.93ms. Allocated memory is still 209.7MB. Free memory was 138.2MB in the beginning and 127.0MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-03 05:35:05,654 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.54ms. Allocated memory is still 209.7MB. Free memory was 126.8MB in the beginning and 125.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-03 05:35:05,654 INFO L158 Benchmark]: Boogie Preprocessor took 20.86ms. Allocated memory is still 209.7MB. Free memory was 125.3MB in the beginning and 124.0MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-03 05:35:05,654 INFO L158 Benchmark]: RCFGBuilder took 418.59ms. Allocated memory is still 209.7MB. Free memory was 124.0MB in the beginning and 175.9MB in the end (delta: -51.9MB). Peak memory consumption was 17.7MB. Max. memory is 8.0GB. [2024-05-03 05:35:05,654 INFO L158 Benchmark]: TraceAbstraction took 4331.83ms. Allocated memory was 209.7MB in the beginning and 266.3MB in the end (delta: 56.6MB). Free memory was 174.9MB in the beginning and 199.9MB in the end (delta: -25.0MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. [2024-05-03 05:35:05,655 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 209.7MB. Free memory is still 176.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.93ms. Allocated memory is still 209.7MB. Free memory was 138.2MB in the beginning and 127.0MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.54ms. Allocated memory is still 209.7MB. Free memory was 126.8MB in the beginning and 125.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.86ms. Allocated memory is still 209.7MB. Free memory was 125.3MB in the beginning and 124.0MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 418.59ms. Allocated memory is still 209.7MB. Free memory was 124.0MB in the beginning and 175.9MB in the end (delta: -51.9MB). Peak memory consumption was 17.7MB. Max. memory is 8.0GB. * TraceAbstraction took 4331.83ms. Allocated memory was 209.7MB in the beginning and 266.3MB in the end (delta: 56.6MB). Free memory was 174.9MB in the beginning and 199.9MB in the end (delta: -25.0MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1656, independent: 1507, independent conditional: 1507, independent unconditional: 0, dependent: 149, dependent conditional: 149, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1507, independent: 1507, independent conditional: 1507, 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: 1507, independent: 1507, independent conditional: 1507, 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: 1507, independent: 1507, independent conditional: 0, independent unconditional: 1507, 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: 1507, independent: 1507, independent conditional: 0, independent unconditional: 1507, 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: 1507, independent: 1507, independent conditional: 0, independent unconditional: 1507, 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: 1507, independent: 1507, independent conditional: 0, independent unconditional: 1507, 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: 1507, independent: 1507, independent conditional: 0, independent unconditional: 1507, 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: 1507, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1507, unknown conditional: 0, unknown unconditional: 1507] , Statistics on independence cache: Total cache size (in pairs): 1507, Positive cache size: 1507, Positive conditional cache size: 0, Positive unconditional cache size: 1507, 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: 149 - StatisticsResult: Reduction benchmarks 17.3ms Time before loop, 71.8ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 5, Reduction States: 119, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 23.0ms Time before loop, 24.4ms Time in loop, 0.0s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 5, Reduction States: 144, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 88.4ms Time before loop, 52.1ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 4, Reduction States: 150, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 30.9ms Time before loop, 28.1ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 4, Reduction States: 156, Duplicate States: 0, Protected Variables: 4 - StatisticsResult: Reduction benchmarks 308.6ms Time before loop, 602.2ms Time in loop, 0.9s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 19, Reduction States: 369, Duplicate States: 41, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 34.0ms Time before loop, 365.0ms Time in loop, 0.4s Time in total, Has Loop: 1, wrong guesses: 3, overall guesses: 52, Reduction States: 965, Duplicate States: 27, Protected Variables: 6 - StatisticsResult: Visitor Statistics States: 84, Transitions: 91, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 84, Transitions: 93, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 81, Transitions: 88, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 84, Transitions: 95, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 277, Transitions: 420, Traversal time: 0.9s - StatisticsResult: Visitor Statistics States: 813, Transitions: 1236, Traversal time: 0.4s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 5, RedundantProofs: 1, ProvenStates: 451, Times there's more than one choice: 333, Avg number of choices: 3.41019955654102 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.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] , 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: 0 - StatisticsResult: Reduction benchmarks 1.5ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 30, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 31, Transitions: 31, 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: 36, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 0, independent unconditional: 30, 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: 30, independent: 30, independent conditional: 0, independent unconditional: 30, 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: 30, independent: 30, independent conditional: 0, independent unconditional: 30, 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: 30, independent: 30, independent conditional: 0, independent unconditional: 30, 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: 30, independent: 30, independent conditional: 0, independent unconditional: 30, 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: 30, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 30, unknown conditional: 0, unknown unconditional: 30] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, 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: 6 - StatisticsResult: Reduction benchmarks 1.5ms Time before loop, 19.2ms Time in loop, 0.0s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 6, Reduction States: 72, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 73, Transitions: 85, 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: 70]: 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, 93 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.7s, 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: 73, 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.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 546 ConstructedInterpolants, 0 QuantifiedInterpolants, 1798 SizeOfPredicates, 16 NumberOfNonLiveVariables, 286 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 3/10 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, 93 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, 93 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-03 05:35:05,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2024-05-03 05:35:05,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Ended with exit code 0 [2024-05-03 05:35:06,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-03 05:35:06,278 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...