/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 FORWARD --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 02:34:27,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 02:34:27,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 02:34:27,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 02:34:27,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 02:34:27,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 02:34:27,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 02:34:27,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 02:34:27,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 02:34:27,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 02:34:27,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 02:34:27,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 02:34:27,685 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 02:34:27,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 02:34:27,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 02:34:27,687 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 02:34:27,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 02:34:27,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 02:34:27,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 02:34:27,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 02:34:27,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 02:34:27,688 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 02:34:27,689 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 02:34:27,689 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 02:34:27,689 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 02:34:27,689 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 02:34:27,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 02:34:27,690 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 02:34:27,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 02:34:27,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 02:34:27,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 02:34:27,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 02:34:27,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 02:34:27,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 02:34:27,691 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 02:34:27,692 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 02:34:27,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 02:34:27,692 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 02:34:27,692 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 02:34:27,692 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 -> FORWARD Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-07 02:34:27,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 02:34:27,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 02:34:27,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 02:34:27,908 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 02:34:27,908 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 02:34:27,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c [2024-05-07 02:34:28,978 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 02:34:29,127 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 02:34:29,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c [2024-05-07 02:34:29,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/066793833/cc33bc18e30640468cbe11af6b933bd6/FLAG7a4553ed1 [2024-05-07 02:34:29,144 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/066793833/cc33bc18e30640468cbe11af6b933bd6 [2024-05-07 02:34:29,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 02:34:29,147 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 02:34:29,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 02:34:29,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 02:34:29,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 02:34:29,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 02:34:29" (1/1) ... [2024-05-07 02:34:29,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75138d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:34:29, skipping insertion in model container [2024-05-07 02:34:29,155 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 02:34:29" (1/1) ... [2024-05-07 02:34:29,190 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 02:34:29,381 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-bad-ring-nondet.wvr.c[4085,4098] [2024-05-07 02:34:29,387 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 02:34:29,403 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 02:34:29,425 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-bad-ring-nondet.wvr.c[4085,4098] [2024-05-07 02:34:29,434 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 02:34:29,443 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 02:34:29,443 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 02:34:29,450 INFO L206 MainTranslator]: Completed translation [2024-05-07 02:34:29,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:34:29 WrapperNode [2024-05-07 02:34:29,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 02:34:29,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 02:34:29,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 02:34:29,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 02:34:29,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:34:29" (1/1) ... [2024-05-07 02:34:29,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:34:29" (1/1) ... [2024-05-07 02:34:29,495 INFO L138 Inliner]: procedures = 25, calls = 63, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 330 [2024-05-07 02:34:29,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 02:34:29,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 02:34:29,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 02:34:29,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 02:34:29,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:34:29" (1/1) ... [2024-05-07 02:34:29,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:34:29" (1/1) ... [2024-05-07 02:34:29,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:34:29" (1/1) ... [2024-05-07 02:34:29,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:34:29" (1/1) ... [2024-05-07 02:34:29,521 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:34:29" (1/1) ... [2024-05-07 02:34:29,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:34:29" (1/1) ... [2024-05-07 02:34:29,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:34:29" (1/1) ... [2024-05-07 02:34:29,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:34:29" (1/1) ... [2024-05-07 02:34:29,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 02:34:29,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 02:34:29,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 02:34:29,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 02:34:29,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:34:29" (1/1) ... [2024-05-07 02:34:29,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 02:34:29,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 02:34:29,584 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-07 02:34:29,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-05-07 02:34:29,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 02:34:29,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 02:34:29,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 02:34:29,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-07 02:34:29,621 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-07 02:34:29,621 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-07 02:34:29,621 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-07 02:34:29,621 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-07 02:34:29,621 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-07 02:34:29,621 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-07 02:34:29,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 02:34:29,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-07 02:34:29,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-07 02:34:29,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-07 02:34:29,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 02:34:29,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 02:34:29,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 02:34:29,623 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 02:34:29,711 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 02:34:29,713 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 02:34:30,086 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 02:34:30,210 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 02:34:30,211 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2024-05-07 02:34:30,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 02:34:30 BoogieIcfgContainer [2024-05-07 02:34:30,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 02:34:30,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 02:34:30,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 02:34:30,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 02:34:30,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 02:34:29" (1/3) ... [2024-05-07 02:34:30,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49fbf441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 02:34:30, skipping insertion in model container [2024-05-07 02:34:30,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 02:34:29" (2/3) ... [2024-05-07 02:34:30,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49fbf441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 02:34:30, skipping insertion in model container [2024-05-07 02:34:30,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 02:34:30" (3/3) ... [2024-05-07 02:34:30,218 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring-nondet.wvr.c [2024-05-07 02:34:30,224 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 02:34:30,231 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 02:34:30,231 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-07 02:34:30,231 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 02:34:30,315 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-07 02:34:30,363 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 02:34:30,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 02:34:30,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 02:34:30,377 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-07 02:34:30,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-07 02:34:30,416 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 02:34:30,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 02:34:30,432 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 02:34:30,438 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;@5d317b72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 02:34:30,438 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-07 02:34:30,580 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-05-07 02:34:30,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 02:34:30,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1052777447, now seen corresponding path program 1 times [2024-05-07 02:34:30,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 02:34:30,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044803015] [2024-05-07 02:34:30,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:30,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 02:34:30,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 02:34:30,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044803015] [2024-05-07 02:34:30,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044803015] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 02:34:30,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 02:34:30,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 02:34:30,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469184231] [2024-05-07 02:34:30,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 02:34:30,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 02:34:30,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 02:34:30,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 02:34:30,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 02:34:30,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:30,958 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 02:34:30,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 02:34:30,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:31,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:31,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 02:34:31,124 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-05-07 02:34:31,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 02:34:31,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1356684668, now seen corresponding path program 1 times [2024-05-07 02:34:31,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 02:34:31,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419778446] [2024-05-07 02:34:31,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:31,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 02:34:31,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 02:34:31,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419778446] [2024-05-07 02:34:31,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419778446] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 02:34:31,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 02:34:31,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-07 02:34:31,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049950201] [2024-05-07 02:34:31,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 02:34:31,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-07 02:34:31,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 02:34:31,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-07 02:34:31,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 02:34:31,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:31,549 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 02:34:31,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 02:34:31,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:31,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:31,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:31,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:31,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-07 02:34:31,702 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-05-07 02:34:31,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 02:34:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash 779113091, now seen corresponding path program 1 times [2024-05-07 02:34:31,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 02:34:31,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694746943] [2024-05-07 02:34:31,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 02:34:32,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 02:34:32,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694746943] [2024-05-07 02:34:32,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694746943] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 02:34:32,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 02:34:32,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-07 02:34:32,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129457338] [2024-05-07 02:34:32,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 02:34:32,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-07 02:34:32,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 02:34:32,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-07 02:34:32,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 02:34:32,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:32,019 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 02:34:32,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 02:34:32,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:32,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:32,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:32,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:32,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:32,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:32,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-07 02:34:32,131 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 02:34:32,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 02:34:32,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1427258088, now seen corresponding path program 1 times [2024-05-07 02:34:32,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 02:34:32,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438431341] [2024-05-07 02:34:32,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:32,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:34:32,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 02:34:32,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438431341] [2024-05-07 02:34:32,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438431341] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 02:34:32,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 02:34:32,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-07 02:34:32,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979699786] [2024-05-07 02:34:32,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 02:34:32,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-07 02:34:32,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 02:34:32,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-07 02:34:32,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 02:34:32,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:32,463 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 02:34:32,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 02:34:32,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:32,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:32,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:32,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:32,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:32,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:32,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:32,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:32,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-07 02:34:32,577 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 02:34:32,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 02:34:32,577 INFO L85 PathProgramCache]: Analyzing trace with hash 580442716, now seen corresponding path program 1 times [2024-05-07 02:34:32,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 02:34:32,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915393735] [2024-05-07 02:34:32,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:32,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:34:33,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 02:34:33,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915393735] [2024-05-07 02:34:33,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915393735] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 02:34:33,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491514519] [2024-05-07 02:34:33,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:33,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 02:34:33,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 02:34:33,154 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 02:34:33,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-07 02:34:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:33,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 7 conjunts are in the unsatisfiable core [2024-05-07 02:34:33,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 02:34:33,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 02:34:33,430 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-07 02:34:33,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491514519] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 02:34:33,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-07 02:34:33,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-05-07 02:34:33,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405885563] [2024-05-07 02:34:33,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 02:34:33,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-07 02:34:33,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 02:34:33,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 02:34:33,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-05-07 02:34:33,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:33,433 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 02:34:33,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 02:34:33,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:33,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:33,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:33,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:33,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:33,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:33,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:33,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:33,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:33,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 02:34:33,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-07 02:34:33,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 02:34:33,746 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 02:34:33,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 02:34:33,746 INFO L85 PathProgramCache]: Analyzing trace with hash 656252945, now seen corresponding path program 1 times [2024-05-07 02:34:33,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 02:34:33,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179043260] [2024-05-07 02:34:33,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:33,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 02:34:33,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 02:34:33,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179043260] [2024-05-07 02:34:33,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179043260] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 02:34:33,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 02:34:33,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-07 02:34:33,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465566274] [2024-05-07 02:34:33,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 02:34:33,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-07 02:34:33,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 02:34:33,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-07 02:34:33,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-07 02:34:33,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:33,830 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 02:34:33,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 02:34:33,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:33,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:33,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:33,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:33,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 02:34:33,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:33,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:33,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:33,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:33,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:33,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 02:34:33,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-07 02:34:33,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-07 02:34:33,883 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-07 02:34:33,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 02:34:33,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2040960026, now seen corresponding path program 2 times [2024-05-07 02:34:33,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 02:34:33,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182048557] [2024-05-07 02:34:33,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:33,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-07 02:34:34,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 02:34:34,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182048557] [2024-05-07 02:34:34,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182048557] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 02:34:34,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363603641] [2024-05-07 02:34:34,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-07 02:34:34,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 02:34:34,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 02:34:34,002 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-07 02:34:34,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-07 02:34:34,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-07 02:34:34,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-07 02:34:34,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 13 conjunts are in the unsatisfiable core [2024-05-07 02:34:34,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 02:34:34,646 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-07 02:34:34,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 02:34:34,670 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 12 treesize of output 4 [2024-05-07 02:34:35,282 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-05-07 02:34:35,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363603641] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 02:34:35,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 02:34:35,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 12] total 25 [2024-05-07 02:34:35,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143090731] [2024-05-07 02:34:35,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 02:34:35,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-05-07 02:34:35,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 02:34:35,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-05-07 02:34:35,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2024-05-07 02:34:35,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:35,285 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 02:34:35,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 26.6) internal successors, (665), 25 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-07 02:34:35,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:35,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:35,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:35,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-07 02:34:35,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 02:34:35,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-07 02:34:35,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 02:34:35,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 02:34:35,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2024-05-07 02:34:36,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2051231569, now seen corresponding path program 1 times [2024-05-07 02:34:36,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:36,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-05-07 02:34:36,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:36,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:36,387 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-05-07 02:34:36,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-07 02:34:36,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-05-07 02:34:36,652 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 14 treesize of output 6 [2024-05-07 02:34:36,729 INFO L85 PathProgramCache]: Analyzing trace with hash 999439360, now seen corresponding path program 1 times [2024-05-07 02:34:36,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:36,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:38,015 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:34:38,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:38,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:34:39,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 02:34:39,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2024-05-07 02:34:39,410 INFO L85 PathProgramCache]: Analyzing trace with hash 335918517, now seen corresponding path program 1 times [2024-05-07 02:34:39,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:39,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-07 02:34:39,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:39,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-07 02:34:39,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 02:34:39,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1166, Unknown=0, NotChecked=0, Total=1260 [2024-05-07 02:34:40,028 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 14 treesize of output 6 [2024-05-07 02:34:40,416 INFO L85 PathProgramCache]: Analyzing trace with hash 999439360, now seen corresponding path program 2 times [2024-05-07 02:34:40,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:40,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:34:42,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:42,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:43,218 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:34:43,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 02:34:43,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2024-05-07 02:34:43,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1489945393, now seen corresponding path program 1 times [2024-05-07 02:34:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:43,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:44,937 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 02:34:44,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:44,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 02:34:46,546 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 14 treesize of output 6 [2024-05-07 02:34:46,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1484308428, now seen corresponding path program 1 times [2024-05-07 02:34:46,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:46,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:47,750 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:34:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:47,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:34:48,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 02:34:48,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2024-05-07 02:34:49,188 INFO L85 PathProgramCache]: Analyzing trace with hash 455947133, now seen corresponding path program 1 times [2024-05-07 02:34:49,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:49,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:50,027 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 02:34:50,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:50,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 02:34:51,349 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 14 treesize of output 6 [2024-05-07 02:34:51,680 INFO L85 PathProgramCache]: Analyzing trace with hash -468728958, now seen corresponding path program 1 times [2024-05-07 02:34:51,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:51,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:52,738 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:34:52,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:52,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:34:53,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 02:34:53,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2024-05-07 02:34:54,091 INFO L85 PathProgramCache]: Analyzing trace with hash -882573585, now seen corresponding path program 1 times [2024-05-07 02:34:54,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:54,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 02:34:55,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:55,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 02:34:56,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1938627129, now seen corresponding path program 1 times [2024-05-07 02:34:56,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:56,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-05-07 02:34:56,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:56,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-05-07 02:34:56,777 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 12 treesize of output 4 [2024-05-07 02:34:58,847 INFO L85 PathProgramCache]: Analyzing trace with hash -783504716, now seen corresponding path program 1 times [2024-05-07 02:34:58,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:58,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:59,046 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-05-07 02:34:59,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:59,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:59,153 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-05-07 02:34:59,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1822405154, now seen corresponding path program 2 times [2024-05-07 02:34:59,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:59,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:34:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-05-07 02:34:59,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:34:59,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:34:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-05-07 02:35:00,293 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 12 treesize of output 4 [2024-05-07 02:35:00,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1785464138, now seen corresponding path program 2 times [2024-05-07 02:35:00,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:00,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-05-07 02:35:01,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:01,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-05-07 02:35:01,655 INFO L85 PathProgramCache]: Analyzing trace with hash -2025649588, now seen corresponding path program 3 times [2024-05-07 02:35:01,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:01,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 46 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 02:35:02,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:02,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:02,561 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 46 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 02:35:02,677 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 12 treesize of output 4 [2024-05-07 02:35:04,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1835442751, now seen corresponding path program 3 times [2024-05-07 02:35:04,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:04,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-05-07 02:35:04,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:04,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:04,975 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-05-07 02:35:05,252 INFO L85 PathProgramCache]: Analyzing trace with hash -842653905, now seen corresponding path program 4 times [2024-05-07 02:35:05,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:05,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-07 02:35:05,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:05,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:05,662 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-07 02:35:05,780 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 12 treesize of output 4 [2024-05-07 02:35:06,643 INFO L85 PathProgramCache]: Analyzing trace with hash -438833513, now seen corresponding path program 4 times [2024-05-07 02:35:06,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:06,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:06,817 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-07 02:35:06,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:06,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-07 02:35:07,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1824134881, now seen corresponding path program 5 times [2024-05-07 02:35:07,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:07,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-07 02:35:07,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:07,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-07 02:35:07,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 12 treesize of output 4 [2024-05-07 02:35:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1419880974, now seen corresponding path program 5 times [2024-05-07 02:35:09,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:09,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-07 02:35:09,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:09,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-07 02:35:10,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1518511484, now seen corresponding path program 6 times [2024-05-07 02:35:10,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:10,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:13,541 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 02:35:13,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:13,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:16,362 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 02:35:16,468 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 12 treesize of output 4 [2024-05-07 02:35:16,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1001160996, now seen corresponding path program 6 times [2024-05-07 02:35:16,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:16,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 02:35:19,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:19,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 02:35:22,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2127920047, now seen corresponding path program 1 times [2024-05-07 02:35:22,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:22,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 64 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 02:35:22,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:22,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 64 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 02:35:23,164 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 12 treesize of output 4 [2024-05-07 02:35:25,214 INFO L85 PathProgramCache]: Analyzing trace with hash 852093340, now seen corresponding path program 1 times [2024-05-07 02:35:25,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:25,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-05-07 02:35:25,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:25,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:25,424 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-05-07 02:35:25,613 INFO L85 PathProgramCache]: Analyzing trace with hash 973586698, now seen corresponding path program 2 times [2024-05-07 02:35:25,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:25,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 02:35:25,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:25,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:26,052 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-07 02:35:26,163 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 12 treesize of output 4 [2024-05-07 02:35:28,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1914300878, now seen corresponding path program 2 times [2024-05-07 02:35:28,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:28,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:28,463 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-07 02:35:28,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:28,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-07 02:35:28,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1500990052, now seen corresponding path program 3 times [2024-05-07 02:35:28,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:28,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-05-07 02:35:28,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:28,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-05-07 02:35:29,153 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 12 treesize of output 4 [2024-05-07 02:35:29,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1091045033, now seen corresponding path program 3 times [2024-05-07 02:35:29,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:29,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-05-07 02:35:29,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:29,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-05-07 02:35:30,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1010014231, now seen corresponding path program 4 times [2024-05-07 02:35:30,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:30,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:30,184 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-05-07 02:35:30,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:30,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-05-07 02:35:30,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 12 treesize of output 4 [2024-05-07 02:35:32,553 INFO L85 PathProgramCache]: Analyzing trace with hash 70510975, now seen corresponding path program 4 times [2024-05-07 02:35:32,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:32,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:32,730 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-05-07 02:35:32,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:32,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-05-07 02:35:33,449 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 14 treesize of output 6 [2024-05-07 02:35:33,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1044256843, now seen corresponding path program 1 times [2024-05-07 02:35:33,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:33,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:33,740 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-05-07 02:35:33,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:33,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:35:33,866 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-05-07 02:35:58,867 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 35 treesize of output 27 [2024-05-07 02:35:59,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1500405191, now seen corresponding path program 1 times [2024-05-07 02:35:59,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:35:59,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:35:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:35:59,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:35:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:36:00,129 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 60 treesize of output 44 [2024-05-07 02:36:02,659 INFO L85 PathProgramCache]: Analyzing trace with hash 732080276, now seen corresponding path program 1 times [2024-05-07 02:36:02,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:02,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:02,799 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-05-07 02:36:02,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:02,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:02,839 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-05-07 02:36:02,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 02:36:02,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=968, Invalid=31252, Unknown=0, NotChecked=0, Total=32220 [2024-05-07 02:36:14,179 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 35 treesize of output 27 [2024-05-07 02:36:14,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1219667850, now seen corresponding path program 1 times [2024-05-07 02:36:14,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:14,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:36:14,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:36:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:36:15,097 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 35 treesize of output 27 [2024-05-07 02:36:15,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1864864847, now seen corresponding path program 1 times [2024-05-07 02:36:15,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:15,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:36:15,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:36:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:36:15,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 60 treesize of output 44 [2024-05-07 02:36:17,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1976234468, now seen corresponding path program 1 times [2024-05-07 02:36:17,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:17,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:36:17,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:36:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:36:17,982 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 35 treesize of output 27 [2024-05-07 02:36:18,250 INFO L85 PathProgramCache]: Analyzing trace with hash -202470274, now seen corresponding path program 1 times [2024-05-07 02:36:18,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:18,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:19,668 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:36:19,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:19,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:36:21,319 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 52 treesize of output 36 [2024-05-07 02:36:21,527 INFO L85 PathProgramCache]: Analyzing trace with hash 470403467, now seen corresponding path program 1 times [2024-05-07 02:36:21,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:21,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:36:22,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:22,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:36:23,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 46 treesize of output 30 [2024-05-07 02:36:24,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1978472267, now seen corresponding path program 1 times [2024-05-07 02:36:24,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:24,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:25,560 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-07 02:36:25,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:25,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-07 02:36:26,749 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 35 treesize of output 27 [2024-05-07 02:36:27,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1037010178, now seen corresponding path program 1 times [2024-05-07 02:36:27,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:27,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:36:28,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:28,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:29,327 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:36:29,425 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 52 treesize of output 36 [2024-05-07 02:36:29,510 INFO L85 PathProgramCache]: Analyzing trace with hash -838381809, now seen corresponding path program 1 times [2024-05-07 02:36:29,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:29,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:36:30,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:30,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:31,231 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:36:31,329 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 46 treesize of output 30 [2024-05-07 02:36:31,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1984228025, now seen corresponding path program 1 times [2024-05-07 02:36:31,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:31,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:32,911 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-07 02:36:32,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:32,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:33,957 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-07 02:36:34,024 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 35 treesize of output 27 [2024-05-07 02:36:34,278 INFO L85 PathProgramCache]: Analyzing trace with hash -147995204, now seen corresponding path program 1 times [2024-05-07 02:36:34,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:34,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:36:35,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:35,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:36,382 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:36:36,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 52 treesize of output 36 [2024-05-07 02:36:36,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2030265271, now seen corresponding path program 1 times [2024-05-07 02:36:36,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:36,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:36:37,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:37,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:36:37,696 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 46 treesize of output 30 [2024-05-07 02:36:38,124 INFO L85 PathProgramCache]: Analyzing trace with hash 111760077, now seen corresponding path program 1 times [2024-05-07 02:36:38,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:38,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:38,626 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-07 02:36:38,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:38,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-07 02:36:40,154 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 35 treesize of output 27 [2024-05-07 02:36:41,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1915281452, now seen corresponding path program 1 times [2024-05-07 02:36:41,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:41,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:36:41,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:36:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:36:41,351 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 60 treesize of output 44 [2024-05-07 02:36:43,685 INFO L85 PathProgramCache]: Analyzing trace with hash -755816191, now seen corresponding path program 2 times [2024-05-07 02:36:43,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:43,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-05-07 02:36:43,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:36:43,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:36:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:36:43,898 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-05-07 02:36:43,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 02:36:43,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1511, Invalid=47109, Unknown=0, NotChecked=0, Total=48620 [2024-05-07 02:37:07,295 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 35 treesize of output 27 [2024-05-07 02:37:07,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1219667850, now seen corresponding path program 2 times [2024-05-07 02:37:07,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:07,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:37:07,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:37:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:37:08,995 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 35 treesize of output 27 [2024-05-07 02:37:09,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1864864847, now seen corresponding path program 2 times [2024-05-07 02:37:09,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:09,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:37:09,373 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:37:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:37:09,512 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 60 treesize of output 44 [2024-05-07 02:37:12,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1976234468, now seen corresponding path program 2 times [2024-05-07 02:37:12,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:12,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:37:12,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:37:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:37:12,272 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 35 treesize of output 27 [2024-05-07 02:37:12,624 INFO L85 PathProgramCache]: Analyzing trace with hash -202470274, now seen corresponding path program 2 times [2024-05-07 02:37:12,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:12,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:37:13,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:13,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:37:15,181 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 35 treesize of output 27 [2024-05-07 02:37:15,465 INFO L85 PathProgramCache]: Analyzing trace with hash -255599379, now seen corresponding path program 3 times [2024-05-07 02:37:15,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:15,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:37:16,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:16,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:17,132 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:37:17,235 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 52 treesize of output 36 [2024-05-07 02:37:17,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1198967482, now seen corresponding path program 2 times [2024-05-07 02:37:17,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:17,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:17,872 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:37:17,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:17,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:18,272 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:37:18,369 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 52 treesize of output 36 [2024-05-07 02:37:18,497 INFO L85 PathProgramCache]: Analyzing trace with hash 470403467, now seen corresponding path program 3 times [2024-05-07 02:37:18,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:18,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:37:19,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:19,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:20,951 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:37:21,044 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 52 treesize of output 36 [2024-05-07 02:37:21,157 INFO L85 PathProgramCache]: Analyzing trace with hash 768346906, now seen corresponding path program 4 times [2024-05-07 02:37:21,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:21,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:37:22,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:22,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:24,316 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:37:24,527 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 52 treesize of output 36 [2024-05-07 02:37:24,628 INFO L85 PathProgramCache]: Analyzing trace with hash 682974134, now seen corresponding path program 2 times [2024-05-07 02:37:24,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:24,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:37:25,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:25,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:37:27,090 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 52 treesize of output 36 [2024-05-07 02:37:27,228 INFO L85 PathProgramCache]: Analyzing trace with hash -838381809, now seen corresponding path program 3 times [2024-05-07 02:37:27,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:27,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:27,691 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:37:27,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:27,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:28,277 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:37:28,364 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 52 treesize of output 36 [2024-05-07 02:37:28,472 INFO L85 PathProgramCache]: Analyzing trace with hash -667951338, now seen corresponding path program 4 times [2024-05-07 02:37:28,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:28,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:29,734 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:37:29,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:29,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:30,402 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:37:30,613 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 52 treesize of output 36 [2024-05-07 02:37:30,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1204083900, now seen corresponding path program 2 times [2024-05-07 02:37:30,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:30,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:32,023 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:37:32,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:32,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:37:32,881 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 35 treesize of output 27 [2024-05-07 02:37:33,151 INFO L85 PathProgramCache]: Analyzing trace with hash -522713436, now seen corresponding path program 1 times [2024-05-07 02:37:33,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:33,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:37:33,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:37:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:37:33,320 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 60 treesize of output 44 [2024-05-07 02:37:35,811 INFO L85 PathProgramCache]: Analyzing trace with hash 975753609, now seen corresponding path program 2 times [2024-05-07 02:37:35,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:35,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:37:35,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:37:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:37:36,426 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 35 treesize of output 27 [2024-05-07 02:37:36,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2036340009, now seen corresponding path program 3 times [2024-05-07 02:37:36,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:36,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-05-07 02:37:36,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:36,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-05-07 02:37:37,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 60 treesize of output 44 [2024-05-07 02:37:39,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1297970102, now seen corresponding path program 4 times [2024-05-07 02:37:39,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:39,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-05-07 02:37:39,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:39,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:40,046 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-05-07 02:37:40,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 02:37:40,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 67 [2024-05-07 02:37:47,633 INFO L85 PathProgramCache]: Analyzing trace with hash 829719136, now seen corresponding path program 5 times [2024-05-07 02:37:47,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:47,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:47,925 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 34 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-05-07 02:37:47,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:47,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 34 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-05-07 02:37:48,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 02:37:48,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 67 [2024-05-07 02:37:51,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1836386095, now seen corresponding path program 6 times [2024-05-07 02:37:51,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:51,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:51,709 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 34 proven. 17 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-05-07 02:37:51,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:51,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 34 proven. 17 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-05-07 02:37:52,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 02:37:52,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 67 [2024-05-07 02:37:55,979 INFO L85 PathProgramCache]: Analyzing trace with hash 319439360, now seen corresponding path program 7 times [2024-05-07 02:37:55,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:55,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 34 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-05-07 02:37:56,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:37:56,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:37:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:37:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 34 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-05-07 02:37:56,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 02:37:56,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 67 [2024-05-07 02:38:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1864347283, now seen corresponding path program 1 times [2024-05-07 02:38:01,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:01,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:38:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 34 proven. 17 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-05-07 02:38:02,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:02,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:38:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 34 proven. 17 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-05-07 02:38:02,707 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-07 02:38:02,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 31 [2024-05-07 02:38:03,090 INFO L85 PathProgramCache]: Analyzing trace with hash -478183329, now seen corresponding path program 8 times [2024-05-07 02:38:03,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:03,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:38:03,439 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-05-07 02:38:03,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:03,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:38:03,615 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-05-07 02:38:03,738 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 35 treesize of output 27 [2024-05-07 02:38:04,141 INFO L85 PathProgramCache]: Analyzing trace with hash 847887170, now seen corresponding path program 9 times [2024-05-07 02:38:04,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:04,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:38:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-05-07 02:38:04,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:04,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:38:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-05-07 02:38:04,596 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 35 treesize of output 27 [2024-05-07 02:38:04,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1278115638, now seen corresponding path program 10 times [2024-05-07 02:38:04,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:04,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:38:05,060 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 32 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-05-07 02:38:05,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:05,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:38:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-05-07 02:38:05,493 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 35 treesize of output 27 [2024-05-07 02:38:05,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1054943749, now seen corresponding path program 3 times [2024-05-07 02:38:05,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:05,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:38:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 43 proven. 59 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:38:06,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:06,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:38:06,325 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 43 proven. 59 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:38:06,576 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 35 treesize of output 27 [2024-05-07 02:38:06,924 INFO L85 PathProgramCache]: Analyzing trace with hash 700513704, now seen corresponding path program 1 times [2024-05-07 02:38:06,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:06,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:38:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 31 proven. 59 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:38:07,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:07,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:38:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 31 proven. 59 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-07 02:38:09,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 35 treesize of output 27 [2024-05-07 02:38:10,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1846147322, now seen corresponding path program 1 times [2024-05-07 02:38:10,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:10,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:10,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:10,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 35 treesize of output 27 [2024-05-07 02:38:11,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1174781797, now seen corresponding path program 1 times [2024-05-07 02:38:11,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:11,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:11,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:12,489 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 35 treesize of output 27 [2024-05-07 02:38:13,472 INFO L85 PathProgramCache]: Analyzing trace with hash 576623270, now seen corresponding path program 2 times [2024-05-07 02:38:13,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:13,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:13,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:13,731 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 35 treesize of output 27 [2024-05-07 02:38:14,584 INFO L85 PathProgramCache]: Analyzing trace with hash 479123814, now seen corresponding path program 2 times [2024-05-07 02:38:14,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:14,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:14,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:15,035 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 46 treesize of output 30 [2024-05-07 02:38:15,438 INFO L85 PathProgramCache]: Analyzing trace with hash -634977437, now seen corresponding path program 1 times [2024-05-07 02:38:15,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:15,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:15,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:15,615 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 52 treesize of output 36 [2024-05-07 02:38:15,821 INFO L85 PathProgramCache]: Analyzing trace with hash -197987534, now seen corresponding path program 1 times [2024-05-07 02:38:15,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:15,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:15,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:16,007 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 46 treesize of output 30 [2024-05-07 02:38:16,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1581771836, now seen corresponding path program 2 times [2024-05-07 02:38:16,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:16,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:16,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:16,713 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 52 treesize of output 36 [2024-05-07 02:38:16,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1419952621, now seen corresponding path program 2 times [2024-05-07 02:38:16,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:16,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:16,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:16,987 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 46 treesize of output 30 [2024-05-07 02:38:17,454 INFO L85 PathProgramCache]: Analyzing trace with hash -886113853, now seen corresponding path program 1 times [2024-05-07 02:38:17,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:17,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:17,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:17,608 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 52 treesize of output 36 [2024-05-07 02:38:17,747 INFO L85 PathProgramCache]: Analyzing trace with hash -800204398, now seen corresponding path program 1 times [2024-05-07 02:38:17,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:17,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:17,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:22,872 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 35 treesize of output 27 [2024-05-07 02:38:23,235 INFO L85 PathProgramCache]: Analyzing trace with hash -230850916, now seen corresponding path program 1 times [2024-05-07 02:38:23,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:23,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:38:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 31 proven. 59 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 02:38:23,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:23,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 02:38:23,770 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 31 proven. 59 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-07 02:38:25,329 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 35 treesize of output 27 [2024-05-07 02:38:25,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1938229498, now seen corresponding path program 1 times [2024-05-07 02:38:25,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:25,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:25,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:25,885 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 35 treesize of output 27 [2024-05-07 02:38:26,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1564641777, now seen corresponding path program 1 times [2024-05-07 02:38:26,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:26,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:26,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:26,853 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 35 treesize of output 27 [2024-05-07 02:38:27,242 INFO L85 PathProgramCache]: Analyzing trace with hash -654794958, now seen corresponding path program 2 times [2024-05-07 02:38:27,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:27,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:27,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:27,531 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 35 treesize of output 27 [2024-05-07 02:38:27,996 INFO L85 PathProgramCache]: Analyzing trace with hash 758420058, now seen corresponding path program 2 times [2024-05-07 02:38:27,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:27,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:28,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:28,295 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 46 treesize of output 30 [2024-05-07 02:38:28,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1844475631, now seen corresponding path program 1 times [2024-05-07 02:38:28,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:28,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:29,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:29,189 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 52 treesize of output 36 [2024-05-07 02:38:29,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1192797374, now seen corresponding path program 1 times [2024-05-07 02:38:29,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:29,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:29,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:29,542 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 52 treesize of output 36 [2024-05-07 02:38:29,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1378223865, now seen corresponding path program 2 times [2024-05-07 02:38:29,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:29,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:29,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:29,845 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 52 treesize of output 36 [2024-05-07 02:38:29,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2054709790, now seen corresponding path program 1 times [2024-05-07 02:38:29,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:29,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:29,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:31,231 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 52 treesize of output 36 [2024-05-07 02:38:31,336 INFO L85 PathProgramCache]: Analyzing trace with hash 524960909, now seen corresponding path program 1 times [2024-05-07 02:38:31,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:31,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:31,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:31,530 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 52 treesize of output 36 [2024-05-07 02:38:31,718 INFO L85 PathProgramCache]: Analyzing trace with hash 253088984, now seen corresponding path program 2 times [2024-05-07 02:38:31,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:31,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:31,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:31,875 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 52 treesize of output 36 [2024-05-07 02:38:32,014 INFO L85 PathProgramCache]: Analyzing trace with hash 762226349, now seen corresponding path program 1 times [2024-05-07 02:38:32,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:32,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:32,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:33,572 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 52 treesize of output 36 [2024-05-07 02:38:33,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1116176103, now seen corresponding path program 1 times [2024-05-07 02:38:33,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 02:38:33,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 02:38:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 02:38:33,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 02:38:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat