/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 -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 00:47:26,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 00:47:26,720 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 00:47:26,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 00:47:26,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 00:47:26,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 00:47:26,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 00:47:26,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 00:47:26,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 00:47:26,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 00:47:26,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 00:47:26,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 00:47:26,753 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 00:47:26,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 00:47:26,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 00:47:26,754 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 00:47:26,755 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 00:47:26,755 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 00:47:26,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 00:47:26,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 00:47:26,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 00:47:26,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 00:47:26,756 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 00:47:26,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 00:47:26,756 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 00:47:26,756 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 00:47:26,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 00:47:26,756 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 00:47:26,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 00:47:26,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 00:47:26,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 00:47:26,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 00:47:26,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 00:47:26,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 00:47:26,758 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 00:47:26,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 00:47:26,759 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 00:47:26,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 00:47:26,759 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 00:47:26,759 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: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT [2024-05-06 00:47:26,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 00:47:26,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 00:47:26,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 00:47:26,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 00:47:26,996 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 00:47:26,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.i [2024-05-06 00:47:28,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 00:47:28,367 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 00:47:28,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_tso.i [2024-05-06 00:47:28,385 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8012e0454/e14d785276f3489782a45eca02a116dd/FLAG9177faa77 [2024-05-06 00:47:28,397 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8012e0454/e14d785276f3489782a45eca02a116dd [2024-05-06 00:47:28,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 00:47:28,399 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 00:47:28,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 00:47:28,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 00:47:28,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 00:47:28,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 12:47:28" (1/1) ... [2024-05-06 00:47:28,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76557ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:47:28, skipping insertion in model container [2024-05-06 00:47:28,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 12:47:28" (1/1) ... [2024-05-06 00:47:28,468 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 00:47:28,601 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_tso.i[944,957] [2024-05-06 00:47:28,792 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 00:47:28,803 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 00:47:28,814 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_tso.i[944,957] [2024-05-06 00:47:28,857 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 00:47:28,890 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 00:47:28,891 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 00:47:28,896 INFO L206 MainTranslator]: Completed translation [2024-05-06 00:47:28,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:47:28 WrapperNode [2024-05-06 00:47:28,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 00:47:28,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 00:47:28,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 00:47:28,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 00:47:28,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:47:28" (1/1) ... [2024-05-06 00:47:28,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:47:28" (1/1) ... [2024-05-06 00:47:28,958 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 169 [2024-05-06 00:47:28,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 00:47:28,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 00:47:28,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 00:47:28,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 00:47:28,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:47:28" (1/1) ... [2024-05-06 00:47:28,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:47:28" (1/1) ... [2024-05-06 00:47:28,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:47:28" (1/1) ... [2024-05-06 00:47:28,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:47:28" (1/1) ... [2024-05-06 00:47:28,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:47:28" (1/1) ... [2024-05-06 00:47:28,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:47:28" (1/1) ... [2024-05-06 00:47:28,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:47:28" (1/1) ... [2024-05-06 00:47:28,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:47:28" (1/1) ... [2024-05-06 00:47:28,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 00:47:28,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 00:47:28,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 00:47:28,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 00:47:28,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:47:28" (1/1) ... [2024-05-06 00:47:29,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 00:47:29,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 00:47:29,028 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-06 00:47:29,063 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-06 00:47:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 00:47:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 00:47:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 00:47:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 00:47:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 00:47:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 00:47:29,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 00:47:29,090 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 00:47:29,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 00:47:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 00:47:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 00:47:29,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 00:47:29,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 00:47:29,092 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 00:47:29,222 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 00:47:29,224 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 00:47:29,526 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 00:47:29,648 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 00:47:29,649 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 00:47:29,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 12:47:29 BoogieIcfgContainer [2024-05-06 00:47:29,650 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 00:47:29,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 00:47:29,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 00:47:29,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 00:47:29,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 12:47:28" (1/3) ... [2024-05-06 00:47:29,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab4e3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 12:47:29, skipping insertion in model container [2024-05-06 00:47:29,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:47:28" (2/3) ... [2024-05-06 00:47:29,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab4e3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 12:47:29, skipping insertion in model container [2024-05-06 00:47:29,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 12:47:29" (3/3) ... [2024-05-06 00:47:29,657 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_tso.i [2024-05-06 00:47:29,663 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 00:47:29,670 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 00:47:29,672 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 00:47:29,672 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 00:47:29,710 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 00:47:29,748 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 00:47:29,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 00:47:29,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 00:47:29,750 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-06 00:47:29,772 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-06 00:47:29,784 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 00:47:29,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 00:47:29,794 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 00:47:29,805 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=LoopHeads, 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;@43b9ac64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 00:47:29,805 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-06 00:47:29,832 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-06 00:47:29,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 00:47:29,833 INFO L85 PathProgramCache]: Analyzing trace with hash -436960994, now seen corresponding path program 1 times [2024-05-06 00:47:29,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 00:47:29,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158488661] [2024-05-06 00:47:29,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:29,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 00:47:30,331 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-06 00:47:30,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 00:47:30,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158488661] [2024-05-06 00:47:30,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158488661] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 00:47:30,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 00:47:30,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 00:47:30,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598168953] [2024-05-06 00:47:30,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 00:47:30,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-06 00:47:30,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 00:47:30,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 00:47:30,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-06 00:47:30,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 00:47:30,361 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 00:47:30,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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-06 00:47:30,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 00:47:30,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 00:47:30,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 00:47:30,442 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-06 00:47:30,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 00:47:30,443 INFO L85 PathProgramCache]: Analyzing trace with hash 363720988, now seen corresponding path program 1 times [2024-05-06 00:47:30,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 00:47:30,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17789802] [2024-05-06 00:47:30,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:30,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 00:47:32,085 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-06 00:47:32,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 00:47:32,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17789802] [2024-05-06 00:47:32,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17789802] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 00:47:32,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 00:47:32,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-05-06 00:47:32,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51143923] [2024-05-06 00:47:32,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 00:47:32,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-06 00:47:32,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 00:47:32,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-06 00:47:32,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-05-06 00:47:32,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 00:47:32,092 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 00:47:32,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 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-06 00:47:32,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 00:47:32,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 00:47:34,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1586602466, now seen corresponding path program 1 times [2024-05-06 00:47:34,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:34,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 00:47:34,914 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-06 00:47:34,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:34,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 00:47:35,074 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-06 00:47:35,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 00:47:35,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-06 00:47:35,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1574359366, now seen corresponding path program 1 times [2024-05-06 00:47:35,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:35,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:35,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:47:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:35,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 00:47:35,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 00:47:35,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-06 00:47:35,330 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-06 00:47:35,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 00:47:35,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1993555754, now seen corresponding path program 1 times [2024-05-06 00:47:35,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 00:47:35,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359284309] [2024-05-06 00:47:35,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:35,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 00:47:35,877 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-06 00:47:35,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 00:47:35,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359284309] [2024-05-06 00:47:35,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359284309] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 00:47:35,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 00:47:35,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 00:47:35,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377624441] [2024-05-06 00:47:35,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 00:47:35,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 00:47:35,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 00:47:35,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 00:47:35,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-06 00:47:35,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 00:47:35,879 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 00:47:35,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 00:47:35,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 00:47:35,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-06 00:47:35,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 00:47:35,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1574359366, now seen corresponding path program 2 times [2024-05-06 00:47:35,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:35,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:36,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:47:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:36,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1304929774, now seen corresponding path program 1 times [2024-05-06 00:47:36,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:36,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:36,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:47:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:36,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1621602087, now seen corresponding path program 1 times [2024-05-06 00:47:36,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:36,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:36,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:47:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:37,425 INFO L85 PathProgramCache]: Analyzing trace with hash 144874347, now seen corresponding path program 1 times [2024-05-06 00:47:37,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:37,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:37,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:47:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:41,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1785305548, now seen corresponding path program 1 times [2024-05-06 00:47:41,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:41,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:41,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:47:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:41,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1519347277, now seen corresponding path program 1 times [2024-05-06 00:47:41,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:41,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:41,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:47:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:44,786 INFO L85 PathProgramCache]: Analyzing trace with hash 196158996, now seen corresponding path program 1 times [2024-05-06 00:47:44,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:44,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:44,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:47:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:45,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1018842449, now seen corresponding path program 1 times [2024-05-06 00:47:45,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:45,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:45,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:47:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:48,505 INFO L85 PathProgramCache]: Analyzing trace with hash 144961552, now seen corresponding path program 1 times [2024-05-06 00:47:48,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:48,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:48,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:47:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:49,149 INFO L85 PathProgramCache]: Analyzing trace with hash -2111075846, now seen corresponding path program 1 times [2024-05-06 00:47:49,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:49,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:49,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:47:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:51,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1519312741, now seen corresponding path program 1 times [2024-05-06 00:47:51,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:51,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:51,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:47:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:52,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1730667129, now seen corresponding path program 1 times [2024-05-06 00:47:52,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:52,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:52,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:47:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:55,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1018755864, now seen corresponding path program 1 times [2024-05-06 00:47:55,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:55,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 00:47:55,987 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-06 00:47:55,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:55,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 00:47:56,317 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-06 00:47:56,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 00:47:56,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2024-05-06 00:47:56,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1574359366, now seen corresponding path program 3 times [2024-05-06 00:47:56,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:56,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:56,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:47:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:56,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1304929774, now seen corresponding path program 2 times [2024-05-06 00:47:56,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:56,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:56,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:47:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:56,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1621602087, now seen corresponding path program 2 times [2024-05-06 00:47:56,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:56,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:56,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:47:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:57,620 INFO L85 PathProgramCache]: Analyzing trace with hash 144874347, now seen corresponding path program 2 times [2024-05-06 00:47:57,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:47:57,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:47:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:47:57,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:47:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:00,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1519347277, now seen corresponding path program 2 times [2024-05-06 00:48:00,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:00,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:00,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:03,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1018842449, now seen corresponding path program 2 times [2024-05-06 00:48:03,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:03,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:03,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:05,679 INFO L85 PathProgramCache]: Analyzing trace with hash -2111075846, now seen corresponding path program 2 times [2024-05-06 00:48:05,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:05,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:05,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:08,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1730667129, now seen corresponding path program 2 times [2024-05-06 00:48:08,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:08,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:08,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:10,951 INFO L85 PathProgramCache]: Analyzing trace with hash 498361394, now seen corresponding path program 1 times [2024-05-06 00:48:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:10,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:10,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:13,898 INFO L85 PathProgramCache]: Analyzing trace with hash -399565786, now seen corresponding path program 1 times [2024-05-06 00:48:13,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:13,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:13,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:16,379 INFO L85 PathProgramCache]: Analyzing trace with hash 541300136, now seen corresponding path program 1 times [2024-05-06 00:48:16,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:16,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:16,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:20,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1185392607, now seen corresponding path program 1 times [2024-05-06 00:48:20,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:20,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:20,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:26,021 INFO L85 PathProgramCache]: Analyzing trace with hash 995973440, now seen corresponding path program 1 times [2024-05-06 00:48:26,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:26,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 00:48:26,123 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-06 00:48:26,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:26,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 00:48:26,169 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-06 00:48:26,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 00:48:26,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2024-05-06 00:48:26,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1574359366, now seen corresponding path program 4 times [2024-05-06 00:48:26,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:26,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:26,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:26,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1304929774, now seen corresponding path program 3 times [2024-05-06 00:48:26,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:26,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:26,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:26,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1621602087, now seen corresponding path program 3 times [2024-05-06 00:48:26,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:26,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:26,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:27,588 INFO L85 PathProgramCache]: Analyzing trace with hash 144874347, now seen corresponding path program 3 times [2024-05-06 00:48:27,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:27,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:27,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:30,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1519347277, now seen corresponding path program 3 times [2024-05-06 00:48:30,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:30,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:30,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:32,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1018842449, now seen corresponding path program 3 times [2024-05-06 00:48:32,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:32,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:32,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:35,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2111075846, now seen corresponding path program 3 times [2024-05-06 00:48:35,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:35,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:35,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:37,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1730667129, now seen corresponding path program 3 times [2024-05-06 00:48:37,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:37,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:37,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:40,811 INFO L85 PathProgramCache]: Analyzing trace with hash 498361394, now seen corresponding path program 2 times [2024-05-06 00:48:40,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:40,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:40,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:43,579 INFO L85 PathProgramCache]: Analyzing trace with hash -399565786, now seen corresponding path program 2 times [2024-05-06 00:48:43,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:43,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:43,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:46,241 INFO L85 PathProgramCache]: Analyzing trace with hash 541300136, now seen corresponding path program 2 times [2024-05-06 00:48:46,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:46,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:46,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:49,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1185392607, now seen corresponding path program 2 times [2024-05-06 00:48:49,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:49,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:49,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:57,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1562259135, now seen corresponding path program 1 times [2024-05-06 00:48:57,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:48:57,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:48:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:48:57,454 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:48:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:49:05,149 INFO L85 PathProgramCache]: Analyzing trace with hash 743132195, now seen corresponding path program 1 times [2024-05-06 00:49:05,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:49:05,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:49:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:49:05,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:49:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:49:13,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1777143290, now seen corresponding path program 1 times [2024-05-06 00:49:13,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:49:13,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:49:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:49:13,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:49:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:49:21,270 INFO L85 PathProgramCache]: Analyzing trace with hash 496862203, now seen corresponding path program 1 times [2024-05-06 00:49:21,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:49:21,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:49:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:49:21,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:49:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:49:28,497 INFO L85 PathProgramCache]: Analyzing trace with hash -399614146, now seen corresponding path program 1 times [2024-05-06 00:49:28,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:49:28,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:49:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:49:28,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:49:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:49:34,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1242223401, now seen corresponding path program 4 times [2024-05-06 00:49:34,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:49:34,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:49:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:49:34,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:49:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:49:35,081 INFO L85 PathProgramCache]: Analyzing trace with hash -145779858, now seen corresponding path program 4 times [2024-05-06 00:49:35,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:49:35,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:49:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:49:35,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:49:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:49:37,057 INFO L85 PathProgramCache]: Analyzing trace with hash 541298586, now seen corresponding path program 1 times [2024-05-06 00:49:37,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:49:37,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:49:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:49:37,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:49:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:49:45,056 INFO L85 PathProgramCache]: Analyzing trace with hash 987292596, now seen corresponding path program 1 times [2024-05-06 00:49:45,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:49:45,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:49:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:49:45,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:49:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:51:51,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1741246768, now seen corresponding path program 5 times [2024-05-06 00:51:51,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:51:51,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:51:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:51:51,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:51:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:51:51,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 00:51:51,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 00:51:51,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 00:51:51,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable54,SelfDestructingSolverStorable11,SelfDestructingSolverStorable55,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-06 00:51:51,997 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-06 00:51:51,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 00:51:51,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1761104384, now seen corresponding path program 2 times [2024-05-06 00:51:51,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 00:51:51,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801696685] [2024-05-06 00:51:51,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:51:51,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:51:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 00:51:53,082 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-06 00:51:53,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 00:51:53,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801696685] [2024-05-06 00:51:53,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801696685] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 00:51:53,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 00:51:53,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-05-06 00:51:53,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329404982] [2024-05-06 00:51:53,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 00:51:53,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-05-06 00:51:53,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 00:51:53,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-05-06 00:51:53,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-05-06 00:51:53,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 00:51:53,084 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 00:51:53,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 00:51:53,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 00:51:53,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-06 00:51:53,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 00:51:53,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 00:51:53,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1574359366, now seen corresponding path program 6 times [2024-05-06 00:51:53,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:51:53,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:51:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:51:53,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:51:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:51:53,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1304929774, now seen corresponding path program 5 times [2024-05-06 00:51:53,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:51:53,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:51:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:51:53,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:51:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:51:53,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1621602087, now seen corresponding path program 5 times [2024-05-06 00:51:53,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:51:53,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:51:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:51:53,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:51:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:51:54,643 INFO L85 PathProgramCache]: Analyzing trace with hash 144874347, now seen corresponding path program 4 times [2024-05-06 00:51:54,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:51:54,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:51:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:51:54,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:51:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:51:57,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1519347277, now seen corresponding path program 4 times [2024-05-06 00:51:57,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:51:57,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:51:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:51:57,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:51:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:52:00,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1018842449, now seen corresponding path program 4 times [2024-05-06 00:52:00,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:52:00,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:52:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:52:00,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:52:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:52:02,547 INFO L85 PathProgramCache]: Analyzing trace with hash -2111075846, now seen corresponding path program 4 times [2024-05-06 00:52:02,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:52:02,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:52:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:52:02,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:52:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:52:05,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1730667129, now seen corresponding path program 4 times [2024-05-06 00:52:05,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:52:05,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:52:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:52:05,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:52:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:52:07,731 INFO L85 PathProgramCache]: Analyzing trace with hash 498361394, now seen corresponding path program 3 times [2024-05-06 00:52:07,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:52:07,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:52:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:52:07,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:52:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:52:10,736 INFO L85 PathProgramCache]: Analyzing trace with hash -399565786, now seen corresponding path program 3 times [2024-05-06 00:52:10,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:52:10,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:52:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:52:10,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:52:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:52:13,907 INFO L85 PathProgramCache]: Analyzing trace with hash 541300136, now seen corresponding path program 3 times [2024-05-06 00:52:13,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:52:13,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:52:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:52:13,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:52:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:53:03,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1242223401, now seen corresponding path program 6 times [2024-05-06 00:53:03,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:53:03,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:53:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:53:03,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:53:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:53:03,468 INFO L85 PathProgramCache]: Analyzing trace with hash -145779858, now seen corresponding path program 6 times [2024-05-06 00:53:03,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:53:03,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:53:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:53:03,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:53:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:54:01,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1680397417, now seen corresponding path program 7 times [2024-05-06 00:54:01,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:54:01,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:54:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:54:01,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:54:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:54:01,428 INFO L85 PathProgramCache]: Analyzing trace with hash 552712750, now seen corresponding path program 7 times [2024-05-06 00:54:01,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:54:01,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:54:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:54:01,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:54:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:54:01,704 INFO L85 PathProgramCache]: Analyzing trace with hash -45773558, now seen corresponding path program 7 times [2024-05-06 00:54:01,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:54:01,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:54:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:54:01,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:54:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:55:15,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1741246768, now seen corresponding path program 8 times [2024-05-06 00:55:15,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:55:15,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:55:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:55:15,416 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:55:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:55:15,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1329304046, now seen corresponding path program 8 times [2024-05-06 00:55:15,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:55:15,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:55:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:55:15,759 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:55:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:55:16,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1151259409, now seen corresponding path program 8 times [2024-05-06 00:55:16,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:55:16,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:55:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:55:16,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:55:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:55:17,347 INFO L85 PathProgramCache]: Analyzing trace with hash 949901059, now seen corresponding path program 9 times [2024-05-06 00:55:17,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:55:17,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:55:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:55:17,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:55:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:55:17,697 INFO L85 PathProgramCache]: Analyzing trace with hash -617837868, now seen corresponding path program 9 times [2024-05-06 00:55:17,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 00:55:17,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 00:55:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:55:17,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 00:55:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 00:55:43,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 00:55:43,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-06 00:55:43,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 00:55:43,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 00:55:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-05-06 00:55:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-05-06 00:55:43,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-05-06 00:55:43,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-06 00:55:43,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-05-06 00:55:43,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable60,SelfDestructingSolverStorable71,SelfDestructingSolverStorable61,SelfDestructingSolverStorable72,SelfDestructingSolverStorable62,SelfDestructingSolverStorable73,SelfDestructingSolverStorable63,SelfDestructingSolverStorable74,SelfDestructingSolverStorable64,SelfDestructingSolverStorable75,SelfDestructingSolverStorable65,SelfDestructingSolverStorable76,SelfDestructingSolverStorable66,SelfDestructingSolverStorable77,SelfDestructingSolverStorable56,SelfDestructingSolverStorable67,SelfDestructingSolverStorable57,SelfDestructingSolverStorable68,SelfDestructingSolverStorable58,SelfDestructingSolverStorable69,SelfDestructingSolverStorable59 [2024-05-06 00:55:43,505 INFO L448 BasicCegarLoop]: Path program histogram: [9, 9, 8, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-06 00:55:43,508 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 00:55:43,509 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 00:55:43,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 12:55:43 BasicIcfg [2024-05-06 00:55:43,512 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 00:55:43,514 INFO L158 Benchmark]: Toolchain (without parser) took 495112.91ms. Allocated memory was 235.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 166.1MB in the beginning and 816.8MB in the end (delta: -650.7MB). Peak memory consumption was 360.6MB. Max. memory is 8.0GB. [2024-05-06 00:55:43,515 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 165.7MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 00:55:43,515 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.36ms. Allocated memory is still 235.9MB. Free memory was 165.6MB in the beginning and 140.3MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2024-05-06 00:55:43,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.07ms. Allocated memory is still 235.9MB. Free memory was 140.3MB in the beginning and 137.3MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-06 00:55:43,515 INFO L158 Benchmark]: Boogie Preprocessor took 29.46ms. Allocated memory is still 235.9MB. Free memory was 137.3MB in the beginning and 135.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 00:55:43,517 INFO L158 Benchmark]: RCFGBuilder took 662.09ms. Allocated memory is still 235.9MB. Free memory was 134.7MB in the beginning and 159.5MB in the end (delta: -24.8MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. [2024-05-06 00:55:43,517 INFO L158 Benchmark]: TraceAbstraction took 493859.15ms. Allocated memory was 235.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 158.4MB in the beginning and 816.8MB in the end (delta: -658.4MB). Peak memory consumption was 351.4MB. Max. memory is 8.0GB. [2024-05-06 00:55:43,518 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.09ms. Allocated memory is still 165.7MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 496.36ms. Allocated memory is still 235.9MB. Free memory was 165.6MB in the beginning and 140.3MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.07ms. Allocated memory is still 235.9MB. Free memory was 140.3MB in the beginning and 137.3MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.46ms. Allocated memory is still 235.9MB. Free memory was 137.3MB in the beginning and 135.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 662.09ms. Allocated memory is still 235.9MB. Free memory was 134.7MB in the beginning and 159.5MB in the end (delta: -24.8MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. * TraceAbstraction took 493859.15ms. Allocated memory was 235.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 158.4MB in the beginning and 816.8MB in the end (delta: -658.4MB). Peak memory consumption was 351.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13590, independent: 13054, independent conditional: 12986, independent unconditional: 68, dependent: 536, dependent conditional: 536, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13517, independent: 13054, independent conditional: 12986, independent unconditional: 68, dependent: 463, dependent conditional: 463, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13517, independent: 13054, independent conditional: 12986, independent unconditional: 68, dependent: 463, dependent conditional: 463, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13517, independent: 13054, independent conditional: 12986, independent unconditional: 68, dependent: 463, dependent conditional: 463, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15081, independent: 13054, independent conditional: 5982, independent unconditional: 7072, dependent: 2027, dependent conditional: 1537, dependent unconditional: 490, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15081, independent: 13054, independent conditional: 3784, independent unconditional: 9270, dependent: 2027, dependent conditional: 983, dependent unconditional: 1044, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15081, independent: 13054, independent conditional: 3784, independent unconditional: 9270, dependent: 2027, dependent conditional: 983, dependent unconditional: 1044, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 653, independent: 605, independent conditional: 136, independent unconditional: 469, dependent: 48, dependent conditional: 34, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 653, independent: 595, independent conditional: 0, independent unconditional: 595, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 58, independent: 10, independent conditional: 9, independent unconditional: 1, dependent: 48, dependent conditional: 34, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 58, independent: 10, independent conditional: 9, independent unconditional: 1, dependent: 48, dependent conditional: 34, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 284, independent: 39, independent conditional: 39, independent unconditional: 1, dependent: 244, dependent conditional: 183, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 15081, independent: 12449, independent conditional: 3648, independent unconditional: 8801, dependent: 1979, dependent conditional: 949, dependent unconditional: 1030, unknown: 653, unknown conditional: 170, unknown unconditional: 483] , Statistics on independence cache: Total cache size (in pairs): 653, Positive cache size: 605, Positive conditional cache size: 136, Positive unconditional cache size: 469, Negative cache size: 48, Negative conditional cache size: 34, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2752, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15081, independent: 13054, independent conditional: 5982, independent unconditional: 7072, dependent: 2027, dependent conditional: 1537, dependent unconditional: 490, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15081, independent: 13054, independent conditional: 3784, independent unconditional: 9270, dependent: 2027, dependent conditional: 983, dependent unconditional: 1044, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15081, independent: 13054, independent conditional: 3784, independent unconditional: 9270, dependent: 2027, dependent conditional: 983, dependent unconditional: 1044, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 653, independent: 605, independent conditional: 136, independent unconditional: 469, dependent: 48, dependent conditional: 34, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 653, independent: 595, independent conditional: 0, independent unconditional: 595, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 58, independent: 10, independent conditional: 9, independent unconditional: 1, dependent: 48, dependent conditional: 34, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 58, independent: 10, independent conditional: 9, independent unconditional: 1, dependent: 48, dependent conditional: 34, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 284, independent: 39, independent conditional: 39, independent unconditional: 1, dependent: 244, dependent conditional: 183, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 15081, independent: 12449, independent conditional: 3648, independent unconditional: 8801, dependent: 1979, dependent conditional: 949, dependent unconditional: 1030, unknown: 653, unknown conditional: 170, unknown unconditional: 483] , Statistics on independence cache: Total cache size (in pairs): 653, Positive cache size: 605, Positive conditional cache size: 136, Positive unconditional cache size: 469, Negative cache size: 48, Negative conditional cache size: 34, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2752 ], Independence queries for same thread: 73 - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 18]: 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 with 1 thread instances CFG has 5 procedures, 113 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 493.7s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 9, EmptinessCheckTime: 489.9s, 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: 38, 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, 3.5s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 2097 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 488.1s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 3, ConditionalCommutativityConditionCalculations: 283, ConditionalCommutativityTraceChecks: 71, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-06 00:55:43,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-06 00:55:43,817 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...