/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-158c277 [2024-11-14 13:45:20,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 13:45:20,482 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-14 13:45:20,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 13:45:20,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 13:45:20,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 13:45:20,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 13:45:20,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 13:45:20,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 13:45:20,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 13:45:20,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 13:45:20,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 13:45:20,516 INFO L153 SettingsManager]: * Use SBE=true [2024-11-14 13:45:20,516 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 13:45:20,516 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 13:45:20,516 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 13:45:20,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 13:45:20,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 13:45:20,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 13:45:20,517 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 13:45:20,517 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 13:45:20,517 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 13:45:20,517 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 13:45:20,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 13:45:20,517 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 13:45:20,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 13:45:20,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 13:45:20,517 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-14 13:45:20,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 13:45:20,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 13:45:20,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 13:45:20,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 13:45:20,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 13:45:20,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-14 13:45:20,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 13:45:20,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 13:45:20,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-14 13:45:20,518 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-14 13:45:20,518 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-14 13:45:20,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2024-11-14 13:45:20,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 13:45:20,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 13:45:20,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 13:45:20,810 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 13:45:20,811 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 13:45:20,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c [2024-11-14 13:45:22,147 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 13:45:22,358 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 13:45:22,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c [2024-11-14 13:45:22,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/d82963da8/a06f09fad61a4310975f181457c600d5/FLAG43fef438b [2024-11-14 13:45:22,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/d82963da8/a06f09fad61a4310975f181457c600d5 [2024-11-14 13:45:22,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 13:45:22,394 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-14 13:45:22,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 13:45:22,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 13:45:22,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 13:45:22,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 01:45:22" (1/1) ... [2024-11-14 13:45:22,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@114f498b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:45:22, skipping insertion in model container [2024-11-14 13:45:22,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 01:45:22" (1/1) ... [2024-11-14 13:45:22,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 13:45:22,589 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c[2707,2720] [2024-11-14 13:45:22,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 13:45:22,610 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 13:45:22,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c[2707,2720] [2024-11-14 13:45:22,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 13:45:22,654 INFO L204 MainTranslator]: Completed translation [2024-11-14 13:45:22,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:45:22 WrapperNode [2024-11-14 13:45:22,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 13:45:22,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 13:45:22,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 13:45:22,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 13:45:22,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:45:22" (1/1) ... [2024-11-14 13:45:22,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:45:22" (1/1) ... [2024-11-14 13:45:22,701 INFO L138 Inliner]: procedures = 23, calls = 35, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 187 [2024-11-14 13:45:22,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 13:45:22,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 13:45:22,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 13:45:22,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 13:45:22,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:45:22" (1/1) ... [2024-11-14 13:45:22,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:45:22" (1/1) ... [2024-11-14 13:45:22,712 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:45:22" (1/1) ... [2024-11-14 13:45:22,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:45:22" (1/1) ... [2024-11-14 13:45:22,722 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:45:22" (1/1) ... [2024-11-14 13:45:22,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:45:22" (1/1) ... [2024-11-14 13:45:22,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:45:22" (1/1) ... [2024-11-14 13:45:22,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:45:22" (1/1) ... [2024-11-14 13:45:22,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 13:45:22,737 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 13:45:22,737 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 13:45:22,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 13:45:22,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:45:22" (1/1) ... [2024-11-14 13:45:22,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 13:45:22,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 13:45:22,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 13:45:22,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 13:45:22,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 13:45:22,803 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-14 13:45:22,803 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-14 13:45:22,803 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-14 13:45:22,803 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-14 13:45:22,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 13:45:22,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 13:45:22,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-14 13:45:22,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-14 13:45:22,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 13:45:22,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 13:45:22,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 13:45:22,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 13:45:22,804 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 13:45:22,890 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 13:45:22,891 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 13:45:23,187 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 13:45:23,188 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 13:45:23,325 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 13:45:23,325 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-14 13:45:23,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 01:45:23 BoogieIcfgContainer [2024-11-14 13:45:23,326 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 13:45:23,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 13:45:23,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 13:45:23,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 13:45:23,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 01:45:22" (1/3) ... [2024-11-14 13:45:23,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b0fa2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 01:45:23, skipping insertion in model container [2024-11-14 13:45:23,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:45:22" (2/3) ... [2024-11-14 13:45:23,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b0fa2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 01:45:23, skipping insertion in model container [2024-11-14 13:45:23,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 01:45:23" (3/3) ... [2024-11-14 13:45:23,337 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-fun.wvr.c [2024-11-14 13:45:23,349 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 13:45:23,350 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-counter-fun.wvr.c that has 3 procedures, 152 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2024-11-14 13:45:23,350 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 13:45:23,434 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-14 13:45:23,485 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 13:45:23,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-14 13:45:23,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 13:45:23,488 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-14 13:45:23,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-14 13:45:23,567 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 13:45:23,577 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-14 13:45:23,583 INFO L333 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, 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;@37b739c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 13:45:23,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-14 13:45:23,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 13:45:23,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 13:45:23,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1593070638, now seen corresponding path program 1 times [2024-11-14 13:45:23,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 13:45:23,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305655223] [2024-11-14 13:45:23,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:45:23,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:45:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:45:24,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 13:45:24,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 13:45:24,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305655223] [2024-11-14 13:45:24,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305655223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 13:45:24,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 13:45:24,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 13:45:24,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951839021] [2024-11-14 13:45:24,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 13:45:24,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 13:45:24,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 13:45:24,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 13:45:24,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 13:45:24,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:24,206 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 13:45:24,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 63.5) internal successors, (127), 2 states have internal predecessors, (127), 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-11-14 13:45:24,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:24,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:24,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 13:45:24,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 13:45:24,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 13:45:24,261 INFO L85 PathProgramCache]: Analyzing trace with hash -956760466, now seen corresponding path program 1 times [2024-11-14 13:45:24,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 13:45:24,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210130941] [2024-11-14 13:45:24,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:45:24,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:45:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:45:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 13:45:24,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 13:45:24,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210130941] [2024-11-14 13:45:24,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210130941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 13:45:24,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 13:45:24,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 13:45:24,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280490782] [2024-11-14 13:45:24,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 13:45:24,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 13:45:24,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 13:45:24,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 13:45:24,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-14 13:45:24,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:24,682 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 13:45:24,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-11-14 13:45:24,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:24,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:24,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:24,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 13:45:24,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 13:45:24,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 13:45:24,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 13:45:24,822 INFO L85 PathProgramCache]: Analyzing trace with hash -884030086, now seen corresponding path program 1 times [2024-11-14 13:45:24,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 13:45:24,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026802329] [2024-11-14 13:45:24,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:45:24,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:45:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:45:25,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 13:45:25,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 13:45:25,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026802329] [2024-11-14 13:45:25,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026802329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 13:45:25,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 13:45:25,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 13:45:25,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165640521] [2024-11-14 13:45:25,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 13:45:25,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 13:45:25,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 13:45:25,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 13:45:25,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-14 13:45:25,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:25,295 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 13:45:25,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 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-11-14 13:45:25,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:25,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-14 13:45:25,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:25,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:25,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 13:45:25,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 13:45:25,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 13:45:25,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 13:45:25,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 13:45:25,469 INFO L85 PathProgramCache]: Analyzing trace with hash 303606047, now seen corresponding path program 1 times [2024-11-14 13:45:25,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 13:45:25,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57453057] [2024-11-14 13:45:25,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:45:25,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:45:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:45:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 13:45:25,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 13:45:25,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57453057] [2024-11-14 13:45:25,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57453057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 13:45:25,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 13:45:25,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 13:45:25,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439030647] [2024-11-14 13:45:25,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 13:45:25,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 13:45:25,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 13:45:25,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 13:45:25,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 13:45:25,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:25,726 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 13:45:25,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 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-11-14 13:45:25,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:25,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-14 13:45:25,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 13:45:25,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:25,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:25,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 13:45:25,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 13:45:25,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 13:45:25,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 13:45:25,862 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 13:45:25,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 13:45:25,865 INFO L85 PathProgramCache]: Analyzing trace with hash 767958512, now seen corresponding path program 1 times [2024-11-14 13:45:25,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 13:45:25,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507520532] [2024-11-14 13:45:25,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:45:25,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:45:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:45:26,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 13:45:26,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 13:45:26,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507520532] [2024-11-14 13:45:26,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507520532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 13:45:26,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885954749] [2024-11-14 13:45:26,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:45:26,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 13:45:26,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 13:45:26,146 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 13:45:26,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 13:45:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:45:26,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 13:45:26,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 13:45:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 13:45:26,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 13:45:26,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 13:45:26,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885954749] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 13:45:26,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 13:45:26,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 19 [2024-11-14 13:45:26,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006817758] [2024-11-14 13:45:26,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 13:45:26,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 13:45:26,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 13:45:26,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 13:45:26,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-11-14 13:45:26,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:26,636 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 13:45:26,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.842105263157896) internal successors, (187), 19 states have internal predecessors, (187), 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-11-14 13:45:26,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:26,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-14 13:45:26,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 13:45:26,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 13:45:26,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:27,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:27,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 13:45:27,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 13:45:27,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 13:45:27,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-14 13:45:27,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 13:45:27,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 13:45:27,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 13:45:27,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 13:45:27,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1145429896, now seen corresponding path program 2 times [2024-11-14 13:45:27,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 13:45:27,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919684125] [2024-11-14 13:45:27,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:45:27,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:45:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:45:28,006 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 13:45:28,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 13:45:28,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919684125] [2024-11-14 13:45:28,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919684125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 13:45:28,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150300021] [2024-11-14 13:45:28,007 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 13:45:28,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 13:45:28,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 13:45:28,010 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 13:45:28,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 13:45:28,150 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 13:45:28,150 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 13:45:28,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 13:45:28,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 13:45:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 13:45:28,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 13:45:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-14 13:45:28,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150300021] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 13:45:28,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 13:45:28,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 10] total 29 [2024-11-14 13:45:28,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988060734] [2024-11-14 13:45:28,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 13:45:28,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 13:45:28,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 13:45:28,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 13:45:28,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2024-11-14 13:45:28,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:28,724 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 13:45:28,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.275862068965517) internal successors, (211), 29 states have internal predecessors, (211), 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-11-14 13:45:28,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:28,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-14 13:45:28,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 13:45:28,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 13:45:28,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-11-14 13:45:28,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:29,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:29,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 13:45:29,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 13:45:29,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 13:45:29,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-14 13:45:29,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-14 13:45:29,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 13:45:30,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 13:45:30,076 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 13:45:30,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 13:45:30,076 INFO L85 PathProgramCache]: Analyzing trace with hash 317549944, now seen corresponding path program 3 times [2024-11-14 13:45:30,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 13:45:30,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208819264] [2024-11-14 13:45:30,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:45:30,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:45:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:45:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-14 13:45:30,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 13:45:30,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208819264] [2024-11-14 13:45:30,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208819264] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 13:45:30,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635855500] [2024-11-14 13:45:30,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 13:45:30,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 13:45:30,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 13:45:30,998 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 13:45:31,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 13:45:31,124 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 13:45:31,124 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 13:45:31,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 13:45:31,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 13:45:31,358 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-14 13:45:31,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 13:45:31,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 12 [2024-11-14 13:45:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-14 13:45:31,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635855500] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 13:45:31,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 13:45:31,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 20 [2024-11-14 13:45:31,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106905552] [2024-11-14 13:45:31,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 13:45:31,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 13:45:31,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 13:45:31,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 13:45:31,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-14 13:45:31,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:31,686 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 13:45:31,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.75) internal successors, (195), 20 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 13:45:31,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:31,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-14 13:45:31,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 13:45:31,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 13:45:31,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-11-14 13:45:31,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-11-14 13:45:31,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:32,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:32,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 13:45:32,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 13:45:32,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 13:45:32,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-14 13:45:32,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-14 13:45:32,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 13:45:32,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 13:45:32,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 13:45:32,351 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 13:45:32,428 WARN L331 ript$VariableManager]: TermVariable v_auxVar_56 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:45:32,428 WARN L331 ript$VariableManager]: TermVariable v_auxVar_60 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:45:32,428 WARN L331 ript$VariableManager]: TermVariable v_auxVar_55 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:45:32,428 WARN L331 ript$VariableManager]: TermVariable v_auxVar_58 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:45:32,428 WARN L331 ript$VariableManager]: TermVariable v_auxVar_59 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:45:32,428 WARN L331 ript$VariableManager]: TermVariable v_~counter~0_Out_2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:45:32,429 WARN L331 ript$VariableManager]: TermVariable v_auxVar_57 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:45:32,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 13:45:32,432 INFO L85 PathProgramCache]: Analyzing trace with hash 595298200, now seen corresponding path program 1 times [2024-11-14 13:45:32,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2024-11-14 13:45:32,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518201457] [2024-11-14 13:45:32,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:45:32,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:45:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:45:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-14 13:45:35,111 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2024-11-14 13:45:35,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518201457] [2024-11-14 13:45:35,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518201457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 13:45:35,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [53954783] [2024-11-14 13:45:35,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:45:35,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:45:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:45:35,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-14 13:45:35,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 13:45:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 51 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 13:45:36,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [53954783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 13:45:36,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 13:45:36,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 37 [2024-11-14 13:45:36,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 13:45:36,721 INFO L85 PathProgramCache]: Analyzing trace with hash 791861575, now seen corresponding path program 4 times [2024-11-14 13:45:36,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 13:45:36,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392992619] [2024-11-14 13:45:36,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:45:36,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:45:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:45:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 1 proven. 57 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-14 13:45:38,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 13:45:38,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392992619] [2024-11-14 13:45:38,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392992619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 13:45:38,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518982021] [2024-11-14 13:45:38,807 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 13:45:38,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 13:45:38,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 13:45:38,809 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 13:45:38,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 13:45:38,962 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 13:45:38,962 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 13:45:38,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-14 13:45:38,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 13:45:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 10 proven. 78 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-14 13:45:40,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 13:45:42,655 INFO L349 Elim1Store]: treesize reduction 12, result has 93.9 percent of original size [2024-11-14 13:45:42,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 208 treesize of output 256 [2024-11-14 13:45:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 15 proven. 73 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-14 13:45:43,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518982021] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 13:45:43,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 13:45:43,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 59 [2024-11-14 13:45:43,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995171430] [2024-11-14 13:45:43,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 13:45:43,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-14 13:45:43,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 13:45:43,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-14 13:45:43,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=618, Invalid=2804, Unknown=0, NotChecked=0, Total=3422 [2024-11-14 13:45:43,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:43,824 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 13:45:43,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 6.779661016949152) internal successors, (400), 59 states have internal predecessors, (400), 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-11-14 13:45:43,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:43,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-14 13:45:43,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 13:45:43,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 13:45:43,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-11-14 13:45:43,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-11-14 13:45:43,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-14 13:45:43,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:44,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:45:44,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 13:45:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 13:45:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 13:45:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-14 13:45:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-14 13:45:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 13:45:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 13:45:44,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 13:45:44,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-14 13:45:44,878 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 13:45:44,908 WARN L331 ript$VariableManager]: TermVariable v_auxVar_84 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:45:44,908 WARN L331 ript$VariableManager]: TermVariable v_auxVar_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:45:44,909 WARN L331 ript$VariableManager]: TermVariable v_auxVar_82 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:45:44,909 WARN L331 ript$VariableManager]: TermVariable v_auxVar_83 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:45:44,909 WARN L331 ript$VariableManager]: TermVariable v_auxVar_79 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:45:44,909 WARN L331 ript$VariableManager]: TermVariable v_~counter~0_Out_4 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:45:44,909 WARN L331 ript$VariableManager]: TermVariable v_auxVar_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:45:44,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 13:45:44,910 INFO L85 PathProgramCache]: Analyzing trace with hash -694017472, now seen corresponding path program 1 times [2024-11-14 13:45:44,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2024-11-14 13:45:44,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043813487] [2024-11-14 13:45:44,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:45:44,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:45:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:45:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 13:45:54,899 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2024-11-14 13:45:54,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043813487] [2024-11-14 13:45:54,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043813487] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 13:45:54,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [1582537341] [2024-11-14 13:45:54,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:45:54,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:45:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:45:55,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-14 13:45:55,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 13:45:57,707 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 23 proven. 21 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-14 13:45:57,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [1582537341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 13:45:57,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 13:45:57,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 34] total 67 [2024-11-14 13:45:57,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 13:45:57,709 INFO L85 PathProgramCache]: Analyzing trace with hash 609557698, now seen corresponding path program 5 times [2024-11-14 13:45:57,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 13:45:57,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078639500] [2024-11-14 13:45:57,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:45:57,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:45:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:46:08,801 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 13:46:08,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 13:46:08,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078639500] [2024-11-14 13:46:08,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078639500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 13:46:08,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172875611] [2024-11-14 13:46:08,802 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-14 13:46:08,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 13:46:08,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 13:46:08,803 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 13:46:08,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 13:46:08,983 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-14 13:46:08,983 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 13:46:08,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-14 13:46:08,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 13:46:21,378 INFO L349 Elim1Store]: treesize reduction 101, result has 53.5 percent of original size [2024-11-14 13:46:21,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 81 treesize of output 157 [2024-11-14 13:46:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 8 proven. 48 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-14 13:46:21,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 13:46:22,736 INFO L349 Elim1Store]: treesize reduction 266, result has 30.2 percent of original size [2024-11-14 13:46:22,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 17 new quantified variables, introduced 36 case distinctions, treesize of input 308 treesize of output 198 [2024-11-14 13:46:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 35 proven. 53 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-14 13:46:23,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172875611] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 13:46:23,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 13:46:23,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 19, 14] total 68 [2024-11-14 13:46:23,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344366097] [2024-11-14 13:46:23,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 13:46:23,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-14 13:46:23,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 13:46:23,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-14 13:46:23,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=4188, Unknown=4, NotChecked=0, Total=4556 [2024-11-14 13:46:23,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:46:23,126 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 13:46:23,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 6.8088235294117645) internal successors, (463), 68 states have internal predecessors, (463), 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-11-14 13:46:23,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:46:23,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-14 13:46:23,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 13:46:23,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 13:46:23,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-11-14 13:46:23,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-11-14 13:46:23,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-14 13:46:23,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 13:46:23,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:46:28,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 13:46:30,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 13:46:32,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 13:46:34,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 13:46:36,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 13:46:38,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 13:46:40,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 13:46:42,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 13:46:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:46:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 13:46:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 13:46:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 13:46:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-14 13:46:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-14 13:46:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 13:46:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 13:46:44,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-14 13:46:44,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 13:46:44,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12 [2024-11-14 13:46:44,382 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 13:46:44,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 13:46:44,384 INFO L85 PathProgramCache]: Analyzing trace with hash 914217505, now seen corresponding path program 6 times [2024-11-14 13:46:44,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 13:46:44,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681050531] [2024-11-14 13:46:44,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:46:44,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:46:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:46:45,163 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 2 proven. 173 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-14 13:46:45,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 13:46:45,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681050531] [2024-11-14 13:46:45,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681050531] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 13:46:45,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081091969] [2024-11-14 13:46:45,163 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-14 13:46:45,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 13:46:45,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 13:46:45,165 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 13:46:45,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 13:46:45,448 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-14 13:46:45,448 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 13:46:45,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-14 13:46:45,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 13:46:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 7 proven. 254 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-14 13:46:46,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 13:46:46,971 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 7 proven. 144 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-14 13:46:46,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081091969] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 13:46:46,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 13:46:46,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 43, 13] total 62 [2024-11-14 13:46:46,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461887975] [2024-11-14 13:46:46,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 13:46:46,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-14 13:46:46,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 13:46:46,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-14 13:46:46,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=3433, Unknown=0, NotChecked=0, Total=3782 [2024-11-14 13:46:46,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:46:46,975 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 13:46:46,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 5.016129032258065) internal successors, (311), 62 states have internal predecessors, (311), 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-11-14 13:46:46,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:46:46,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-14 13:46:46,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 13:46:46,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 13:46:46,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-11-14 13:46:46,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-11-14 13:46:46,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-14 13:46:46,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 13:46:46,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-11-14 13:46:46,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:46:52,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:46:52,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 13:46:52,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 13:46:52,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 13:46:52,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-14 13:46:52,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-14 13:46:52,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 13:46:52,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 13:46:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-14 13:46:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2024-11-14 13:46:52,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 13:46:52,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 13:46:52,839 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 13:46:52,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 13:46:52,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1249593229, now seen corresponding path program 7 times [2024-11-14 13:46:52,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 13:46:52,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457170629] [2024-11-14 13:46:52,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:46:52,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:46:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:47:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 252 proven. 686 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-14 13:47:18,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 13:47:18,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457170629] [2024-11-14 13:47:18,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457170629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 13:47:18,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086163405] [2024-11-14 13:47:18,865 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 13:47:18,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 13:47:18,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 13:47:18,866 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 13:47:18,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 13:47:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:47:19,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 165 conjuncts are in the unsatisfiable core [2024-11-14 13:47:19,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 13:47:24,544 INFO L349 Elim1Store]: treesize reduction 382, result has 15.7 percent of original size [2024-11-14 13:47:24,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 17 new quantified variables, introduced 45 case distinctions, treesize of input 277 treesize of output 136 [2024-11-14 13:47:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 38 proven. 828 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-11-14 13:47:24,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 13:48:49,526 INFO L349 Elim1Store]: treesize reduction 1026, result has 31.1 percent of original size [2024-11-14 13:48:49,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 31 new quantified variables, introduced 136 case distinctions, treesize of input 479 treesize of output 621 [2024-11-14 13:48:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 115 proven. 641 refuted. 90 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-14 13:48:52,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086163405] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 13:48:52,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 13:48:52,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 50, 33] total 118 [2024-11-14 13:48:52,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810293736] [2024-11-14 13:48:52,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 13:48:52,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 118 states [2024-11-14 13:48:52,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 13:48:52,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2024-11-14 13:48:52,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=12418, Unknown=10, NotChecked=0, Total=13806 [2024-11-14 13:48:52,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:48:52,884 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 13:48:52,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 118 states, 118 states have (on average 5.601694915254237) internal successors, (661), 118 states have internal predecessors, (661), 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-11-14 13:48:52,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:48:52,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-14 13:48:52,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 13:48:52,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 13:48:52,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-11-14 13:48:52,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-11-14 13:48:52,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-14 13:48:52,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-14 13:48:52,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-11-14 13:48:52,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 161 states. [2024-11-14 13:48:52,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:49:57,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:50:00,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:50:01,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:50:03,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:50:07,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:50:10,946 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~f~0.base)) (.cse5 (select |c_#memory_int| c_~f_inv~0.base)) (.cse65 (* c_~counter~0 4))) (let ((.cse10 (select .cse5 (+ .cse65 c_~f_inv~0.offset))) (.cse39 (select .cse4 (+ .cse65 c_~f~0.offset)))) (let ((.cse64 (* .cse39 4)) (.cse44 (* 4 .cse10))) (let ((.cse12 (select .cse4 (+ c_~f~0.offset .cse44))) (.cse19 (select .cse4 (+ c_~f~0.offset .cse64)))) (let ((.cse55 (select .cse5 (+ (* .cse19 4) c_~f_inv~0.offset))) (.cse29 (* 4 .cse12)) (.cse38 (select .cse5 (+ .cse64 c_~f_inv~0.offset))) (.cse63 (+ c_~counter~0 1)) (.cse41 (+ .cse10 1))) (let ((.cse11 (< c_~n~0 .cse41)) (.cse13 (< c_~n_inv~0 .cse63)) (.cse18 (not (= .cse38 c_~counter~0))) (.cse23 (< c_~n_inv~0 (+ .cse39 1))) (.cse24 (< .cse39 0)) (.cse14 (< .cse10 0)) (.cse15 (select .cse5 (+ c_~f_inv~0.offset .cse29))) (.cse17 (not (= .cse39 .cse55))) (.cse16 (< c_~counter~0 0)) (.cse40 (< c_~n~0 .cse63)) (.cse22 (+ .cse55 1)) (.cse25 (* .cse55 4))) (and (forall ((v_~counter~0_265 Int)) (let ((.cse8 (select .cse5 (+ (* (select .cse4 (+ (* v_~counter~0_265 4) c_~f~0.offset)) 4) c_~f_inv~0.offset)))) (or (forall ((v_~counter~0_263 Int)) (let ((.cse1 (select .cse5 (+ (* v_~counter~0_263 4) c_~f_inv~0.offset)))) (let ((.cse7 (* 4 .cse1))) (let ((.cse0 (select .cse4 (+ c_~f~0.offset (* (select .cse5 (+ .cse7 c_~f_inv~0.offset)) 4))))) (let ((.cse6 (select .cse4 (+ c_~f~0.offset (* .cse0 4))))) (let ((.cse9 (select .cse5 (+ (* .cse6 4) c_~f_inv~0.offset)))) (let ((.cse2 (select .cse4 (+ c_~f~0.offset (* .cse9 4))))) (let ((.cse3 (select .cse5 (+ (* (select .cse4 (+ c_~f~0.offset (* .cse2 4))) 4) c_~f_inv~0.offset)))) (or (< c_~n_inv~0 (+ .cse0 1)) (< .cse1 0) (not (= .cse2 .cse3)) (= (select .cse4 (+ (* (select .cse5 (+ c_~f_inv~0.offset (* 4 .cse3))) 4) c_~f~0.offset)) 0) (< c_~n_inv~0 (+ .cse6 1)) (not (= .cse0 .cse1)) (not (= v_~counter~0_263 (select .cse4 (+ c_~f~0.offset .cse7)))) (< .cse8 v_~counter~0_263) (< c_~n~0 (+ .cse9 1)) (< v_~counter~0_263 0)))))))))) (< .cse10 v_~counter~0_265) (not (= v_~counter~0_265 .cse8))))) (or .cse11 (= .cse12 0) (< c_~n_inv~0 (+ .cse12 1)) (< .cse12 0) .cse13 .cse14 (not (= .cse15 .cse10)) .cse16) (let ((.cse21 (select .cse4 (+ c_~f~0.offset .cse25)))) (let ((.cse20 (select .cse5 (+ (* (select .cse4 (+ (* .cse21 4) c_~f~0.offset)) 4) c_~f_inv~0.offset)))) (or .cse17 .cse18 (< .cse19 0) (not (= .cse20 .cse21)) (< c_~n~0 .cse22) (< c_~n_inv~0 (+ .cse19 1)) (= (select .cse4 (+ (* (select .cse5 (+ (* .cse20 4) c_~f_inv~0.offset)) 4) c_~f~0.offset)) 0) .cse23 .cse24))) (let ((.cse27 (select .cse5 (+ (* (select .cse4 (+ c_~f~0.offset .cse29)) 4) c_~f_inv~0.offset)))) (let ((.cse28 (select .cse5 (+ (* .cse27 4) c_~f_inv~0.offset)))) (let ((.cse26 (select .cse4 (+ c_~f~0.offset (* .cse28 4))))) (or .cse11 (< .cse26 0) (< c_~n_inv~0 (+ .cse27 1)) .cse13 .cse14 (< c_~n_inv~0 (+ .cse26 1)) (= 0 .cse26) (< .cse28 0) .cse16 (not (= .cse28 (select .cse5 (+ c_~f_inv~0.offset (* 4 .cse26))))) (< .cse27 0) (not (= .cse27 .cse12)) (< c_~n~0 (+ .cse28 1)))))) (let ((.cse35 (select .cse5 (+ (* (select .cse4 (+ c_~f~0.offset (* .cse38 4))) 4) c_~f_inv~0.offset)))) (or (forall ((v_~counter~0_263 Int) (v_~counter~0_265 Int)) (let ((.cse31 (select .cse5 (+ (* v_~counter~0_263 4) c_~f_inv~0.offset)))) (let ((.cse37 (* 4 .cse31))) (let ((.cse30 (select .cse4 (+ c_~f~0.offset (* (select .cse5 (+ .cse37 c_~f_inv~0.offset)) 4))))) (let ((.cse36 (select .cse4 (+ c_~f~0.offset (* .cse30 4))))) (let ((.cse33 (select .cse4 (+ c_~f~0.offset (* (select .cse5 (+ (* .cse36 4) c_~f_inv~0.offset)) 4))))) (let ((.cse34 (select .cse5 (+ (* (select .cse4 (+ c_~f~0.offset (* .cse33 4))) 4) c_~f_inv~0.offset))) (.cse32 (select .cse5 (+ (* (select .cse4 (+ (* v_~counter~0_265 4) c_~f~0.offset)) 4) c_~f_inv~0.offset)))) (or (< c_~n_inv~0 (+ .cse30 1)) (< .cse31 0) (not (= v_~counter~0_265 .cse32)) (not (= .cse33 .cse34)) (= (select .cse4 (+ (* (select .cse5 (+ c_~f_inv~0.offset (* 4 .cse34))) 4) c_~f~0.offset)) 0) (< .cse35 v_~counter~0_265) (< c_~n_inv~0 (+ .cse36 1)) (not (= .cse30 .cse31)) (not (= v_~counter~0_263 (select .cse4 (+ c_~f~0.offset .cse37)))) (< .cse32 v_~counter~0_263) (< v_~counter~0_263 0))))))))) (not (= .cse38 .cse35)))) (or (= .cse39 0) .cse18 .cse23 .cse24 .cse16 .cse40) (let ((.cse42 (select .cse5 (+ .cse44 c_~f_inv~0.offset)))) (let ((.cse43 (select .cse4 (+ c_~f~0.offset (* .cse42 4))))) (or (not (= c_~counter~0 .cse12)) (< c_~n_inv~0 .cse41) (< .cse42 0) (< c_~n~0 (+ .cse42 1)) (< c_~n_inv~0 (+ .cse43 1)) .cse14 (< .cse43 0) (not (= .cse42 (select .cse5 (+ (* .cse43 4) c_~f_inv~0.offset)))) (= .cse43 0)))) (let ((.cse45 (select .cse5 (+ (* (select .cse4 (+ (* .cse15 4) c_~f~0.offset)) 4) c_~f_inv~0.offset)))) (or (not (= .cse45 .cse15)) (forall ((v_~counter~0_263 Int) (v_~counter~0_265 Int)) (let ((.cse47 (select .cse5 (+ (* v_~counter~0_263 4) c_~f_inv~0.offset)))) (let ((.cse52 (* 4 .cse47))) (let ((.cse46 (select .cse4 (+ c_~f~0.offset (* (select .cse5 (+ .cse52 c_~f_inv~0.offset)) 4))))) (let ((.cse51 (select .cse4 (+ c_~f~0.offset (* .cse46 4))))) (let ((.cse49 (select .cse4 (+ c_~f~0.offset (* (select .cse5 (+ (* .cse51 4) c_~f_inv~0.offset)) 4))))) (let ((.cse50 (select .cse5 (+ (* (select .cse4 (+ c_~f~0.offset (* .cse49 4))) 4) c_~f_inv~0.offset))) (.cse48 (select .cse5 (+ (* (select .cse4 (+ (* v_~counter~0_265 4) c_~f~0.offset)) 4) c_~f_inv~0.offset)))) (or (< c_~n_inv~0 (+ .cse46 1)) (< .cse47 0) (< .cse45 v_~counter~0_265) (not (= v_~counter~0_265 .cse48)) (not (= .cse49 .cse50)) (= (select .cse4 (+ (* (select .cse5 (+ c_~f_inv~0.offset (* 4 .cse50))) 4) c_~f~0.offset)) 0) (< c_~n_inv~0 (+ .cse51 1)) (not (= .cse46 .cse47)) (not (= v_~counter~0_263 (select .cse4 (+ c_~f~0.offset .cse52)))) (< .cse48 v_~counter~0_263) (< v_~counter~0_263 0))))))))))) (let ((.cse54 (select .cse5 (+ .cse25 c_~f_inv~0.offset)))) (let ((.cse53 (select .cse4 (+ c_~f~0.offset (* .cse54 4))))) (or .cse17 (< c_~n_inv~0 (+ .cse53 1)) (not (= (select .cse5 (+ (* 4 .cse53) c_~f_inv~0.offset)) .cse54)) (< .cse54 0) (= .cse53 0) (< .cse55 0) (< c_~n~0 (+ .cse54 1)) .cse16 .cse40 (< c_~n_inv~0 .cse22) (< .cse53 0)))) (forall ((v_~counter~0_263 Int)) (let ((.cse57 (select .cse5 (+ (* v_~counter~0_263 4) c_~f_inv~0.offset)))) (let ((.cse61 (* 4 .cse57))) (let ((.cse56 (select .cse4 (+ c_~f~0.offset (* (select .cse5 (+ .cse61 c_~f_inv~0.offset)) 4))))) (let ((.cse60 (select .cse4 (+ c_~f~0.offset (* .cse56 4))))) (let ((.cse62 (select .cse5 (+ (* .cse60 4) c_~f_inv~0.offset)))) (let ((.cse58 (select .cse4 (+ c_~f~0.offset (* .cse62 4))))) (let ((.cse59 (select .cse5 (+ (* (select .cse4 (+ c_~f~0.offset (* .cse58 4))) 4) c_~f_inv~0.offset)))) (or (< c_~n_inv~0 (+ .cse56 1)) (< .cse57 0) (not (= .cse58 .cse59)) (< .cse10 v_~counter~0_263) (= (select .cse4 (+ (* (select .cse5 (+ c_~f_inv~0.offset (* 4 .cse59))) 4) c_~f~0.offset)) 0) (< c_~n_inv~0 (+ .cse60 1)) (not (= .cse56 .cse57)) (not (= v_~counter~0_263 (select .cse4 (+ c_~f~0.offset .cse61)))) (< c_~n~0 (+ .cse62 1)) (< v_~counter~0_263 0)))))))))) (= c_~counter~0 0)))))))) is different from false [2024-11-14 13:50:16,729 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| c_~f_inv~0.base)) (.cse58 (* c_~counter~0 4))) (let ((.cse10 (select .cse5 (+ .cse58 c_~f_inv~0.offset)))) (let ((.cse35 (* 4 .cse10)) (.cse4 (select |c_#memory_int| c_~f~0.base))) (let ((.cse30 (select .cse4 (+ .cse58 c_~f~0.offset))) (.cse12 (select .cse4 (+ c_~f~0.offset .cse35)))) (let ((.cse20 (* 4 .cse12)) (.cse49 (* .cse30 4)) (.cse57 (+ c_~counter~0 1)) (.cse32 (+ .cse10 1))) (let ((.cse11 (< c_~n~0 .cse32)) (.cse13 (< c_~n_inv~0 .cse57)) (.cse29 (select .cse5 (+ .cse49 c_~f_inv~0.offset))) (.cse14 (< .cse10 0)) (.cse15 (select .cse5 (+ c_~f_inv~0.offset .cse20))) (.cse16 (< c_~counter~0 0)) (.cse31 (< c_~n~0 .cse57)) (.cse36 (< c_~n_inv~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse45 (= (select |c_#valid| c_~f~0.base) 1))) (and (= c_~f~0.offset 0) (forall ((v_~counter~0_265 Int)) (let ((.cse8 (select .cse5 (+ (* (select .cse4 (+ (* v_~counter~0_265 4) c_~f~0.offset)) 4) c_~f_inv~0.offset)))) (or (forall ((v_~counter~0_263 Int)) (let ((.cse1 (select .cse5 (+ (* v_~counter~0_263 4) c_~f_inv~0.offset)))) (let ((.cse7 (* 4 .cse1))) (let ((.cse0 (select .cse4 (+ c_~f~0.offset (* (select .cse5 (+ .cse7 c_~f_inv~0.offset)) 4))))) (let ((.cse6 (select .cse4 (+ c_~f~0.offset (* .cse0 4))))) (let ((.cse9 (select .cse5 (+ (* .cse6 4) c_~f_inv~0.offset)))) (let ((.cse2 (select .cse4 (+ c_~f~0.offset (* .cse9 4))))) (let ((.cse3 (select .cse5 (+ (* (select .cse4 (+ c_~f~0.offset (* .cse2 4))) 4) c_~f_inv~0.offset)))) (or (< c_~n_inv~0 (+ .cse0 1)) (< .cse1 0) (not (= .cse2 .cse3)) (= (select .cse4 (+ (* (select .cse5 (+ c_~f_inv~0.offset (* 4 .cse3))) 4) c_~f~0.offset)) 0) (< c_~n_inv~0 (+ .cse6 1)) (not (= .cse0 .cse1)) (not (= v_~counter~0_263 (select .cse4 (+ c_~f~0.offset .cse7)))) (< .cse8 v_~counter~0_263) (< c_~n~0 (+ .cse9 1)) (< v_~counter~0_263 0)))))))))) (< .cse10 v_~counter~0_265) (not (= v_~counter~0_265 .cse8))))) (or .cse11 (= .cse12 0) (< c_~n_inv~0 (+ .cse12 1)) (< .cse12 0) .cse13 .cse14 (not (= .cse15 .cse10)) .cse16) (let ((.cse18 (select .cse5 (+ (* (select .cse4 (+ c_~f~0.offset .cse20)) 4) c_~f_inv~0.offset)))) (let ((.cse19 (select .cse5 (+ (* .cse18 4) c_~f_inv~0.offset)))) (let ((.cse17 (select .cse4 (+ c_~f~0.offset (* .cse19 4))))) (or .cse11 (< .cse17 0) (< c_~n_inv~0 (+ .cse18 1)) .cse13 .cse14 (< c_~n_inv~0 (+ .cse17 1)) (= 0 .cse17) (< .cse19 0) .cse16 (not (= .cse19 (select .cse5 (+ c_~f_inv~0.offset (* 4 .cse17))))) (< .cse18 0) (not (= .cse18 .cse12)) (< c_~n~0 (+ .cse19 1)))))) (let ((.cse26 (select .cse5 (+ (* (select .cse4 (+ c_~f~0.offset (* .cse29 4))) 4) c_~f_inv~0.offset)))) (or (forall ((v_~counter~0_263 Int) (v_~counter~0_265 Int)) (let ((.cse22 (select .cse5 (+ (* v_~counter~0_263 4) c_~f_inv~0.offset)))) (let ((.cse28 (* 4 .cse22))) (let ((.cse21 (select .cse4 (+ c_~f~0.offset (* (select .cse5 (+ .cse28 c_~f_inv~0.offset)) 4))))) (let ((.cse27 (select .cse4 (+ c_~f~0.offset (* .cse21 4))))) (let ((.cse24 (select .cse4 (+ c_~f~0.offset (* (select .cse5 (+ (* .cse27 4) c_~f_inv~0.offset)) 4))))) (let ((.cse25 (select .cse5 (+ (* (select .cse4 (+ c_~f~0.offset (* .cse24 4))) 4) c_~f_inv~0.offset))) (.cse23 (select .cse5 (+ (* (select .cse4 (+ (* v_~counter~0_265 4) c_~f~0.offset)) 4) c_~f_inv~0.offset)))) (or (< c_~n_inv~0 (+ .cse21 1)) (< .cse22 0) (not (= v_~counter~0_265 .cse23)) (not (= .cse24 .cse25)) (= (select .cse4 (+ (* (select .cse5 (+ c_~f_inv~0.offset (* 4 .cse25))) 4) c_~f~0.offset)) 0) (< .cse26 v_~counter~0_265) (< c_~n_inv~0 (+ .cse27 1)) (not (= .cse21 .cse22)) (not (= v_~counter~0_263 (select .cse4 (+ c_~f~0.offset .cse28)))) (< .cse23 v_~counter~0_263) (< v_~counter~0_263 0))))))))) (not (= .cse29 .cse26)))) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (or (= .cse30 0) (not (= .cse29 c_~counter~0)) (< c_~n_inv~0 (+ .cse30 1)) (< .cse30 0) .cse16 .cse31) (let ((.cse33 (select .cse5 (+ .cse35 c_~f_inv~0.offset)))) (let ((.cse34 (select .cse4 (+ c_~f~0.offset (* .cse33 4))))) (or (not (= c_~counter~0 .cse12)) (< c_~n_inv~0 .cse32) (< .cse33 0) (< c_~n~0 (+ .cse33 1)) (< c_~n_inv~0 (+ .cse34 1)) .cse14 (< .cse34 0) (not (= .cse33 (select .cse5 (+ (* .cse34 4) c_~f_inv~0.offset)))) (= .cse34 0)))) (or .cse36 (not (= c_~f~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse37 (select .cse5 (+ (* (select .cse4 (+ (* .cse15 4) c_~f~0.offset)) 4) c_~f_inv~0.offset)))) (or (not (= .cse37 .cse15)) (forall ((v_~counter~0_263 Int) (v_~counter~0_265 Int)) (let ((.cse39 (select .cse5 (+ (* v_~counter~0_263 4) c_~f_inv~0.offset)))) (let ((.cse44 (* 4 .cse39))) (let ((.cse38 (select .cse4 (+ c_~f~0.offset (* (select .cse5 (+ .cse44 c_~f_inv~0.offset)) 4))))) (let ((.cse43 (select .cse4 (+ c_~f~0.offset (* .cse38 4))))) (let ((.cse41 (select .cse4 (+ c_~f~0.offset (* (select .cse5 (+ (* .cse43 4) c_~f_inv~0.offset)) 4))))) (let ((.cse42 (select .cse5 (+ (* (select .cse4 (+ c_~f~0.offset (* .cse41 4))) 4) c_~f_inv~0.offset))) (.cse40 (select .cse5 (+ (* (select .cse4 (+ (* v_~counter~0_265 4) c_~f~0.offset)) 4) c_~f_inv~0.offset)))) (or (< c_~n_inv~0 (+ .cse38 1)) (< .cse39 0) (< .cse37 v_~counter~0_265) (not (= v_~counter~0_265 .cse40)) (not (= .cse41 .cse42)) (= (select .cse4 (+ (* (select .cse5 (+ c_~f_inv~0.offset (* 4 .cse42))) 4) c_~f~0.offset)) 0) (< c_~n_inv~0 (+ .cse43 1)) (not (= .cse38 .cse39)) (not (= v_~counter~0_263 (select .cse4 (+ c_~f~0.offset .cse44)))) (< .cse40 v_~counter~0_263) (< v_~counter~0_263 0))))))))))) (<= c_~n_inv~0 2) .cse45 (<= c_~n_inv~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse46 (select .cse5 (+ (* (select .cse4 (+ c_~f~0.offset .cse49)) 4) c_~f_inv~0.offset)))) (let ((.cse48 (select .cse5 (+ (* .cse46 4) c_~f_inv~0.offset)))) (let ((.cse47 (select .cse4 (+ c_~f~0.offset (* .cse48 4))))) (or (not (= .cse30 .cse46)) (< c_~n_inv~0 (+ .cse47 1)) (not (= (select .cse5 (+ (* 4 .cse47) c_~f_inv~0.offset)) .cse48)) (< .cse48 0) (= .cse47 0) (< .cse46 0) (< c_~n~0 (+ .cse48 1)) .cse16 .cse31 (< c_~n_inv~0 (+ .cse46 1)) (< .cse47 0))))) (forall ((v_~counter~0_263 Int)) (let ((.cse51 (select .cse5 (+ (* v_~counter~0_263 4) c_~f_inv~0.offset)))) (let ((.cse55 (* 4 .cse51))) (let ((.cse50 (select .cse4 (+ c_~f~0.offset (* (select .cse5 (+ .cse55 c_~f_inv~0.offset)) 4))))) (let ((.cse54 (select .cse4 (+ c_~f~0.offset (* .cse50 4))))) (let ((.cse56 (select .cse5 (+ (* .cse54 4) c_~f_inv~0.offset)))) (let ((.cse52 (select .cse4 (+ c_~f~0.offset (* .cse56 4))))) (let ((.cse53 (select .cse5 (+ (* (select .cse4 (+ c_~f~0.offset (* .cse52 4))) 4) c_~f_inv~0.offset)))) (or (< c_~n_inv~0 (+ .cse50 1)) (< .cse51 0) (not (= .cse52 .cse53)) (< .cse10 v_~counter~0_263) (= (select .cse4 (+ (* (select .cse5 (+ c_~f_inv~0.offset (* 4 .cse53))) 4) c_~f~0.offset)) 0) (< c_~n_inv~0 (+ .cse54 1)) (not (= .cse50 .cse51)) (not (= v_~counter~0_263 (select .cse4 (+ c_~f~0.offset .cse55)))) (< c_~n~0 (+ .cse56 1)) (< v_~counter~0_263 0)))))))))) (= c_~counter~0 0) (or (< c_~n_inv~0 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse45) (or .cse36 .cse45) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= c_~n_inv~0 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)))))))) is different from false [2024-11-14 13:51:57,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:51:59,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:01,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 13:52:03,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:06,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:08,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:11,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:13,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:15,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:17,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:19,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:22,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:25,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:27,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:29,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:31,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:33,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 13:52:35,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:37,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:39,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:41,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:43,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:45,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:47,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:49,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:51,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:53,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:52:55,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 13:52:57,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:00,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:03,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:05,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:07,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:09,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:11,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 13:53:13,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:16,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:18,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:20,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:22,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:24,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:26,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:28,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:31,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 13:53:33,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:35,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:37,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:39,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:40,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:43,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:45,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:47,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:49,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:51,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:53,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:55,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:53:58,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:54:00,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:54:03,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:54:08,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:54:10,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:54:12,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:54:14,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:54:16,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:54:19,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:54:21,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:54:23,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:54:26,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:54:28,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:54:31,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 13:54:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 13:54:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 13:54:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 13:54:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 13:54:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-14 13:54:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-14 13:54:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 13:54:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 13:54:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-14 13:54:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2024-11-14 13:54:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-14 13:54:32,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 13:54:32,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 13:54:32,441 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 13:54:32,470 WARN L331 ript$VariableManager]: TermVariable v_auxVar_223 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:54:32,471 WARN L331 ript$VariableManager]: TermVariable v_auxVar_224 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:54:32,471 WARN L331 ript$VariableManager]: TermVariable v_auxVar_228 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:54:32,471 WARN L331 ript$VariableManager]: TermVariable v_auxVar_227 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:54:32,471 WARN L331 ript$VariableManager]: TermVariable v_auxVar_226 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:54:32,471 WARN L331 ript$VariableManager]: TermVariable v_~counter~0_Out_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:54:32,471 WARN L331 ript$VariableManager]: TermVariable v_auxVar_225 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:54:32,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 13:54:32,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1452859665, now seen corresponding path program 1 times [2024-11-14 13:54:32,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2024-11-14 13:54:32,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109668061] [2024-11-14 13:54:32,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:54:32,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:54:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:55:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 45 proven. 451 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-14 13:55:07,717 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2024-11-14 13:55:07,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109668061] [2024-11-14 13:55:07,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109668061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 13:55:07,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [145112139] [2024-11-14 13:55:07,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:55:07,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:55:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:55:08,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 209 conjuncts are in the unsatisfiable core [2024-11-14 13:55:08,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 13:55:09,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 13:55:09,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 13:55:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 22 proven. 54 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-11-14 13:55:11,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [145112139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 13:55:11,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 13:55:11,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 36] total 57 [2024-11-14 13:55:11,838 WARN L331 ript$VariableManager]: TermVariable v_auxVar_252 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:55:11,838 WARN L331 ript$VariableManager]: TermVariable v_~counter~0_Out_8 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:55:11,838 WARN L331 ript$VariableManager]: TermVariable v_auxVar_247 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:55:11,838 WARN L331 ript$VariableManager]: TermVariable v_auxVar_248 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:55:11,838 WARN L331 ript$VariableManager]: TermVariable v_auxVar_251 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:55:11,838 WARN L331 ript$VariableManager]: TermVariable v_auxVar_250 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:55:11,838 WARN L331 ript$VariableManager]: TermVariable v_auxVar_249 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:55:11,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 13:55:11,839 INFO L85 PathProgramCache]: Analyzing trace with hash 861168946, now seen corresponding path program 1 times [2024-11-14 13:55:11,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2024-11-14 13:55:11,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189943660] [2024-11-14 13:55:11,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:55:11,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:55:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:56:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 65 proven. 739 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 13:56:50,805 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2024-11-14 13:56:50,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189943660] [2024-11-14 13:56:50,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189943660] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 13:56:50,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [948132464] [2024-11-14 13:56:50,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:56:50,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:56:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:56:51,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 265 conjuncts are in the unsatisfiable core [2024-11-14 13:56:51,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 13:56:51,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 13:56:51,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 13:56:52,051 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 13:56:52,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 13:56:52,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 13:56:52,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 13:56:52,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 13:56:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 292 proven. 56 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2024-11-14 13:56:57,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [948132464] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 13:56:57,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 13:56:57,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 40] total 80 [2024-11-14 13:56:57,614 WARN L331 ript$VariableManager]: TermVariable v_auxVar_275 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:56:57,614 WARN L331 ript$VariableManager]: TermVariable v_auxVar_274 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:56:57,614 WARN L331 ript$VariableManager]: TermVariable v_auxVar_271 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:56:57,614 WARN L331 ript$VariableManager]: TermVariable v_auxVar_272 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:56:57,614 WARN L331 ript$VariableManager]: TermVariable v_auxVar_276 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:56:57,614 WARN L331 ript$VariableManager]: TermVariable v_auxVar_273 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:56:57,615 WARN L331 ript$VariableManager]: TermVariable v_~counter~0_Out_10 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 13:56:57,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 13:56:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1285783175, now seen corresponding path program 1 times [2024-11-14 13:56:57,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2024-11-14 13:56:57,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986943926] [2024-11-14 13:56:57,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:56:57,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:56:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:57:03,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2024-11-14 13:57:03,518 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2024-11-14 13:57:03,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986943926] [2024-11-14 13:57:03,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986943926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 13:57:03,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [732817122] [2024-11-14 13:57:03,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:57:03,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:57:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:57:04,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 244 conjuncts are in the unsatisfiable core [2024-11-14 13:57:04,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 13:57:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1073 backedges. 242 proven. 315 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-14 13:57:11,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [732817122] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 13:57:11,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 13:57:11,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 42] total 75 [2024-11-14 13:57:11,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 13:57:11,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1216784060, now seen corresponding path program 8 times [2024-11-14 13:57:11,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 13:57:11,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50870237] [2024-11-14 13:57:11,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 13:57:11,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 13:57:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 13:58:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 40 proven. 1235 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 13:58:24,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 13:58:24,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50870237] [2024-11-14 13:58:24,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50870237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 13:58:24,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807174633] [2024-11-14 13:58:24,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 13:58:24,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 13:58:24,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 13:58:24,133 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 13:58:24,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 13:58:24,446 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 13:58:24,446 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 13:58:24,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 140 conjuncts are in the unsatisfiable core [2024-11-14 13:58:24,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2024-11-14 13:59:05,617 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-11-14 13:59:05,617 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-11-14 13:59:05,617 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-11-14 13:59:06,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-11-14 13:59:06,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 13:59:06,821 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-11-14 13:59:06,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2024-11-14 13:59:06,971 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-14 13:59:06,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-11-14 13:59:06,971 WARN L596 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 346 with TraceHistMax 18,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2024-11-14 13:59:06,972 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-14 13:59:06,972 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-14 13:59:06,975 INFO L422 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 13:59:06,978 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 13:59:06,978 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 13:59:06,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 01:59:06 BasicIcfg [2024-11-14 13:59:06,981 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 13:59:06,981 INFO L158 Benchmark]: Toolchain (without parser) took 824587.14ms. Allocated memory was 100.7MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 73.0MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2024-11-14 13:59:06,981 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 100.7MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 13:59:06,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.69ms. Allocated memory is still 100.7MB. Free memory was 73.0MB in the beginning and 60.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-11-14 13:59:06,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.51ms. Allocated memory is still 100.7MB. Free memory was 60.8MB in the beginning and 59.0MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2024-11-14 13:59:06,982 INFO L158 Benchmark]: Boogie Preprocessor took 34.65ms. Allocated memory is still 100.7MB. Free memory was 59.0MB in the beginning and 57.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 13:59:06,983 INFO L158 Benchmark]: RCFGBuilder took 588.83ms. Allocated memory is still 100.7MB. Free memory was 57.5MB in the beginning and 25.1MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2024-11-14 13:59:06,983 INFO L158 Benchmark]: TraceAbstraction took 823651.25ms. Allocated memory was 100.7MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 24.6MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2024-11-14 13:59:06,984 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.23ms. Allocated memory is still 100.7MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 259.69ms. Allocated memory is still 100.7MB. Free memory was 73.0MB in the beginning and 60.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.51ms. Allocated memory is still 100.7MB. Free memory was 60.8MB in the beginning and 59.0MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.65ms. Allocated memory is still 100.7MB. Free memory was 59.0MB in the beginning and 57.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 588.83ms. Allocated memory is still 100.7MB. Free memory was 57.5MB in the beginning and 25.1MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 823651.25ms. Allocated memory was 100.7MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 24.6MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4282, independent: 3107, independent conditional: 2477, independent unconditional: 630, dependent: 1175, dependent conditional: 1171, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3144, independent: 3107, independent conditional: 2477, independent unconditional: 630, dependent: 37, dependent conditional: 33, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3144, independent: 3107, independent conditional: 2477, independent unconditional: 630, dependent: 37, dependent conditional: 33, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3233, independent: 3107, independent conditional: 2477, independent unconditional: 630, dependent: 126, dependent conditional: 122, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3233, independent: 3107, independent conditional: 0, independent unconditional: 3107, dependent: 126, dependent conditional: 18, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3233, independent: 3107, independent conditional: 0, independent unconditional: 3107, dependent: 126, dependent conditional: 18, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 585, independent: 576, independent conditional: 0, independent unconditional: 576, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 585, independent: 574, independent conditional: 0, independent unconditional: 574, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 364, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 306, dependent conditional: 133, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 5, Protected Queries: 0 ], Cache Queries: [ total: 3233, independent: 2531, independent conditional: 0, independent unconditional: 2531, dependent: 117, dependent conditional: 13, dependent unconditional: 104, unknown: 585, unknown conditional: 5, unknown unconditional: 580] , Statistics on independence cache: Total cache size (in pairs): 585, Positive cache size: 576, Positive conditional cache size: 0, Positive unconditional cache size: 576, Negative cache size: 9, Negative conditional cache size: 5, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2581, Maximal queried relation: 5, Independence queries for same thread: 1138, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 164, Number of trivial persistent sets: 144, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 634, independent: 630, independent conditional: 0, independent unconditional: 630, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4282, independent: 3107, independent conditional: 2477, independent unconditional: 630, dependent: 1175, dependent conditional: 1171, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3144, independent: 3107, independent conditional: 2477, independent unconditional: 630, dependent: 37, dependent conditional: 33, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3144, independent: 3107, independent conditional: 2477, independent unconditional: 630, dependent: 37, dependent conditional: 33, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3233, independent: 3107, independent conditional: 2477, independent unconditional: 630, dependent: 126, dependent conditional: 122, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3233, independent: 3107, independent conditional: 0, independent unconditional: 3107, dependent: 126, dependent conditional: 18, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3233, independent: 3107, independent conditional: 0, independent unconditional: 3107, dependent: 126, dependent conditional: 18, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 585, independent: 576, independent conditional: 0, independent unconditional: 576, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 585, independent: 574, independent conditional: 0, independent unconditional: 574, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 364, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 306, dependent conditional: 133, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 5, Protected Queries: 0 ], Cache Queries: [ total: 3233, independent: 2531, independent conditional: 0, independent unconditional: 2531, dependent: 117, dependent conditional: 13, dependent unconditional: 104, unknown: 585, unknown conditional: 5, unknown unconditional: 580] , Statistics on independence cache: Total cache size (in pairs): 585, Positive cache size: 576, Positive conditional cache size: 0, Positive unconditional cache size: 576, Negative cache size: 9, Negative conditional cache size: 5, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2581, Maximal queried relation: 5, Independence queries for same thread: 1138 - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 346 with TraceHistMax 18,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 346 with TraceHistMax 18,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 346 with TraceHistMax 18,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 176 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 823.4s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 8, EmptinessCheckTime: 370.1s, 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: 399, 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.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 157.8s InterpolantComputationTime, 3507 NumberOfCodeBlocks, 3450 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 4975 ConstructedInterpolants, 220 QuantifiedInterpolants, 123951 SizeOfPredicates, 181 NumberOfNonLiveVariables, 3183 ConjunctsInSsa, 369 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 1801/5215 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, ConComCheckerStatistics: CheckTime: 176.0s, ConditionCalculationTime: 0.1s, CommutingCounterexamples: 0, ConditionCalculations: 204, TraceChecks: 5, UnknownTraceChecks: 0, ImperfectProofs: 5, QuantifiedConditions: 0, FalseConditions: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown !ENTRY org.eclipse.osgi 4 0 2024-11-14 13:59:06.999 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/d82963da8/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:289) at java.base/java.io.FileOutputStream.(FileOutputStream.java:230) at java.base/java.io.FileOutputStream.(FileOutputStream.java:179) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1424) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1230) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2492) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2481) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:190) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:143) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:109) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:439) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:271) at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103) at java.base/java.lang.reflect.Method.invoke(Method.java:580) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:668) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:605) at org.eclipse.equinox.launcher.Main.run(Main.java:1481) at org.eclipse.equinox.launcher.Main.main(Main.java:1454)