/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 213 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 03:16:26,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 03:16:26,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 03:16:26,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 03:16:26,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 03:16:26,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 03:16:26,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 03:16:26,418 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 03:16:26,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 03:16:26,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 03:16:26,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 03:16:26,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 03:16:26,421 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 03:16:26,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 03:16:26,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 03:16:26,422 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 03:16:26,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 03:16:26,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 03:16:26,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 03:16:26,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 03:16:26,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 03:16:26,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 03:16:26,424 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 03:16:26,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 03:16:26,425 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 03:16:26,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 03:16:26,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 03:16:26,426 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 03:16:26,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 03:16:26,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 03:16:26,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 03:16:26,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 03:16:26,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 03:16:26,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 03:16:26,427 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 03:16:26,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 03:16:26,428 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 03:16:26,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 03:16:26,428 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 03:16:26,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 [2024-04-05 03:16:26,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 03:16:26,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 03:16:26,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 03:16:26,690 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 03:16:26,690 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 03:16:26,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c [2024-04-05 03:16:27,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 03:16:28,157 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 03:16:28,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c [2024-04-05 03:16:28,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/17f9c9b98/702baab1e6a94516b7cbbd478695fcf2/FLAG38436e04e [2024-04-05 03:16:28,183 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/17f9c9b98/702baab1e6a94516b7cbbd478695fcf2 [2024-04-05 03:16:28,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 03:16:28,189 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 03:16:28,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 03:16:28,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 03:16:28,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 03:16:28,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 03:16:28" (1/1) ... [2024-04-05 03:16:28,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c080273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:16:28, skipping insertion in model container [2024-04-05 03:16:28,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 03:16:28" (1/1) ... [2024-04-05 03:16:28,226 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 03:16:28,404 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c[2598,2611] [2024-04-05 03:16:28,412 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 03:16:28,421 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 03:16:28,442 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c[2598,2611] [2024-04-05 03:16:28,445 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 03:16:28,459 INFO L206 MainTranslator]: Completed translation [2024-04-05 03:16:28,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:16:28 WrapperNode [2024-04-05 03:16:28,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 03:16:28,460 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 03:16:28,460 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 03:16:28,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 03:16:28,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:16:28" (1/1) ... [2024-04-05 03:16:28,475 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:16:28" (1/1) ... [2024-04-05 03:16:28,503 INFO L138 Inliner]: procedures = 25, calls = 46, calls flagged for inlining = 11, calls inlined = 17, statements flattened = 203 [2024-04-05 03:16:28,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 03:16:28,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 03:16:28,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 03:16:28,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 03:16:28,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:16:28" (1/1) ... [2024-04-05 03:16:28,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:16:28" (1/1) ... [2024-04-05 03:16:28,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:16:28" (1/1) ... [2024-04-05 03:16:28,523 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:16:28" (1/1) ... [2024-04-05 03:16:28,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:16:28" (1/1) ... [2024-04-05 03:16:28,537 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:16:28" (1/1) ... [2024-04-05 03:16:28,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:16:28" (1/1) ... [2024-04-05 03:16:28,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:16:28" (1/1) ... [2024-04-05 03:16:28,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 03:16:28,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 03:16:28,545 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 03:16:28,545 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 03:16:28,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:16:28" (1/1) ... [2024-04-05 03:16:28,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 03:16:28,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 03:16:28,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-04-05 03:16:28,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-04-05 03:16:28,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 03:16:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 03:16:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 03:16:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 03:16:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-05 03:16:28,622 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-05 03:16:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-05 03:16:28,622 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-05 03:16:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-04-05 03:16:28,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-04-05 03:16:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 03:16:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-04-05 03:16:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 03:16:28,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 03:16:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 03:16:28,625 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-05 03:16:28,741 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 03:16:28,743 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 03:16:29,117 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 03:16:29,141 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 03:16:29,141 INFO L309 CfgBuilder]: Removed 7 assume(true) statements. [2024-04-05 03:16:29,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 03:16:29 BoogieIcfgContainer [2024-04-05 03:16:29,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 03:16:29,145 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 03:16:29,145 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 03:16:29,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 03:16:29,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 03:16:28" (1/3) ... [2024-04-05 03:16:29,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7db12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 03:16:29, skipping insertion in model container [2024-04-05 03:16:29,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:16:28" (2/3) ... [2024-04-05 03:16:29,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7db12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 03:16:29, skipping insertion in model container [2024-04-05 03:16:29,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 03:16:29" (3/3) ... [2024-04-05 03:16:29,152 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2024-04-05 03:16:29,161 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 03:16:29,170 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 03:16:29,172 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-05 03:16:29,172 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 03:16:29,248 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-04-05 03:16:29,297 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 03:16:29,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 03:16:29,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 03:16:29,301 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 03:16:29,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-04-05 03:16:29,333 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 03:16:29,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 03:16:29,344 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 03:16:29,350 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4fabf71a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 03:16:29,351 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-04-05 03:16:30,004 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 45 treesize of output 37 [2024-04-05 03:16:30,174 INFO L85 PathProgramCache]: Analyzing trace with hash 831410621, now seen corresponding path program 1 times [2024-04-05 03:16:30,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:30,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-05 03:16:30,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:30,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-05 03:16:30,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 03:16:30,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-05 03:16:31,026 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 45 treesize of output 37 [2024-04-05 03:16:31,126 INFO L85 PathProgramCache]: Analyzing trace with hash 983371190, now seen corresponding path program 1 times [2024-04-05 03:16:31,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:31,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-05 03:16:31,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:31,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-05 03:16:31,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-04-05 03:16:31,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-04-05 03:16:32,690 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 952 treesize of output 904 [2024-04-05 03:16:34,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1124081493, now seen corresponding path program 1 times [2024-04-05 03:16:34,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:34,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 03:16:35,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:35,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 03:16:35,897 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 45 treesize of output 37 [2024-04-05 03:16:38,117 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 1930 treesize of output 1834 [2024-04-05 03:16:40,323 INFO L85 PathProgramCache]: Analyzing trace with hash -646648378, now seen corresponding path program 1 times [2024-04-05 03:16:40,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:40,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 03:16:40,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:40,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 03:16:40,952 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 1930 treesize of output 1834 [2024-04-05 03:16:41,374 INFO L85 PathProgramCache]: Analyzing trace with hash 163588781, now seen corresponding path program 1 times [2024-04-05 03:16:41,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:41,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 03:16:41,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:41,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 03:16:41,926 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 45 treesize of output 37 [2024-04-05 03:16:42,214 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 473 treesize of output 449 [2024-04-05 03:16:42,928 INFO L85 PathProgramCache]: Analyzing trace with hash 756766611, now seen corresponding path program 1 times [2024-04-05 03:16:42,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:42,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 03:16:43,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:43,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:43,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 03:16:43,610 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 952 treesize of output 904 [2024-04-05 03:16:43,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1147845642, now seen corresponding path program 2 times [2024-04-05 03:16:43,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:43,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 03:16:44,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:44,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 03:16:44,347 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 952 treesize of output 904 [2024-04-05 03:16:44,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1603935782, now seen corresponding path program 3 times [2024-04-05 03:16:44,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:44,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 03:16:44,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:44,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 03:16:44,986 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 1930 treesize of output 1834 [2024-04-05 03:16:45,100 INFO L85 PathProgramCache]: Analyzing trace with hash 369972660, now seen corresponding path program 4 times [2024-04-05 03:16:45,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:45,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 03:16:45,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:45,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:45,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 03:16:45,722 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 45 treesize of output 37 [2024-04-05 03:16:45,837 INFO L85 PathProgramCache]: Analyzing trace with hash -646733350, now seen corresponding path program 5 times [2024-04-05 03:16:45,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:45,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 03:16:46,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:46,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:46,348 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 03:16:46,389 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 45 treesize of output 37 [2024-04-05 03:16:46,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1395332613, now seen corresponding path program 6 times [2024-04-05 03:16:46,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:46,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 03:16:46,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:46,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 03:16:47,021 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 45 treesize of output 37 [2024-04-05 03:16:47,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1430675973, now seen corresponding path program 7 times [2024-04-05 03:16:47,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:47,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:47,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 03:16:47,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:47,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:47,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 03:16:47,827 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-04-05 03:16:47,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 03:16:47,829 INFO L85 PathProgramCache]: Analyzing trace with hash -566126889, now seen corresponding path program 1 times [2024-04-05 03:16:47,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 03:16:47,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836748669] [2024-04-05 03:16:47,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:47,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-04-05 03:16:48,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 03:16:48,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836748669] [2024-04-05 03:16:48,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836748669] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 03:16:48,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872775188] [2024-04-05 03:16:48,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:48,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 03:16:48,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 03:16:48,330 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 03:16:48,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-04-05 03:16:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:48,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 10 conjunts are in the unsatisfiable core [2024-04-05 03:16:48,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 03:16:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-04-05 03:16:49,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 03:16:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-04-05 03:16:49,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872775188] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 03:16:49,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 03:16:49,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2024-04-05 03:16:49,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077572397] [2024-04-05 03:16:49,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 03:16:49,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-04-05 03:16:49,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 03:16:49,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-04-05 03:16:49,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2024-04-05 03:16:49,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 03:16:49,566 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 03:16:49,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 14.96) internal successors, (374), 25 states have internal predecessors, (374), 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-04-05 03:16:49,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 03:16:50,288 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 952 treesize of output 904 [2024-04-05 03:16:50,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1807285896, now seen corresponding path program 2 times [2024-04-05 03:16:50,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:50,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:51,025 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 03:16:51,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:51,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:51,279 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 03:16:51,416 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 473 treesize of output 449 [2024-04-05 03:16:51,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1946346761, now seen corresponding path program 2 times [2024-04-05 03:16:51,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:51,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 03:16:52,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:52,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:52,536 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 03:16:52,574 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 45 treesize of output 37 [2024-04-05 03:16:52,723 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 473 treesize of output 449 [2024-04-05 03:16:53,010 INFO L85 PathProgramCache]: Analyzing trace with hash 899011016, now seen corresponding path program 2 times [2024-04-05 03:16:53,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:53,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 03:16:53,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:53,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 03:16:53,612 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 473 treesize of output 449 [2024-04-05 03:16:56,027 INFO L85 PathProgramCache]: Analyzing trace with hash 80205475, now seen corresponding path program 8 times [2024-04-05 03:16:56,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:56,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 03:16:56,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:16:56,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:16:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:16:56,766 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 03:16:56,886 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 972 treesize of output 924 [2024-04-05 03:17:00,286 INFO L85 PathProgramCache]: Analyzing trace with hash 37133899, now seen corresponding path program 9 times [2024-04-05 03:17:00,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:00,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:00,523 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-04-05 03:17:00,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:00,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-04-05 03:17:00,830 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 952 treesize of output 904 [2024-04-05 03:17:01,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1009092135, now seen corresponding path program 10 times [2024-04-05 03:17:01,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:01,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 03:17:01,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:01,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 03:17:01,590 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 45 treesize of output 37 [2024-04-05 03:17:03,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1869782720, now seen corresponding path program 11 times [2024-04-05 03:17:03,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:03,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-04-05 03:17:03,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:03,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:04,233 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-04-05 03:17:04,325 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 45 treesize of output 37 [2024-04-05 03:17:06,389 INFO L85 PathProgramCache]: Analyzing trace with hash 698817469, now seen corresponding path program 12 times [2024-04-05 03:17:06,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:06,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 03:17:06,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:06,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:06,927 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 03:17:07,021 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 45 treesize of output 37 [2024-04-05 03:17:07,096 INFO L85 PathProgramCache]: Analyzing trace with hash 2079220960, now seen corresponding path program 13 times [2024-04-05 03:17:07,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:07,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-04-05 03:17:07,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:07,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:07,564 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-04-05 03:17:07,594 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 45 treesize of output 37 [2024-04-05 03:17:07,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1583723583, now seen corresponding path program 14 times [2024-04-05 03:17:07,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:07,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 03:17:07,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:07,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 03:17:08,290 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 45 treesize of output 37 [2024-04-05 03:17:10,353 INFO L85 PathProgramCache]: Analyzing trace with hash -2009717331, now seen corresponding path program 15 times [2024-04-05 03:17:10,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:10,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:11,566 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-04-05 03:17:11,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:11,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-04-05 03:17:12,107 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 45 treesize of output 37 [2024-04-05 03:17:12,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1104763953, now seen corresponding path program 16 times [2024-04-05 03:17:12,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:12,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:13,189 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-04-05 03:17:13,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:13,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-04-05 03:17:13,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 03:17:13,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-04-05 03:17:14,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable29,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable24,SelfDestructingSolverStorable46,SelfDestructingSolverStorable25,SelfDestructingSolverStorable47,SelfDestructingSolverStorable26,SelfDestructingSolverStorable48,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-04-05 03:17:14,046 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-04-05 03:17:14,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 03:17:14,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1964987494, now seen corresponding path program 2 times [2024-04-05 03:17:14,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 03:17:14,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695224228] [2024-04-05 03:17:14,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:14,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 174 proven. 220 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-04-05 03:17:15,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 03:17:15,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695224228] [2024-04-05 03:17:15,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695224228] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 03:17:15,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041592515] [2024-04-05 03:17:15,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-05 03:17:15,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 03:17:15,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 03:17:15,517 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 03:17:15,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-04-05 03:17:15,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-05 03:17:15,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 03:17:15,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 14 conjunts are in the unsatisfiable core [2024-04-05 03:17:15,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 03:17:16,631 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 129 proven. 19 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-04-05 03:17:16,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 03:17:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 139 proven. 9 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-04-05 03:17:17,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041592515] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 03:17:17,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 03:17:17,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 15, 15] total 63 [2024-04-05 03:17:17,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105914577] [2024-04-05 03:17:17,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 03:17:17,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-04-05 03:17:17,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 03:17:17,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-04-05 03:17:17,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=3590, Unknown=0, NotChecked=0, Total=3906 [2024-04-05 03:17:17,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 03:17:17,428 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 03:17:17,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 8.777777777777779) internal successors, (553), 63 states have internal predecessors, (553), 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-04-05 03:17:17,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-05 03:17:17,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 03:17:19,049 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 473 treesize of output 449 [2024-04-05 03:17:21,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1339551955, now seen corresponding path program 1 times [2024-04-05 03:17:21,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:21,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:17:21,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 03:17:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:17:21,553 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 952 treesize of output 904 [2024-04-05 03:17:24,778 INFO L85 PathProgramCache]: Analyzing trace with hash 127751372, now seen corresponding path program 1 times [2024-04-05 03:17:24,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:24,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:17:24,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 03:17:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:17:24,998 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 45 treesize of output 37 [2024-04-05 03:17:25,118 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 45 treesize of output 37 [2024-04-05 03:17:25,220 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 45 treesize of output 37 [2024-04-05 03:17:25,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1373235806, now seen corresponding path program 1 times [2024-04-05 03:17:25,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:25,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:17:25,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 03:17:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:17:25,664 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 45 treesize of output 37 [2024-04-05 03:17:25,746 INFO L85 PathProgramCache]: Analyzing trace with hash 49214991, now seen corresponding path program 17 times [2024-04-05 03:17:25,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:25,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-04-05 03:17:26,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:26,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-04-05 03:17:26,758 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 45 treesize of output 37 [2024-04-05 03:17:26,843 INFO L85 PathProgramCache]: Analyzing trace with hash -841980054, now seen corresponding path program 18 times [2024-04-05 03:17:26,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:26,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-04-05 03:17:27,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:27,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-04-05 03:17:27,693 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 1930 treesize of output 1834 [2024-04-05 03:17:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash -762169165, now seen corresponding path program 19 times [2024-04-05 03:17:28,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:28,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:28,962 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-04-05 03:17:28,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:28,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:29,241 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-04-05 03:17:29,285 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 45 treesize of output 37 [2024-04-05 03:17:29,594 INFO L85 PathProgramCache]: Analyzing trace with hash 817536841, now seen corresponding path program 20 times [2024-04-05 03:17:29,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:29,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-04-05 03:17:29,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:29,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-04-05 03:17:30,229 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 952 treesize of output 904 [2024-04-05 03:17:30,727 INFO L85 PathProgramCache]: Analyzing trace with hash -426160984, now seen corresponding path program 21 times [2024-04-05 03:17:30,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:30,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-04-05 03:17:31,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:31,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:31,261 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-04-05 03:17:31,297 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 952 treesize of output 904 [2024-04-05 03:17:31,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1320049556, now seen corresponding path program 22 times [2024-04-05 03:17:31,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:31,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-04-05 03:17:31,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:31,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-04-05 03:17:32,494 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 45 treesize of output 37 [2024-04-05 03:17:32,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1114723396, now seen corresponding path program 23 times [2024-04-05 03:17:32,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:32,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-04-05 03:17:33,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:33,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:33,351 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-04-05 03:17:33,401 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 45 treesize of output 37 [2024-04-05 03:17:33,479 INFO L85 PathProgramCache]: Analyzing trace with hash 244925411, now seen corresponding path program 24 times [2024-04-05 03:17:33,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:33,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:33,742 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-04-05 03:17:33,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:33,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-04-05 03:17:34,061 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 473 treesize of output 449 [2024-04-05 03:17:34,137 INFO L85 PathProgramCache]: Analyzing trace with hash -997246100, now seen corresponding path program 25 times [2024-04-05 03:17:34,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:34,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:34,646 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-04-05 03:17:34,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:34,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-04-05 03:17:34,990 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 45 treesize of output 37 [2024-04-05 03:17:37,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 03:17:37,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 03:17:37,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-04-05 03:17:37,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable60,SelfDestructingSolverStorable50,SelfDestructingSolverStorable61,SelfDestructingSolverStorable51,SelfDestructingSolverStorable62,SelfDestructingSolverStorable52,SelfDestructingSolverStorable63,SelfDestructingSolverStorable53,SelfDestructingSolverStorable64,SelfDestructingSolverStorable54,SelfDestructingSolverStorable65,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55,SelfDestructingSolverStorable66,SelfDestructingSolverStorable56,SelfDestructingSolverStorable67,SelfDestructingSolverStorable57,SelfDestructingSolverStorable68,SelfDestructingSolverStorable58,SelfDestructingSolverStorable69,SelfDestructingSolverStorable59,SelfDestructingSolverStorable49 [2024-04-05 03:17:37,307 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-04-05 03:17:37,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 03:17:37,307 INFO L85 PathProgramCache]: Analyzing trace with hash 840432055, now seen corresponding path program 3 times [2024-04-05 03:17:37,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 03:17:37,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443467662] [2024-04-05 03:17:37,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:37,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 174 proven. 235 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-04-05 03:17:39,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 03:17:39,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443467662] [2024-04-05 03:17:39,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443467662] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 03:17:39,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079165278] [2024-04-05 03:17:39,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-05 03:17:39,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 03:17:39,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 03:17:39,168 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 03:17:39,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-04-05 03:17:41,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-04-05 03:17:41,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 03:17:41,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 49 conjunts are in the unsatisfiable core [2024-04-05 03:17:41,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 03:17:43,106 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 322 proven. 56 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-04-05 03:17:43,106 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 03:17:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 262 proven. 116 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-04-05 03:17:44,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079165278] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 03:17:44,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 03:17:44,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 37, 28] total 101 [2024-04-05 03:17:44,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563249950] [2024-04-05 03:17:44,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 03:17:44,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2024-04-05 03:17:44,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 03:17:44,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2024-04-05 03:17:44,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=767, Invalid=9333, Unknown=0, NotChecked=0, Total=10100 [2024-04-05 03:17:44,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 03:17:44,548 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 03:17:44,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 8.96039603960396) internal successors, (905), 101 states have internal predecessors, (905), 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-04-05 03:17:44,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-05 03:17:44,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 03:17:44,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 03:17:47,123 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 473 treesize of output 449 [2024-04-05 03:17:48,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1920935034, now seen corresponding path program 3 times [2024-04-05 03:17:48,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:48,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:17:48,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 03:17:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:17:48,774 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 45 treesize of output 37 [2024-04-05 03:17:49,094 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 45 treesize of output 37 [2024-04-05 03:17:49,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1757350782, now seen corresponding path program 2 times [2024-04-05 03:17:49,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:49,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:17:49,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 03:17:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:17:49,513 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 45 treesize of output 37 [2024-04-05 03:17:49,639 INFO L85 PathProgramCache]: Analyzing trace with hash -957023744, now seen corresponding path program 26 times [2024-04-05 03:17:49,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:49,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:17:49,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 03:17:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:17:49,858 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 952 treesize of output 904 [2024-04-05 03:17:50,015 INFO L85 PathProgramCache]: Analyzing trace with hash 397035744, now seen corresponding path program 27 times [2024-04-05 03:17:50,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:50,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-04-05 03:17:50,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:50,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:17:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-04-05 03:17:50,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 03:17:50,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=6994, Unknown=0, NotChecked=0, Total=7310 [2024-04-05 03:17:52,372 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 1930 treesize of output 1834 [2024-04-05 03:17:55,180 INFO L85 PathProgramCache]: Analyzing trace with hash -18073585, now seen corresponding path program 28 times [2024-04-05 03:17:55,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:55,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:17:55,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 03:17:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:17:55,504 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 45 treesize of output 37 [2024-04-05 03:17:56,913 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 473 treesize of output 449 [2024-04-05 03:17:59,463 INFO L85 PathProgramCache]: Analyzing trace with hash 109001647, now seen corresponding path program 29 times [2024-04-05 03:17:59,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:17:59,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:17:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:17:59,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 03:17:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:17:59,806 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 45 treesize of output 37 [2024-04-05 03:18:02,024 INFO L85 PathProgramCache]: Analyzing trace with hash -229527747, now seen corresponding path program 30 times [2024-04-05 03:18:02,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:02,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:02,830 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-04-05 03:18:02,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:02,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-04-05 03:18:03,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-04-05 03:18:03,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=11308, Unknown=0, NotChecked=0, Total=11772 [2024-04-05 03:18:04,563 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 900 treesize of output 852 [2024-04-05 03:18:05,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1875109232, now seen corresponding path program 31 times [2024-04-05 03:18:05,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:05,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:18:05,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 03:18:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:18:05,382 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 39 treesize of output 33 [2024-04-05 03:18:05,674 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 39 treesize of output 33 [2024-04-05 03:18:06,201 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 27 treesize of output 21 [2024-04-05 03:18:06,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1083964093, now seen corresponding path program 32 times [2024-04-05 03:18:06,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:06,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-04-05 03:18:06,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:06,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:06,670 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-04-05 03:18:06,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-05 03:18:06,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=13960, Unknown=0, NotChecked=0, Total=14520 [2024-04-05 03:18:07,112 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 27 treesize of output 21 [2024-04-05 03:18:07,721 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 27 treesize of output 21 [2024-04-05 03:18:08,211 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 39 treesize of output 33 [2024-04-05 03:18:08,459 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 928 treesize of output 880 [2024-04-05 03:18:08,831 INFO L85 PathProgramCache]: Analyzing trace with hash 109001647, now seen corresponding path program 33 times [2024-04-05 03:18:08,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:08,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:18:08,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 03:18:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:18:09,093 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 1818 treesize of output 1722 [2024-04-05 03:18:09,509 INFO L85 PathProgramCache]: Analyzing trace with hash -662719536, now seen corresponding path program 34 times [2024-04-05 03:18:09,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:09,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:18:09,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 03:18:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:18:09,773 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 1818 treesize of output 1722 [2024-04-05 03:18:10,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1660765762, now seen corresponding path program 35 times [2024-04-05 03:18:10,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:10,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:18:10,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 03:18:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 03:18:10,891 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 39 treesize of output 33 [2024-04-05 03:18:11,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1769695672, now seen corresponding path program 36 times [2024-04-05 03:18:11,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:11,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 11 proven. 100 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-04-05 03:18:12,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:12,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 11 proven. 100 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-04-05 03:18:12,862 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 1818 treesize of output 1722 [2024-04-05 03:18:13,162 INFO L85 PathProgramCache]: Analyzing trace with hash -243362288, now seen corresponding path program 37 times [2024-04-05 03:18:13,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:13,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 12 proven. 100 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-04-05 03:18:14,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:14,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 12 proven. 100 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-04-05 03:18:14,606 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 437 treesize of output 413 [2024-04-05 03:18:15,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2135572737, now seen corresponding path program 38 times [2024-04-05 03:18:15,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:15,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:15,537 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 11 proven. 100 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-04-05 03:18:15,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:15,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:15,913 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 11 proven. 100 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-04-05 03:18:15,994 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 1818 treesize of output 1722 [2024-04-05 03:18:16,458 INFO L85 PathProgramCache]: Analyzing trace with hash -346778429, now seen corresponding path program 39 times [2024-04-05 03:18:16,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:16,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 11 proven. 100 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-04-05 03:18:16,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:16,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 11 proven. 100 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-04-05 03:18:17,317 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 39 treesize of output 33 [2024-04-05 03:18:17,502 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 27 treesize of output 21 [2024-04-05 03:18:17,819 INFO L85 PathProgramCache]: Analyzing trace with hash 963254243, now seen corresponding path program 40 times [2024-04-05 03:18:17,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:17,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:18,191 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 2 proven. 109 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-04-05 03:18:18,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:18,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:18,613 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 2 proven. 109 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-04-05 03:18:18,709 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 437 treesize of output 413 [2024-04-05 03:18:18,972 INFO L85 PathProgramCache]: Analyzing trace with hash -203888818, now seen corresponding path program 41 times [2024-04-05 03:18:18,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:18,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 2 proven. 109 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-04-05 03:18:19,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:19,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:19,883 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 2 proven. 109 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-04-05 03:18:20,144 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 928 treesize of output 880 [2024-04-05 03:18:20,471 INFO L85 PathProgramCache]: Analyzing trace with hash -514411924, now seen corresponding path program 42 times [2024-04-05 03:18:20,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:20,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 11 proven. 100 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-04-05 03:18:21,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:21,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 11 proven. 100 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-04-05 03:18:21,470 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 437 treesize of output 413 [2024-04-05 03:18:21,935 INFO L85 PathProgramCache]: Analyzing trace with hash 831714219, now seen corresponding path program 43 times [2024-04-05 03:18:21,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:21,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 2 proven. 109 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-04-05 03:18:22,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:22,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 2 proven. 109 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-04-05 03:18:23,042 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 27 treesize of output 21 [2024-04-05 03:18:23,567 INFO L85 PathProgramCache]: Analyzing trace with hash -193207838, now seen corresponding path program 44 times [2024-04-05 03:18:23,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:23,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 2 proven. 109 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-04-05 03:18:24,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:24,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:24,462 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 2 proven. 109 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-04-05 03:18:24,562 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 27 treesize of output 21 [2024-04-05 03:18:24,874 INFO L85 PathProgramCache]: Analyzing trace with hash -333771580, now seen corresponding path program 45 times [2024-04-05 03:18:24,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:24,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:26,077 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-04-05 03:18:26,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:26,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:26,382 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-04-05 03:18:26,463 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 900 treesize of output 852 [2024-04-05 03:18:26,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1210467772, now seen corresponding path program 46 times [2024-04-05 03:18:26,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:26,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 12 proven. 99 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-04-05 03:18:27,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:27,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:27,854 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 12 proven. 99 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-04-05 03:18:27,954 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 27 treesize of output 21 [2024-04-05 03:18:28,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1682010143, now seen corresponding path program 47 times [2024-04-05 03:18:28,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:28,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:28,696 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 2 proven. 109 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-04-05 03:18:28,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:28,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 2 proven. 109 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-04-05 03:18:29,131 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 900 treesize of output 852 [2024-04-05 03:18:29,338 INFO L85 PathProgramCache]: Analyzing trace with hash -602706160, now seen corresponding path program 48 times [2024-04-05 03:18:29,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:29,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:29,778 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 2 proven. 109 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-04-05 03:18:29,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:29,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:30,310 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 2 proven. 109 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-04-05 03:18:30,414 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 892 treesize of output 844 [2024-04-05 03:18:30,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1793512386, now seen corresponding path program 49 times [2024-04-05 03:18:30,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:30,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 2 proven. 109 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-04-05 03:18:31,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 03:18:31,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 03:18:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 03:18:31,383 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 2 proven. 109 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-04-05 03:18:31,460 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 27 treesize of output 21 [2024-04-05 03:18:32,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-04-05 03:18:32,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable92,SelfDestructingSolverStorable71,SelfDestructingSolverStorable93,SelfDestructingSolverStorable110,SelfDestructingSolverStorable72,SelfDestructingSolverStorable94,SelfDestructingSolverStorable73,SelfDestructingSolverStorable95,SelfDestructingSolverStorable74,SelfDestructingSolverStorable96,SelfDestructingSolverStorable75,SelfDestructingSolverStorable97,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable76,SelfDestructingSolverStorable98,SelfDestructingSolverStorable104,SelfDestructingSolverStorable77,SelfDestructingSolverStorable99,SelfDestructingSolverStorable105,SelfDestructingSolverStorable78,SelfDestructingSolverStorable106,SelfDestructingSolverStorable79,SelfDestructingSolverStorable107,SelfDestructingSolverStorable100,SelfDestructingSolverStorable101,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86,SelfDestructingSolverStorable87,SelfDestructingSolverStorable88,SelfDestructingSolverStorable89,SelfDestructingSolverStorable111,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113,SelfDestructingSolverStorable114 [2024-04-05 03:18:32,961 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@24713bcf at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:156) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:83) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:196) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:169) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:173) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.visitors.DeadEndOptimizingSearchVisitor.discoverState(DeadEndOptimizingSearchVisitor.java:73) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:222) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:329) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:362) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-04-05 03:18:32,965 INFO L158 Benchmark]: Toolchain (without parser) took 124775.84ms. Allocated memory was 164.6MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 91.5MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2024-04-05 03:18:32,965 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 164.6MB. Free memory is still 98.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 03:18:32,966 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.84ms. Allocated memory is still 164.6MB. Free memory was 91.3MB in the beginning and 79.4MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-04-05 03:18:32,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.08ms. Allocated memory is still 164.6MB. Free memory was 79.4MB in the beginning and 77.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 03:18:32,966 INFO L158 Benchmark]: Boogie Preprocessor took 39.81ms. Allocated memory is still 164.6MB. Free memory was 77.1MB in the beginning and 75.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 03:18:32,966 INFO L158 Benchmark]: RCFGBuilder took 598.48ms. Allocated memory was 164.6MB in the beginning and 270.5MB in the end (delta: 105.9MB). Free memory was 75.0MB in the beginning and 224.9MB in the end (delta: -149.9MB). Peak memory consumption was 21.2MB. Max. memory is 8.0GB. [2024-04-05 03:18:32,967 INFO L158 Benchmark]: TraceAbstraction took 123818.96ms. Allocated memory was 270.5MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 223.9MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2024-04-05 03:18:32,968 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.12ms. Allocated memory is still 164.6MB. Free memory is still 98.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 269.84ms. Allocated memory is still 164.6MB. Free memory was 91.3MB in the beginning and 79.4MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.08ms. Allocated memory is still 164.6MB. Free memory was 79.4MB in the beginning and 77.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.81ms. Allocated memory is still 164.6MB. Free memory was 77.1MB in the beginning and 75.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 598.48ms. Allocated memory was 164.6MB in the beginning and 270.5MB in the end (delta: 105.9MB). Free memory was 75.0MB in the beginning and 224.9MB in the end (delta: -149.9MB). Peak memory consumption was 21.2MB. Max. memory is 8.0GB. * TraceAbstraction took 123818.96ms. Allocated memory was 270.5MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 223.9MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@24713bcf de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@24713bcf: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-04-05 03:18:32,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-04-05 03:18:33,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...