./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/queue_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/queue_longer.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-13 07:12:21,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 07:12:21,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf [2024-11-13 07:12:21,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 07:12:21,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 07:12:21,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 07:12:21,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 07:12:21,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 07:12:21,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 07:12:21,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 07:12:21,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 07:12:21,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 07:12:21,703 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 07:12:21,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 07:12:21,704 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 07:12:21,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 07:12:21,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 07:12:21,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 07:12:21,708 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 07:12:21,709 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 07:12:21,709 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 07:12:21,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 07:12:21,710 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 07:12:21,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 07:12:21,710 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 07:12:21,710 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 07:12:21,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 07:12:21,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 07:12:21,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 07:12:21,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 07:12:21,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 07:12:21,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 07:12:21,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 07:12:21,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 07:12:21,713 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 07:12:21,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 07:12:21,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 07:12:21,714 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-13 07:12:21,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-13 07:12:21,714 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-13 07:12:21,714 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-13 07:12:21,715 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2024-11-13 07:12:22,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 07:12:22,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 07:12:22,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 07:12:22,058 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 07:12:22,058 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 07:12:22,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/queue_longer.i [2024-11-13 07:12:23,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 07:12:23,770 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 07:12:23,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i [2024-11-13 07:12:23,788 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/520fed392/8e40a680441e45238126a19fd14fe7bf/FLAG1727b3c5e [2024-11-13 07:12:23,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/520fed392/8e40a680441e45238126a19fd14fe7bf [2024-11-13 07:12:23,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 07:12:23,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 07:12:23,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 07:12:23,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 07:12:23,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 07:12:23,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 07:12:23" (1/1) ... [2024-11-13 07:12:23,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd98792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:12:23, skipping insertion in model container [2024-11-13 07:12:23,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 07:12:23" (1/1) ... [2024-11-13 07:12:23,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 07:12:24,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 07:12:24,485 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 07:12:24,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 07:12:24,691 INFO L204 MainTranslator]: Completed translation [2024-11-13 07:12:24,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:12:24 WrapperNode [2024-11-13 07:12:24,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 07:12:24,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 07:12:24,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 07:12:24,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 07:12:24,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:12:24" (1/1) ... [2024-11-13 07:12:24,743 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:12:24" (1/1) ... [2024-11-13 07:12:24,825 INFO L138 Inliner]: procedures = 274, calls = 859, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 1046 [2024-11-13 07:12:24,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 07:12:24,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 07:12:24,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 07:12:24,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 07:12:24,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:12:24" (1/1) ... [2024-11-13 07:12:24,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:12:24" (1/1) ... [2024-11-13 07:12:24,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:12:24" (1/1) ... [2024-11-13 07:12:24,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:12:24" (1/1) ... [2024-11-13 07:12:24,904 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:12:24" (1/1) ... [2024-11-13 07:12:24,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:12:24" (1/1) ... [2024-11-13 07:12:24,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:12:24" (1/1) ... [2024-11-13 07:12:24,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:12:24" (1/1) ... [2024-11-13 07:12:24,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 07:12:24,934 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 07:12:24,934 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 07:12:24,934 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 07:12:24,935 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:12:24" (1/1) ... [2024-11-13 07:12:24,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 07:12:24,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:12:24,972 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-11-13 07:12:24,974 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-11-13 07:12:25,056 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-13 07:12:25,056 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-13 07:12:25,057 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-13 07:12:25,057 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-13 07:12:25,057 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-13 07:12:25,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 07:12:25,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 07:12:25,075 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-13 07:12:25,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 07:12:25,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 07:12:25,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 07:12:25,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 07:12:25,078 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 07:12:25,225 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 07:12:25,227 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 07:12:26,562 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 07:12:26,563 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 07:12:33,380 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 07:12:33,381 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 07:12:33,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 07:12:33 BoogieIcfgContainer [2024-11-13 07:12:33,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 07:12:33,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 07:12:33,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 07:12:33,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 07:12:33,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 07:12:23" (1/3) ... [2024-11-13 07:12:33,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f280908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 07:12:33, skipping insertion in model container [2024-11-13 07:12:33,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 07:12:24" (2/3) ... [2024-11-13 07:12:33,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f280908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 07:12:33, skipping insertion in model container [2024-11-13 07:12:33,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 07:12:33" (3/3) ... [2024-11-13 07:12:33,392 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2024-11-13 07:12:33,412 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 07:12:33,413 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2024-11-13 07:12:33,413 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 07:12:33,590 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-13 07:12:33,649 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 07:12:33,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-13 07:12:33,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:12:33,652 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-11-13 07:12:33,654 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-11-13 07:12:33,693 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 07:12:33,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-11-13 07:12:33,714 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@30527fe8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 07:12:33,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-11-13 07:12:34,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:12:34,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:12:34,164 INFO L85 PathProgramCache]: Analyzing trace with hash -994868920, now seen corresponding path program 1 times [2024-11-13 07:12:34,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:12:34,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590605516] [2024-11-13 07:12:34,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:12:34,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:12:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:12:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:12:34,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:12:34,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590605516] [2024-11-13 07:12:34,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590605516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:12:34,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:12:34,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 07:12:34,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698308431] [2024-11-13 07:12:34,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:12:34,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:12:34,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:12:34,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:12:34,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:12:34,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:34,820 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:12:34,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:12:34,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:35,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:35,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 07:12:35,027 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:12:35,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:12:35,027 INFO L85 PathProgramCache]: Analyzing trace with hash -994868919, now seen corresponding path program 1 times [2024-11-13 07:12:35,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:12:35,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814925357] [2024-11-13 07:12:35,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:12:35,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:12:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:12:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:12:36,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:12:36,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814925357] [2024-11-13 07:12:36,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814925357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:12:36,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:12:36,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 07:12:36,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480125475] [2024-11-13 07:12:36,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:12:36,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 07:12:36,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:12:36,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 07:12:36,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 07:12:36,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:36,814 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:12:36,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:12:36,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:36,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:37,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:37,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:37,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 07:12:37,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:12:37,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:12:37,611 INFO L85 PathProgramCache]: Analyzing trace with hash 494858813, now seen corresponding path program 1 times [2024-11-13 07:12:37,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:12:37,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749047415] [2024-11-13 07:12:37,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:12:37,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:12:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:12:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:12:37,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:12:37,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749047415] [2024-11-13 07:12:37,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749047415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:12:37,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:12:37,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 07:12:37,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562964209] [2024-11-13 07:12:37,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:12:37,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:12:37,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:12:37,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:12:37,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:12:37,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:37,843 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:12:37,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:12:37,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:37,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:37,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:38,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:38,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:38,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:38,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 07:12:38,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:12:38,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:12:38,038 INFO L85 PathProgramCache]: Analyzing trace with hash -2068756552, now seen corresponding path program 1 times [2024-11-13 07:12:38,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:12:38,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605737618] [2024-11-13 07:12:38,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:12:38,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:12:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:12:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:12:38,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:12:38,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605737618] [2024-11-13 07:12:38,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605737618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:12:38,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:12:38,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 07:12:38,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696794108] [2024-11-13 07:12:38,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:12:38,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:12:38,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:12:38,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:12:38,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:12:38,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:38,357 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:12:38,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:12:38,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:38,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:38,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:38,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:38,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:38,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 07:12:38,556 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:12:38,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:12:38,557 INFO L85 PathProgramCache]: Analyzing trace with hash -2068756551, now seen corresponding path program 1 times [2024-11-13 07:12:38,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:12:38,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474390740] [2024-11-13 07:12:38,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:12:38,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:12:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:12:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:12:38,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:12:38,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474390740] [2024-11-13 07:12:38,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474390740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:12:38,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:12:38,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 07:12:38,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252708] [2024-11-13 07:12:38,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:12:38,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:12:38,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:12:38,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:12:38,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:12:38,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:38,838 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:12:38,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:12:38,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:38,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:38,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:38,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:38,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:39,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:39,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:39,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:39,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:39,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:39,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 07:12:39,325 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:12:39,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:12:39,326 INFO L85 PathProgramCache]: Analyzing trace with hash 494891520, now seen corresponding path program 1 times [2024-11-13 07:12:39,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:12:39,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106314466] [2024-11-13 07:12:39,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:12:39,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:12:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:12:39,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:12:39,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:12:39,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106314466] [2024-11-13 07:12:39,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106314466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:12:39,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:12:39,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 07:12:39,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561259638] [2024-11-13 07:12:39,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:12:39,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:12:39,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:12:39,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:12:39,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:12:39,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:39,437 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:12:39,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:12:39,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:39,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:39,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:39,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:39,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:39,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:39,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:39,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:39,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:39,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:39,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:39,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:39,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 07:12:39,844 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:12:39,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:12:39,844 INFO L85 PathProgramCache]: Analyzing trace with hash 494891521, now seen corresponding path program 1 times [2024-11-13 07:12:39,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:12:39,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783993786] [2024-11-13 07:12:39,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:12:39,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:12:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:12:40,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:12:40,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:12:40,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783993786] [2024-11-13 07:12:40,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783993786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:12:40,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:12:40,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 07:12:40,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126839417] [2024-11-13 07:12:40,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:12:40,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 07:12:40,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:12:40,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 07:12:40,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 07:12:40,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:40,276 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:12:40,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:12:40,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:40,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:40,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:40,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:40,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:40,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:40,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:40,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:40,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:40,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:40,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:40,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:40,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:40,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:12:40,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 07:12:40,925 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:12:40,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:12:40,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1861204073, now seen corresponding path program 1 times [2024-11-13 07:12:40,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:12:40,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73240950] [2024-11-13 07:12:40,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:12:40,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:12:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:12:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:12:42,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:12:42,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73240950] [2024-11-13 07:12:42,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73240950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:12:42,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:12:42,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 07:12:42,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999755234] [2024-11-13 07:12:42,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:12:42,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 07:12:42,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:12:42,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 07:12:42,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-13 07:12:42,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:42,159 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:12:42,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:12:42,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:42,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:42,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:42,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:42,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:42,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:42,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:12:42,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:42,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:42,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:42,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:42,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:42,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:42,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:42,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:12:42,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:12:42,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 07:12:42,664 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:12:42,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:12:42,664 INFO L85 PathProgramCache]: Analyzing trace with hash 750049702, now seen corresponding path program 1 times [2024-11-13 07:12:42,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:12:42,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836639403] [2024-11-13 07:12:42,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:12:42,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:12:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:12:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:12:45,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:12:45,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836639403] [2024-11-13 07:12:45,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836639403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:12:45,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:12:45,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 07:12:45,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453546693] [2024-11-13 07:12:45,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:12:45,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 07:12:45,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:12:45,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 07:12:45,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-13 07:12:45,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:45,569 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:12:45,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:12:45,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:45,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:45,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:45,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:45,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:45,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:45,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:12:45,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:12:45,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:46,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:46,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:46,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:46,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:46,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:46,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:46,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:12:46,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:12:46,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:12:46,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 07:12:46,832 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:12:46,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:12:46,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1845955818, now seen corresponding path program 1 times [2024-11-13 07:12:46,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:12:46,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597525963] [2024-11-13 07:12:46,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:12:46,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:12:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:12:48,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:12:48,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:12:48,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597525963] [2024-11-13 07:12:48,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597525963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:12:48,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:12:48,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 07:12:48,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489690401] [2024-11-13 07:12:48,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:12:48,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 07:12:48,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:12:48,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 07:12:48,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-13 07:12:48,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:48,992 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:12:48,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:12:48,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:48,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:48,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:48,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:48,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:48,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:48,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:12:48,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:12:48,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:12:48,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:50,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:50,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:50,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:50,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:50,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:50,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:50,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:12:50,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:12:50,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:12:50,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:12:50,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 07:12:50,179 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:12:50,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:12:50,180 INFO L85 PathProgramCache]: Analyzing trace with hash -156280063, now seen corresponding path program 1 times [2024-11-13 07:12:50,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:12:50,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013302084] [2024-11-13 07:12:50,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:12:50,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:12:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:12:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:12:50,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:12:50,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013302084] [2024-11-13 07:12:50,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013302084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:12:50,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:12:50,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 07:12:50,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129599402] [2024-11-13 07:12:50,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:12:50,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 07:12:50,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:12:50,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 07:12:50,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 07:12:50,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:50,499 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:12:50,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:12:50,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:50,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:50,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:50,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:50,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:50,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:50,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:12:50,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:12:50,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:12:50,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:12:50,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:50,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:50,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:50,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:50,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:50,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:50,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:50,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:12:50,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:12:50,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:12:50,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:12:50,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:12:50,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 07:12:50,707 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:12:50,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:12:50,707 INFO L85 PathProgramCache]: Analyzing trace with hash -811902022, now seen corresponding path program 1 times [2024-11-13 07:12:50,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:12:50,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029277962] [2024-11-13 07:12:50,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:12:50,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:12:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:12:50,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:12:50,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:12:50,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029277962] [2024-11-13 07:12:50,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029277962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:12:50,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:12:50,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 07:12:50,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770605205] [2024-11-13 07:12:50,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:12:50,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:12:50,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:12:50,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:12:50,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:12:50,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:50,831 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:12:50,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:12:50,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:50,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:50,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:50,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:50,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:50,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:50,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:12:50,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:12:50,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:12:50,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:12:50,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:12:50,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:51,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:51,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:51,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:51,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:51,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:51,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:51,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:12:51,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:12:51,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:12:51,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:12:51,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:12:51,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:51,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 07:12:51,917 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:12:51,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:12:51,917 INFO L85 PathProgramCache]: Analyzing trace with hash -180474182, now seen corresponding path program 1 times [2024-11-13 07:12:51,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:12:51,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828293647] [2024-11-13 07:12:51,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:12:51,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:12:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:12:52,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 07:12:52,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:12:52,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828293647] [2024-11-13 07:12:52,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828293647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:12:52,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:12:52,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 07:12:52,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297059814] [2024-11-13 07:12:52,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:12:52,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:12:52,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:12:52,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:12:52,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:12:52,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:52,163 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:12:52,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:12:52,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:52,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:12:52,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:12:52,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:12:52,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:12:52,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:12:52,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:52,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:52,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:12:52,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:12:52,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:12:52,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:12:52,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:12:52,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 07:12:52,387 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:12:52,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:12:52,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1393124767, now seen corresponding path program 1 times [2024-11-13 07:12:52,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:12:52,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050291711] [2024-11-13 07:12:52,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:12:52,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:12:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:12:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:12:52,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:12:52,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050291711] [2024-11-13 07:12:52,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050291711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:12:52,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:12:52,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 07:12:52,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43294845] [2024-11-13 07:12:52,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:12:52,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:12:52,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:12:52,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:12:52,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:12:52,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:52,586 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:12:52,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:12:52,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:52,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:12:52,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:12:52,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:12:52,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:12:52,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:12:52,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:52,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:12:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:12:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:12:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:12:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:12:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:52,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 07:12:52,805 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:12:52,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:12:52,805 INFO L85 PathProgramCache]: Analyzing trace with hash -113715809, now seen corresponding path program 1 times [2024-11-13 07:12:52,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:12:52,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438722967] [2024-11-13 07:12:52,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:12:52,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:12:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:12:55,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:12:55,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:12:55,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438722967] [2024-11-13 07:12:55,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438722967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:12:55,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:12:55,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 07:12:55,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414857505] [2024-11-13 07:12:55,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:12:55,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 07:12:55,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:12:55,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 07:12:55,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-13 07:12:55,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:55,107 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:12:55,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:12:55,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:55,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:55,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:55,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:55,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:55,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:55,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:12:55,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:12:55,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:12:55,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:12:55,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:12:55,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:55,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:55,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:55,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:12:55,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:55,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:12:55,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:55,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:55,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:55,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:55,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:12:55,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:12:55,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:12:55,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:12:55,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:12:55,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:55,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:55,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:12:55,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:12:55,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 07:12:55,981 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:12:55,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:12:55,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1619523975, now seen corresponding path program 1 times [2024-11-13 07:12:55,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:12:55,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718078267] [2024-11-13 07:12:55,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:12:55,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:12:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:12:59,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:12:59,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:12:59,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718078267] [2024-11-13 07:12:59,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718078267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:12:59,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539533211] [2024-11-13 07:12:59,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:12:59,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:12:59,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:12:59,614 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-11-13 07:12:59,615 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-11-13 07:13:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:13:00,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 2107 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-13 07:13:00,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:13:00,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 07:13:00,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:13:00,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:13:00,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 07:13:00,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:13:00,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2024-11-13 07:13:00,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:13:00,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:13:00,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:13:00,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 07:13:00,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:13:01,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2024-11-13 07:13:01,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:13:01,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:13:01,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:13:01,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:13:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:13:01,491 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:13:01,934 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_429 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_429 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-13 07:13:01,955 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_429 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_429 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-13 07:13:01,967 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_429 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_429 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2024-11-13 07:13:04,032 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_425) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse4) 4)))) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_425) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2024-11-13 07:13:06,083 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse0 .cse1 v_ArrVal_425) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse5) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse6 .cse1 v_ArrVal_425) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse5) 4)))))) is different from false [2024-11-13 07:13:06,120 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse1 .cse2 v_ArrVal_425) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse5) 4)) (select |c_#length| |c_~#queue~0.base|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse6 .cse2 v_ArrVal_425) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse5) 4))))))))) is different from false [2024-11-13 07:13:12,798 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse2 .cse3 v_ArrVal_425) .cse1 (+ (select .cse2 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse5 .cse3 v_ArrVal_425) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))) is different from false [2024-11-13 07:13:12,915 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse1 .cse2 v_ArrVal_425) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse3) 4)))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse6 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse5 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse5 .cse2 v_ArrVal_425) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse3) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)))))) is different from false [2024-11-13 07:13:12,963 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)))))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse1 .cse2 v_ArrVal_425) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse6 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse5 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse5 .cse2 v_ArrVal_425) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)))))) is different from false [2024-11-13 07:13:13,090 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ (select .cse5 .cse7) 1))) (and (forall ((v_ArrVal_420 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_420) .cse7 .cse8)))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse3 .cse4 v_ArrVal_425) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))))) (forall ((v_ArrVal_420 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_420) .cse7 .cse8)))) (let ((.cse11 (select (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (select (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse11 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse10 .cse4 v_ArrVal_425) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)))))))) is different from false [2024-11-13 07:13:13,203 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_420 Int) (v_ArrVal_418 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse8 .cse9 v_ArrVal_418))) (store (store .cse5 .cse6 v_ArrVal_420) .cse7 (+ (select .cse5 .cse7) 1)))))) (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse1 .cse2 v_ArrVal_425) .cse3 (+ 1 (select .cse1 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|))))) (forall ((v_ArrVal_420 Int) (v_ArrVal_418 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse8 .cse9 v_ArrVal_418))) (store (store .cse13 .cse6 v_ArrVal_420) .cse7 (+ (select .cse13 .cse7) 1)))))) (let ((.cse12 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* (select (select (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse12 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse11 .cse2 v_ArrVal_425) .cse3 (+ 1 (select .cse11 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< (select .cse12 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|))))))) is different from false [2024-11-13 07:13:13,289 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select .cse9 .cse8))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31|) (forall ((v_ArrVal_420 Int) (v_ArrVal_418 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_418))) (store (store .cse6 .cse7 v_ArrVal_420) .cse8 (+ (select .cse6 .cse8) 1)))))) (let ((.cse1 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 .cse5 v_ArrVal_425) .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse2) 4)) (select |c_#length| |c_~#queue~0.base|))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31| Int)) (or (forall ((v_ArrVal_420 Int) (v_ArrVal_418 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_418))) (store (store .cse13 .cse7 v_ArrVal_420) .cse8 (+ (select .cse13 .cse8) 1)))))) (let ((.cse12 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse12 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse11 .cse5 v_ArrVal_425) .cse2 (+ (select .cse11 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse2) 4)))) (< (select .cse12 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|))))) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31|)))))) is different from false [2024-11-13 07:13:15,361 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse6 .cse2)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31|) (forall ((v_ArrVal_420 Int) (v_ArrVal_418 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31|)) v_ArrVal_418))) (store (store .cse5 .cse4 v_ArrVal_420) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse3 .cse4 v_ArrVal_425) .cse2 (+ (select .cse3 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse2)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31|) (forall ((v_ArrVal_420 Int) (v_ArrVal_418 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse9 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_31|)) v_ArrVal_418))) (store (store .cse9 .cse4 v_ArrVal_420) .cse2 (+ (select .cse9 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_423) |c_~#queue~0.base|))) (or (< (select .cse7 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|) (forall ((v_ArrVal_429 (Array Int Int)) (v_ArrVal_425 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse8 (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_28|)) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse8 .cse4 v_ArrVal_425) .cse2 (+ (select .cse8 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|) .cse2)) |c_~#queue~0.offset|))))))))))) is different from false [2024-11-13 07:13:45,186 INFO L349 Elim1Store]: treesize reduction 306, result has 39.5 percent of original size [2024-11-13 07:13:45,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 412 treesize of output 358 [2024-11-13 07:13:45,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:13:45,258 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 352 treesize of output 348 [2024-11-13 07:13:45,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2024-11-13 07:13:45,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2024-11-13 07:13:45,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 42 treesize of output 34 [2024-11-13 07:13:45,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-13 07:13:45,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:13:45,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 167 [2024-11-13 07:13:46,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:13:46,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 136 [2024-11-13 07:13:46,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:13:46,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:13:46,619 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:13:46,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:13:46,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:13:46,676 INFO L349 Elim1Store]: treesize reduction 60, result has 53.1 percent of original size [2024-11-13 07:13:46,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 339 treesize of output 159 [2024-11-13 07:13:46,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:13:46,695 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:13:46,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2024-11-13 07:13:46,707 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:13:46,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2024-11-13 07:13:46,715 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:13:46,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 37 treesize of output 25 [2024-11-13 07:13:46,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-13 07:13:46,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539533211] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:13:46,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:13:46,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 21] total 56 [2024-11-13 07:13:46,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108861959] [2024-11-13 07:13:46,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:13:46,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-13 07:13:46,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:13:46,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-13 07:13:46,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1707, Unknown=20, NotChecked=1248, Total=3192 [2024-11-13 07:13:46,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:13:46,825 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:13:46,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 3.6842105263157894) internal successors, (210), 56 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:13:46,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:46,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:13:46,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:46,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:46,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:46,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:46,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:13:46,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:13:46,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:13:46,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:13:46,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:13:46,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:46,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:46,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:46,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:13:46,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:13:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:13:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:53,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:53,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:13:53,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:13:53,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:13:53,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:13:53,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:13:53,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:53,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:53,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:53,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:13:53,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 07:13:53,180 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-11-13 07:13:53,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 07:13:53,359 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:13:53,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:13:53,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1144524775, now seen corresponding path program 1 times [2024-11-13 07:13:53,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:13:53,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643508097] [2024-11-13 07:13:53,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:13:53,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:13:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:13:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:13:53,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:13:53,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643508097] [2024-11-13 07:13:53,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643508097] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:13:53,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031555007] [2024-11-13 07:13:53,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:13:53,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:13:53,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:13:53,800 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-11-13 07:13:53,801 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-11-13 07:13:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:13:54,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 2158 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 07:13:54,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:13:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:13:55,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:13:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 07:13:55,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031555007] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:13:55,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:13:55,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2024-11-13 07:13:55,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740613329] [2024-11-13 07:13:55,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:13:55,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 07:13:55,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:13:55,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 07:13:55,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-13 07:13:55,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:13:55,474 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:13:55,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 21.272727272727273) internal successors, (234), 11 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-11-13 07:13:55,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:55,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:13:55,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:55,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:55,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:55,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:55,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:13:55,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:13:55,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:13:55,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:13:55,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:13:55,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:55,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:55,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:55,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:13:55,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-13 07:13:55,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:13:59,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:59,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:13:59,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:59,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:59,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:59,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:59,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:13:59,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:13:59,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:13:59,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:13:59,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:13:59,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:59,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:59,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:13:59,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:13:59,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-13 07:13:59,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:13:59,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 07:13:59,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 07:13:59,771 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:13:59,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:13:59,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1960300065, now seen corresponding path program 1 times [2024-11-13 07:13:59,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:13:59,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795417391] [2024-11-13 07:13:59,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:13:59,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:13:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:14:00,439 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 07:14:00,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:14:00,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795417391] [2024-11-13 07:14:00,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795417391] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:14:00,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073340491] [2024-11-13 07:14:00,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:14:00,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:14:00,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:14:00,442 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 07:14:00,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 07:14:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:14:00,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 2732 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 07:14:00,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:14:02,177 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 07:14:02,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:14:02,867 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 07:14:02,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073340491] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:14:02,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:14:02,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-13 07:14:02,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61727278] [2024-11-13 07:14:02,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:14:02,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 07:14:02,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:14:02,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 07:14:02,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-13 07:14:02,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:14:02,871 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:14:02,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 22.5) internal successors, (225), 10 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:14:02,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:02,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:14:02,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:02,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:02,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:02,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:02,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:14:02,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:14:02,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:14:02,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:14:02,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:14:02,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:02,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:02,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:02,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:14:02,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-11-13 07:14:02,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:14:02,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:14:03,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:03,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:14:03,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:03,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:03,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:03,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:03,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:14:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:14:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:14:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:14:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:14:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:14:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-13 07:14:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:14:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:14:03,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 07:14:03,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 07:14:03,582 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:14:03,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:14:03,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1642891225, now seen corresponding path program 1 times [2024-11-13 07:14:03,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:14:03,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690256342] [2024-11-13 07:14:03,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:14:03,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:14:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:14:07,473 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 315 proven. 16 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-13 07:14:07,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:14:07,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690256342] [2024-11-13 07:14:07,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690256342] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:14:07,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947548950] [2024-11-13 07:14:07,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:14:07,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:14:07,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:14:07,476 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 07:14:07,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 07:14:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:14:07,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 2907 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-13 07:14:07,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:14:08,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 07:14:08,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:14:08,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:14:08,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:14:08,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 07:14:08,976 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-13 07:14:08,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2024-11-13 07:14:09,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 07:14:09,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-13 07:14:09,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:14:09,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:14:09,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:14:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 295 proven. 36 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-13 07:14:09,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:14:09,336 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1024 (Array Int Int))) (not (= 400 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1024) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))) is different from false [2024-11-13 07:14:10,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:14:10,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 79 [2024-11-13 07:14:11,000 INFO L349 Elim1Store]: treesize reduction 192, result has 41.8 percent of original size [2024-11-13 07:14:11,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 151 treesize of output 243 [2024-11-13 07:14:11,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:14:11,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 152 [2024-11-13 07:14:11,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2024-11-13 07:14:11,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2024-11-13 07:14:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 281 proven. 46 refuted. 0 times theorem prover too weak. 81 trivial. 4 not checked. [2024-11-13 07:14:11,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947548950] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:14:11,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:14:11,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 18] total 45 [2024-11-13 07:14:11,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622881654] [2024-11-13 07:14:11,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:14:11,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-13 07:14:11,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:14:11,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-13 07:14:11,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=1636, Unknown=15, NotChecked=86, Total=2070 [2024-11-13 07:14:11,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:14:11,422 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:14:11,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 8.869565217391305) internal successors, (408), 45 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:14:11,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:11,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:14:11,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:11,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:11,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:11,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:11,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:14:11,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:14:11,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:14:11,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:14:11,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:14:11,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:11,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:11,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:11,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:14:11,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-11-13 07:14:11,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:14:11,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:14:11,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:14:15,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:14:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:14:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:14:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:14:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:14:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:14:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:14:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-13 07:14:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:14:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:14:15,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 07:14:15,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-13 07:14:15,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:14:15,836 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:14:15,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:14:15,836 INFO L85 PathProgramCache]: Analyzing trace with hash 908437829, now seen corresponding path program 1 times [2024-11-13 07:14:15,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:14:15,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603466435] [2024-11-13 07:14:15,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:14:15,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:14:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:14:16,058 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-13 07:14:16,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:14:16,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603466435] [2024-11-13 07:14:16,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603466435] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:14:16,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998231891] [2024-11-13 07:14:16,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:14:16,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:14:16,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:14:16,060 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 07:14:16,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 07:14:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:14:16,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 2331 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 07:14:16,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:14:16,833 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-13 07:14:16,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:14:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-13 07:14:16,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998231891] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:14:16,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:14:16,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2024-11-13 07:14:16,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395443772] [2024-11-13 07:14:16,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:14:16,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 07:14:16,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:14:16,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 07:14:16,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 07:14:16,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:14:16,993 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:14:16,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:14:16,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-11-13 07:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-13 07:14:16,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:14:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:14:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:14:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:14:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:14:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:14:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:14:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:14:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-13 07:14:17,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:14:17,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:14:17,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 07:14:17,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:14:17,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 07:14:18,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:14:18,128 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:14:18,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:14:18,128 INFO L85 PathProgramCache]: Analyzing trace with hash -777662871, now seen corresponding path program 2 times [2024-11-13 07:14:18,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:14:18,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787018305] [2024-11-13 07:14:18,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:14:18,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:14:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:14:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-11-13 07:14:18,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:14:18,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787018305] [2024-11-13 07:14:18,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787018305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:14:18,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:14:18,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 07:14:18,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439639137] [2024-11-13 07:14:18,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:14:18,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:14:18,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:14:18,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:14:18,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:14:18,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:14:18,487 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:14:18,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:14:18,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:18,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:14:18,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:18,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:18,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:18,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:18,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:14:18,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:14:18,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:14:18,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:14:18,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:14:18,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:18,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:18,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:18,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:14:18,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-11-13 07:14:18,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:14:18,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:14:18,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 07:14:18,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:14:18,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:14:18,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:14:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:14:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:14:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:14:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:14:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:14:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:14:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-13 07:14:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:14:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:14:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 07:14:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:14:18,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:18,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 07:14:18,767 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:14:18,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:14:18,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1611366878, now seen corresponding path program 3 times [2024-11-13 07:14:18,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:14:18,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350855853] [2024-11-13 07:14:18,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:14:18,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:14:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:14:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 204 proven. 18 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-13 07:14:25,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:14:25,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350855853] [2024-11-13 07:14:25,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350855853] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:14:25,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818398464] [2024-11-13 07:14:25,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 07:14:25,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:14:25,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:14:25,324 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 07:14:25,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 07:14:26,239 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-13 07:14:26,240 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 07:14:26,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 2079 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-13 07:14:26,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:14:27,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 07:14:27,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:14:27,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:14:27,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:14:27,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:14:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 33 proven. 114 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2024-11-13 07:14:27,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:14:27,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 38 treesize of output 34 [2024-11-13 07:14:27,853 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1566 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1566) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1566 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1566) |c_~#queue~0.base|) .cse0) 401)))) is different from false [2024-11-13 07:14:27,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:14:27,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-13 07:14:27,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:14:27,882 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 36 treesize of output 35 [2024-11-13 07:14:27,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2024-11-13 07:14:27,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:14:27,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-13 07:14:27,914 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:14:27,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:14:27,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-13 07:14:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 25 proven. 114 refuted. 0 times theorem prover too weak. 267 trivial. 8 not checked. [2024-11-13 07:14:28,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818398464] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:14:28,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:14:28,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 8] total 36 [2024-11-13 07:14:28,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129644867] [2024-11-13 07:14:28,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:14:28,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-13 07:14:28,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:14:28,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-13 07:14:28,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1101, Unknown=1, NotChecked=68, Total=1332 [2024-11-13 07:14:28,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:14:28,725 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:14:28,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 8.837837837837839) internal successors, (327), 36 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:14:28,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:28,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:14:28,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:28,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:28,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:28,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:28,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:14:28,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:14:28,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:14:28,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:14:28,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:14:28,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:28,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:28,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:28,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:14:28,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-11-13 07:14:28,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:14:28,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:14:28,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 07:14:28,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:14:28,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:28,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:14:32,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:32,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:14:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:14:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:14:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:14:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:14:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:14:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:14:32,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-13 07:14:32,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:14:32,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:14:32,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 07:14:32,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:14:32,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:14:32,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 07:14:32,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 07:14:32,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-13 07:14:32,281 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:14:32,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:14:32,281 INFO L85 PathProgramCache]: Analyzing trace with hash 705868595, now seen corresponding path program 4 times [2024-11-13 07:14:32,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:14:32,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007528220] [2024-11-13 07:14:32,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:14:32,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:14:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:14:40,447 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 232 proven. 48 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-13 07:14:40,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:14:40,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007528220] [2024-11-13 07:14:40,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007528220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:14:40,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902361378] [2024-11-13 07:14:40,448 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 07:14:40,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:14:40,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:14:40,449 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 07:14:40,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 07:14:41,249 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 07:14:41,250 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 07:14:41,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 2914 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-11-13 07:14:41,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:14:41,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 07:14:41,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:14:41,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 07:14:41,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:14:41,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-13 07:14:42,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 22 [2024-11-13 07:14:42,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:14:42,302 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:14:42,326 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2024-11-13 07:14:42,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2024-11-13 07:14:42,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:14:42,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:14:42,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-13 07:14:42,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:14:42,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 55 treesize of output 27 [2024-11-13 07:14:42,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:14:42,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-13 07:14:42,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:14:42,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:14:42,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-13 07:14:43,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:14:43,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 25 [2024-11-13 07:14:43,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:14:43,243 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:14:43,262 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2024-11-13 07:14:43,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2024-11-13 07:14:43,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:14:43,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:14:43,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-13 07:14:43,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:14:43,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 16 [2024-11-13 07:14:43,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:14:43,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 07:14:43,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 13 [2024-11-13 07:14:43,564 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 242 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-13 07:14:43,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:14:43,673 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1849 (Array Int Int))) (not (= 400 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1849) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))) is different from false [2024-11-13 07:14:47,292 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_1847 Int) (v_ArrVal_1839 Int) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1846 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1839)))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1841) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (let ((.cse2 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1846) .cse3 v_ArrVal_1847)) |c_~#stored_elements~0.base| v_ArrVal_1849) |c_~#queue~0.base|) .cse2)))) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1839))))) is different from false [2024-11-13 07:14:47,309 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_1847 Int) (v_ArrVal_1839 Int) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1846 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1839)))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1841) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (let ((.cse2 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1846) .cse3 v_ArrVal_1847)) |c_~#stored_elements~0.base| v_ArrVal_1849) |c_~#queue~0.base|) .cse2)))) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1839)))))) is different from false [2024-11-13 07:14:47,374 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_1847 Int) (v_ArrVal_1839 Int) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1846 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1837) .cse5 v_ArrVal_1839)))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1841) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (= (let ((.cse2 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1846) .cse3 v_ArrVal_1847)) |c_~#stored_elements~0.base| v_ArrVal_1849) |c_~#queue~0.base|) .cse2)) 400)) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1839) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|)))))) is different from false [2024-11-13 07:14:47,436 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_1847 Int) (v_ArrVal_1839 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_80| Int) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1846 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1837) .cse5 v_ArrVal_1839)))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1841) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (let ((.cse2 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_80|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1846) .cse3 v_ArrVal_1847)) |c_~#stored_elements~0.base| v_ArrVal_1849) |c_~#queue~0.base|) .cse2)))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1839) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|)))))) is different from false [2024-11-13 07:14:47,484 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_124| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_1837 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (v_ArrVal_1847 Int) (v_ArrVal_1839 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_80| Int) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1846 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_124| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1837) .cse3 v_ArrVal_1839)))) (let ((.cse0 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1841) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1839) (not (= 400 (let ((.cse5 (+ 1600 |c_~#queue~0.offset|))) (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse0 .cse5 (+ (select .cse0 .cse5) 1)) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_80|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1846) .cse1 v_ArrVal_1847)) |c_~#stored_elements~0.base| v_ArrVal_1849) |c_~#queue~0.base|) .cse5))))))))) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_124|)))) is different from false [2024-11-13 07:15:12,210 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (v_ArrVal_1847 Int) (v_ArrVal_1839 Int) (v_ArrVal_1832 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_80| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_124| Int) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1846 Int)) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1832) |c_~#queue~0.base|)) (.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_124| 4) |c_~#queue~0.offset|)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse4 .cse1 1) .cse5 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse2 v_ArrVal_1837) .cse3 v_ArrVal_1839)) |c_~#stored_elements~0.base| v_ArrVal_1841) |c_~#queue~0.base|))) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 (+ (select .cse0 .cse1) 1)) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_80|) .cse2 v_ArrVal_1846) .cse3 v_ArrVal_1847)) |c_~#stored_elements~0.base| v_ArrVal_1849) |c_~#queue~0.base|) .cse1))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_124|) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_121|) (< (+ (select (store (store (store .cse4 .cse2 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 1) .cse5 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse3) 1) v_ArrVal_1839))))) is different from false [2024-11-13 07:15:12,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:15:12,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 292 treesize of output 212 [2024-11-13 07:15:12,317 INFO L349 Elim1Store]: treesize reduction 32, result has 60.0 percent of original size [2024-11-13 07:15:12,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 405 treesize of output 365 [2024-11-13 07:15:12,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2024-11-13 07:15:12,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:15:12,352 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 195 treesize of output 185 [2024-11-13 07:15:12,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 44 treesize of output 40 [2024-11-13 07:15:12,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2024-11-13 07:15:12,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2024-11-13 07:15:12,457 INFO L349 Elim1Store]: treesize reduction 62, result has 40.4 percent of original size [2024-11-13 07:15:12,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 57 [2024-11-13 07:15:12,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:15:12,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 77 [2024-11-13 07:15:12,585 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:15:12,587 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 07:15:12,596 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:15:12,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 112 [2024-11-13 07:15:12,605 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:15:12,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:12,610 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:15:12,612 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:15:12,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:12,635 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-11-13 07:15:12,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 1 [2024-11-13 07:15:20,987 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 146 proven. 90 refuted. 60 times theorem prover too weak. 77 trivial. 44 not checked. [2024-11-13 07:15:20,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902361378] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:15:20,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:15:20,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19, 27] total 70 [2024-11-13 07:15:20,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509736414] [2024-11-13 07:15:20,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:15:20,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-13 07:15:20,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:15:20,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-13 07:15:20,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=603, Invalid=3423, Unknown=34, NotChecked=910, Total=4970 [2024-11-13 07:15:20,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:15:20,993 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:15:20,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 6.408450704225352) internal successors, (455), 70 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:15:20,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:20,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:15:20,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:20,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:20,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:20,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:20,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:15:20,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:15:20,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:15:20,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:15:20,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:15:20,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:20,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:20,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:20,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:15:20,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-11-13 07:15:20,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:15:20,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:15:20,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 07:15:20,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:15:20,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:20,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-13 07:15:20,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:15:31,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 07:15:33,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 07:15:36,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:36,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:15:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:15:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:15:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:15:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:15:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:15:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:15:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-13 07:15:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:15:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:15:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 07:15:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:15:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 07:15:36,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-13 07:15:36,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 07:15:37,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:15:37,157 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:15:37,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:15:37,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1030411556, now seen corresponding path program 5 times [2024-11-13 07:15:37,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:15:37,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683460304] [2024-11-13 07:15:37,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:15:37,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:15:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:15:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 157 proven. 62 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-13 07:15:39,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:15:39,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683460304] [2024-11-13 07:15:39,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683460304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:15:39,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585705695] [2024-11-13 07:15:39,862 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 07:15:39,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:15:39,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:15:39,864 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 07:15:39,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 07:15:42,102 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-11-13 07:15:42,102 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 07:15:42,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 2921 conjuncts, 124 conjuncts are in the unsatisfiable core [2024-11-13 07:15:42,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:15:42,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:42,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:42,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:42,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:42,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:42,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:42,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:42,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:42,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:42,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:42,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:42,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:42,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:15:42,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:42,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:42,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:42,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:42,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:42,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:42,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:15:43,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:43,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:43,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:43,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:43,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:43,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:43,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:43,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:43,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:43,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:43,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:43,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2024-11-13 07:15:44,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:44,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:44,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:44,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:44,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:44,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:44,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:44,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:44,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:44,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:44,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:44,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2024-11-13 07:15:44,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:44,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:44,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:44,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:45,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:45,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:45,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:45,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:15:45,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:45,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:15:45,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:45,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2024-11-13 07:15:45,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:45,748 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-13 07:15:45,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 37 [2024-11-13 07:15:45,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:15:45,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-13 07:15:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 209 proven. 203 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 07:15:46,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:15:46,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:15:46,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 72 [2024-11-13 07:15:46,933 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| v_arrayElimArr_11))) (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|))))) (or (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0) (not (= 400 (select (select .cse0 |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))))) is different from false [2024-11-13 07:15:46,977 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11))) (let ((.cse1 (store (select .cse0 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|))) (or (not (= 400 (select (select (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0))))) is different from false [2024-11-13 07:15:47,093 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2136 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_2136))) (let ((.cse2 (store .cse0 |c_~#queue~0.base| v_arrayElimArr_11))) (let ((.cse1 (store (select .cse2 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|))) (or (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0) (not (= 400 (select (select (store .cse2 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))))))) is different from false [2024-11-13 07:15:47,229 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11))) (let ((.cse1 (store (select .cse0 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|))) (or (not (= 400 (select (select (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0))))) is different from false [2024-11-13 07:15:47,258 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_81| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11))) (let ((.cse1 (store (select .cse0 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|))) (or (not (= 400 (select (select (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0))))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-11-13 07:15:47,290 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 400)) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0)))) is different from false [2024-11-13 07:15:47,333 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| v_ArrVal_2133))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0) (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))))))) is different from false [2024-11-13 07:15:47,456 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-11-13 07:15:47,566 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2130 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_2130))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store .cse0 |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 8)) 0))))) is different from false [2024-11-13 07:15:47,781 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 12)) 0)))) is different from false [2024-11-13 07:15:47,837 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_82| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 12)) 0) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1))))) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-11-13 07:15:47,903 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1))))) is different from false [2024-11-13 07:15:47,979 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| v_ArrVal_2127))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)))))) is different from false [2024-11-13 07:15:48,277 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_2127) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 12)) 0) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1))))) is different from false [2024-11-13 07:15:48,536 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (v_ArrVal_2127 (Array Int Int)) (v_ArrVal_2124 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_2124))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store .cse0 |c_~#queue~0.base| v_ArrVal_2127) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)))))) is different from false [2024-11-13 07:15:48,883 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_2127) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1))))) is different from false [2024-11-13 07:15:49,048 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_~i~0#1_83| Int)) (or (< |v_t1Thread1of1ForFork0_~i~0#1_83| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1))))))) is different from false [2024-11-13 07:15:49,248 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (|v_t1Thread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_83| (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1))))) is different from false [2024-11-13 07:15:49,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (|v_t1Thread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_83| (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1))))) is different from false [2024-11-13 07:15:49,516 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~value~0#1_71| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (|v_t1Thread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2143 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_71|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_83| (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1))))) is different from false [2024-11-13 07:15:49,606 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (|v_t1Thread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (|v_t1Thread1of1ForFork0_~value~0#1_71| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| v_ArrVal_2121))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_71|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_83| (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (not (= (select (select (store (store .cse0 |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 400)) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1)))))) is different from false [2024-11-13 07:15:49,903 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (|v_t1Thread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (|v_t1Thread1of1ForFork0_~value~0#1_71| Int)) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_2121) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_71|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_83| (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1))))) is different from false [2024-11-13 07:15:50,026 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (|v_t1Thread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (|v_t1Thread1of1ForFork0_~value~0#1_71| Int)) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store |c_#memory_int| |c_~#queue~0.base| v_ArrVal_2121) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_71|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_83| 3) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1))))) is different from false [2024-11-13 07:15:50,251 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (|v_t1Thread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (|v_t1Thread1of1ForFork0_~value~0#1_71| Int) (v_ArrVal_2118 Int)) (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| (store (select |c_#memory_int| |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| v_ArrVal_2118)) |c_~#queue~0.base| v_ArrVal_2121) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_71|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_83| 3) (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1))))) is different from false [2024-11-13 07:15:50,384 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (|v_t1Thread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (|v_t1Thread1of1ForFork0_~value~0#1_71| Int) (v_ArrVal_2118 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| v_ArrVal_2116))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| v_ArrVal_2118)) |c_~#queue~0.base| v_ArrVal_2121) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_71|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_~i~0#1_83| 3) (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1)))))) is different from false [2024-11-13 07:15:50,752 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2127 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (|v_t1Thread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_194| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (|v_t1Thread1of1ForFork0_~value~0#1_71| Int) (v_ArrVal_2118 Int)) (let ((.cse0 (store |c_#memory_int| |v_t1Thread1of1ForFork0_enqueue_~q#1.base_194| v_ArrVal_2116))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| v_ArrVal_2118)) |c_~#queue~0.base| v_ArrVal_2121) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_71|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_~i~0#1_83| 3) (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_194| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1)))))) is different from false [2024-11-13 07:15:51,251 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2127 (Array Int Int)) (v_ArrVal_2113 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int) (|v_t1Thread1of1ForFork0_~i~0#1_81| Int) (|v_t1Thread1of1ForFork0_~i~0#1_82| Int) (|v_t1Thread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_2133 (Array Int Int)) (v_ArrVal_2121 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (|v_t1Thread1of1ForFork0_~value~0#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~q#1.base_194| Int) (|v_t1Thread1of1ForFork0_~value~0#1_69| Int) (|v_t1Thread1of1ForFork0_~value~0#1_71| Int) (v_ArrVal_2118 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| v_ArrVal_2113) |v_t1Thread1of1ForFork0_enqueue_~q#1.base_194| v_ArrVal_2116))) (let ((.cse1 (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select (store (store .cse0 |c_~#stored_elements~0.base| (store (select .cse0 |c_~#stored_elements~0.base|) |c_~#stored_elements~0.offset| v_ArrVal_2118)) |c_~#queue~0.base| v_ArrVal_2121) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4) |t1Thread1of1ForFork0_~value~0#1|)) |c_~#queue~0.base| v_ArrVal_2127) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_83| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_71|)) |c_~#queue~0.base| v_ArrVal_2133) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_82| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_69|)) |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_81| 4) |c_~#stored_elements~0.offset| 4) |v_t1Thread1of1ForFork0_~value~0#1_67|))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_83| 3) (= (select (select (store (store .cse0 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| v_ArrVal_2143) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 12)) 0) (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| v_arrayElimArr_11) |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (< |v_t1Thread1of1ForFork0_enqueue_~q#1.base_194| |c_~#queue~0.base|) (< |v_t1Thread1of1ForFork0_~i~0#1_81| (+ |v_t1Thread1of1ForFork0_~i~0#1_82| 1)) (< |v_t1Thread1of1ForFork0_~i~0#1_82| (+ |v_t1Thread1of1ForFork0_~i~0#1_83| 1)))))) is different from false [2024-11-13 07:15:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 243 not checked. [2024-11-13 07:15:51,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585705695] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:15:51,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:15:51,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 31, 40] total 84 [2024-11-13 07:15:51,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118923583] [2024-11-13 07:15:51,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:15:51,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2024-11-13 07:15:51,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:15:51,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2024-11-13 07:15:51,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=3020, Unknown=43, NotChecked=3726, Total=7140 [2024-11-13 07:15:51,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:15:51,407 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:15:51,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 5.929411764705883) internal successors, (504), 84 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:15:51,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:51,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:15:51,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:51,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:51,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:51,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:51,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:15:51,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:15:51,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:15:51,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:15:51,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:15:51,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:51,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:51,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:51,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:15:51,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-11-13 07:15:51,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:15:51,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:15:51,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 07:15:51,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:15:51,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:15:51,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-13 07:15:51,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-11-13 07:15:51,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:16:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:16:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:16:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:16:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:16:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:16:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:16:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:16:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-13 07:16:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:16:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:16:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 07:16:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:16:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 07:16:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-13 07:16:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-13 07:16:00,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-13 07:16:00,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:16:00,715 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:16:00,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:16:00,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1827593053, now seen corresponding path program 1 times [2024-11-13 07:16:00,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:16:00,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271314843] [2024-11-13 07:16:00,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:16:00,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:16:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:16:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-13 07:16:00,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:16:00,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271314843] [2024-11-13 07:16:00,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271314843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 07:16:00,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 07:16:00,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 07:16:00,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275657469] [2024-11-13 07:16:00,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 07:16:00,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 07:16:00,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:16:00,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 07:16:00,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 07:16:00,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:16:00,881 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:16:00,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:16:00,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:00,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:16:00,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:00,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:00,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:00,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:00,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:16:00,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:16:00,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:16:00,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:16:00,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:16:00,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:00,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:00,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:00,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:16:00,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-11-13 07:16:00,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:16:00,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:16:00,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 07:16:00,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:16:00,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:00,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-13 07:16:00,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-11-13 07:16:00,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-11-13 07:16:00,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:16:06,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:06,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:16:06,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:06,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:06,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:06,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:06,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:16:06,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:16:06,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:16:06,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:16:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:16:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:16:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-13 07:16:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:16:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:16:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 07:16:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:16:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 07:16:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-13 07:16:06,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-13 07:16:06,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:16:06,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 07:16:06,758 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:16:06,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:16:06,759 INFO L85 PathProgramCache]: Analyzing trace with hash -14067297, now seen corresponding path program 6 times [2024-11-13 07:16:06,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:16:06,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760612163] [2024-11-13 07:16:06,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:16:06,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:16:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:16:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 194 proven. 151 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-13 07:16:12,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:16:12,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760612163] [2024-11-13 07:16:12,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760612163] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:16:12,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836959843] [2024-11-13 07:16:12,841 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-13 07:16:12,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:16:12,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:16:12,842 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 07:16:12,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 07:16:23,641 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-13 07:16:23,641 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 07:16:23,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 2731 conjuncts, 132 conjuncts are in the unsatisfiable core [2024-11-13 07:16:23,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:16:24,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 07:16:24,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:16:24,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:16:24,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:16:24,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:16:25,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:16:25,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 07:16:25,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:16:25,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2024-11-13 07:16:25,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:16:25,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:16:25,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:16:25,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:16:25,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:16:25,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 07:16:25,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:16:25,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2024-11-13 07:16:25,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:16:25,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:16:26,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:16:26,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:16:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 194 proven. 151 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-13 07:16:26,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:16:28,592 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2576 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2576) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2576 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2576) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-13 07:16:28,606 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2576 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2576) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2576 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2576) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-13 07:16:30,722 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2572 Int) (v_ArrVal_2576 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2572) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2576) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2572 Int) (v_ArrVal_2576 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2572) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2576) |c_~#queue~0.base|) .cse4) 4))))))) is different from false [2024-11-13 07:18:41,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:18:41,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 386 treesize of output 286 [2024-11-13 07:18:41,879 INFO L349 Elim1Store]: treesize reduction 105, result has 53.5 percent of original size [2024-11-13 07:18:41,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 397 treesize of output 407 [2024-11-13 07:18:41,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2024-11-13 07:18:41,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:18:41,930 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 104 treesize of output 98 [2024-11-13 07:18:41,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2024-11-13 07:18:41,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:18:41,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2024-11-13 07:18:41,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2024-11-13 07:18:41,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2024-11-13 07:18:41,999 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,006 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 07:18:42,007 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 154 treesize of output 1 [2024-11-13 07:18:42,013 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,018 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 07:18:42,019 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 69 treesize of output 1 [2024-11-13 07:18:42,024 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,031 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 07:18:42,031 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 69 treesize of output 1 [2024-11-13 07:18:42,054 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 07:18:42,062 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:18:42,071 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 69 treesize of output 65 [2024-11-13 07:18:42,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2024-11-13 07:18:42,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:18:42,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2024-11-13 07:18:42,135 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:18:42,142 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,142 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,143 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:18:42,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 37 [2024-11-13 07:18:42,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2024-11-13 07:18:42,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 9 [2024-11-13 07:18:42,187 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:18:42,192 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-11-13 07:18:42,210 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,212 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 07:18:42,230 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,233 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 07:18:42,241 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,243 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 07:18:42,249 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,251 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 07:18:42,270 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,272 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 07:18:42,279 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,281 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 07:18:42,287 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,290 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 07:18:42,314 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:18:42,317 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,318 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,318 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,324 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 07:18:42,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 1 [2024-11-13 07:18:42,332 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:18:42,336 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,336 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,336 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:18:42,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 23 [2024-11-13 07:18:42,348 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 07:18:42,355 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,355 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:18:42,360 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,360 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,360 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,361 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,361 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,361 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,362 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,373 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 07:18:42,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 1 [2024-11-13 07:18:42,400 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,403 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 07:18:42,412 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,415 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 07:18:42,420 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,424 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 07:18:42,429 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:18:42,431 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 07:18:42,441 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-13 07:18:42,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 389 treesize of output 1 [2024-11-13 07:18:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 12 proven. 242 refuted. 76 times theorem prover too weak. 79 trivial. 15 not checked. [2024-11-13 07:18:55,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836959843] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:18:55,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:18:55,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 28] total 60 [2024-11-13 07:18:55,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976306804] [2024-11-13 07:18:55,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:18:55,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-13 07:18:55,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:18:55,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-13 07:18:55,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=524, Invalid=2762, Unknown=148, NotChecked=348, Total=3782 [2024-11-13 07:18:55,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:18:55,776 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:18:55,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 8.0) internal successors, (488), 61 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:18:55,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:18:55,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-13 07:18:55,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-11-13 07:18:55,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-11-13 07:18:55,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:18:55,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:18:58,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 07:19:15,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 07:19:17,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 07:19:19,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 07:19:22,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 07:19:24,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 07:19:47,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 07:19:50,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 07:19:52,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 07:19:59,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 07:20:01,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 07:20:03,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 07:20:07,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 07:20:12,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 07:20:24,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 07:20:27,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:20:27,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:20:27,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:20:27,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:20:27,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:20:27,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:20:27,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:20:27,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:20:27,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:20:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:20:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:20:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:20:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:20:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:20:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:20:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-13 07:20:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:20:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:20:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 07:20:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:20:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:20:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 07:20:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-11-13 07:20:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-13 07:20:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:20:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 07:20:27,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 07:20:27,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-13 07:20:27,867 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:20:27,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:20:27,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1031623144, now seen corresponding path program 7 times [2024-11-13 07:20:27,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:20:27,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920960276] [2024-11-13 07:20:27,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:20:27,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:20:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:20:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3178 backedges. 2082 proven. 271 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2024-11-13 07:20:41,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:20:41,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920960276] [2024-11-13 07:20:41,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920960276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:20:41,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724118947] [2024-11-13 07:20:41,350 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-13 07:20:41,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:20:41,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:20:41,351 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 07:20:41,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 07:20:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:20:42,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 4659 conjuncts, 144 conjuncts are in the unsatisfiable core [2024-11-13 07:20:42,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:20:43,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 07:20:43,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:20:43,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:20:43,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:20:43,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:20:43,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:20:43,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 07:20:43,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:20:43,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2024-11-13 07:20:43,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:20:43,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:20:43,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:20:43,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:20:44,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:20:44,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 07:20:44,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:20:44,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 3 [2024-11-13 07:20:44,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:20:44,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:20:44,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:20:44,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-13 07:20:44,805 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-13 07:20:44,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2024-11-13 07:20:44,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 07:20:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3178 backedges. 1888 proven. 94 refuted. 0 times theorem prover too weak. 1196 trivial. 0 not checked. [2024-11-13 07:20:44,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:20:45,033 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3227 (Array Int Int))) (not (= 400 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3227) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))) is different from false [2024-11-13 07:20:53,808 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| Int) (v_ArrVal_3224 Int) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3218) |c_~#queue~0.base|)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (or (not (= (select (store (store (store .cse0 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 1) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse4) 400)) (< (select .cse0 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213|) (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 1) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1 v_ArrVal_3224) .cse4 1)) |c_~#stored_elements~0.base| v_ArrVal_3227) |c_~#queue~0.base|) .cse2))) (not (= 400 (select .cse0 .cse2)))))) is different from false [2024-11-13 07:20:53,855 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| Int) (v_ArrVal_3217 Int) (v_ArrVal_3224 Int) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_3217)))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_3218) |c_~#queue~0.base|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 1) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse4 v_ArrVal_3224) .cse5 1)) |c_~#stored_elements~0.base| v_ArrVal_3227) |c_~#queue~0.base|) .cse2))) (not (= 400 (select .cse1 .cse2))) (< (select .cse1 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213|) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_3217) (not (= 400 (select (store (store (store .cse1 .cse4 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 1) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5))))))) is different from false [2024-11-13 07:20:53,886 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| Int) (v_ArrVal_3217 Int) (v_ArrVal_3224 Int) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_3217)))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_3218) |c_~#queue~0.base|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 1) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse4 v_ArrVal_3224) .cse5 1)) |c_~#stored_elements~0.base| v_ArrVal_3227) |c_~#queue~0.base|) .cse2))) (not (= 400 (select .cse1 .cse2))) (< (select .cse1 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213|) (< (+ (select .cse6 .cse7) 1) v_ArrVal_3217) (not (= 400 (select (store (store (store .cse1 .cse4 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 1) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5)))))))) is different from false [2024-11-13 07:20:53,967 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| Int) (v_ArrVal_3217 Int) (v_ArrVal_3215 Int) (v_ArrVal_3224 Int) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3215) .cse7 v_ArrVal_3217)))) (let ((.cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse0 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_3218) |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store (store (store .cse0 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 1) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse4))) (not (= 400 (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 1) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1 v_ArrVal_3224) .cse4 1)) |c_~#stored_elements~0.base| v_ArrVal_3227) |c_~#queue~0.base|) .cse2))) (not (= 400 (select .cse0 .cse2))) (< (select .cse0 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213|) (< (+ (select .cse6 .cse7) 1) v_ArrVal_3217)))))) is different from false [2024-11-13 07:20:54,035 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| Int) (v_ArrVal_3217 Int) (v_ArrVal_3215 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_139| Int) (v_ArrVal_3224 Int) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3215) .cse7 v_ArrVal_3217)))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|)) (.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_3218) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select .cse0 .cse1))) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 1) .cse3 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse4 v_ArrVal_3224) .cse5 1)) |c_~#stored_elements~0.base| v_ArrVal_3227) |c_~#queue~0.base|) .cse1))) (not (= 400 (select (store (store (store .cse0 .cse4 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 1) .cse3 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse5))) (< (select .cse0 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213|) (< (+ (select .cse6 .cse7) 1) v_ArrVal_3217)))))) is different from false [2024-11-13 07:20:54,083 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| Int) (v_ArrVal_3217 Int) (v_ArrVal_3215 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_139| Int) (v_ArrVal_3224 Int) (v_ArrVal_3227 (Array Int Int)) (v_ArrVal_3218 (Array Int Int)) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3215) .cse1 v_ArrVal_3217)))) (let ((.cse2 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_3218) |c_~#queue~0.base|)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213|) (not (= 400 (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse2 .cse5 1) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse7 v_ArrVal_3224) .cse3 1)) |c_~#stored_elements~0.base| v_ArrVal_3227) |c_~#queue~0.base|) .cse5))) (not (= 400 (select .cse2 .cse5))) (not (= 400 (select (store (store (store .cse2 .cse7 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse5 1) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse3))) (< (+ 1 (select .cse8 .cse1)) v_ArrVal_3217))))))))) is different from false [2024-11-13 07:21:18,078 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse10 .cse11))) (or (= 400 .cse0) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_164| Int) (v_ArrVal_3217 Int) (v_ArrVal_3215 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_139| Int) (v_ArrVal_3224 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_3210 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| Int) (v_ArrVal_3227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216| Int) (v_ArrVal_3218 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse10 .cse11 (+ .cse0 1))))) (let ((.cse7 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_3210) |c_~#queue~0.base|)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse8 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216| 4) |c_~#queue~0.offset|)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse7 .cse4 .cse8) .cse9 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse6 v_ArrVal_3215) .cse2 v_ArrVal_3217)) |c_~#stored_elements~0.base| v_ArrVal_3218) |c_~#queue~0.base|)) (.cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213|) (not (= 400 (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store (store .cse1 .cse4 1) .cse5 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse6 v_ArrVal_3224) .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_3227) |c_~#queue~0.base|) .cse4))) (not (= 400 (select .cse1 .cse4))) (not (= 400 (select (store (store (store .cse1 .cse6 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_164|)) .cse4 1) .cse5 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse2))) (< (+ (select (store (store (store .cse7 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 .cse8) .cse9 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse2) 1) v_ArrVal_3217) (< (select .cse7 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216|))))))))) is different from false [2024-11-13 07:21:18,139 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse10 .cse11))) (or (= 400 .cse0) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_164| Int) (v_ArrVal_3206 Int) (v_ArrVal_3217 Int) (v_ArrVal_3215 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_139| Int) (v_ArrVal_3224 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_3210 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| Int) (v_ArrVal_3227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216| Int) (v_ArrVal_3218 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3206) .cse11 (+ .cse0 1))))) (let ((.cse4 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_3210) |c_~#queue~0.base|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse8 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216| 4) |c_~#queue~0.offset|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse4 .cse2 .cse8) .cse9 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 v_ArrVal_3215) .cse3 v_ArrVal_3217)) |c_~#stored_elements~0.base| v_ArrVal_3218) |c_~#queue~0.base|)) (.cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|))) (or (not (= (select .cse1 .cse2) 400)) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216|) (not (= 400 (select (store (store (store .cse1 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_164|)) .cse2 1) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse3))) (not (= 400 (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 1) .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse5 v_ArrVal_3224) .cse3 1)) |c_~#stored_elements~0.base| v_ArrVal_3227) |c_~#queue~0.base|) .cse2))) (< (+ (select (store (store (store .cse4 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse8) .cse9 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse3) 1) v_ArrVal_3217))))))))) is different from false [2024-11-13 07:21:18,697 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_219| Int)) (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse10 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_219| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (let ((.cse0 (select .cse10 .cse11))) (or (= 400 .cse0) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_164| Int) (v_ArrVal_3206 Int) (v_ArrVal_3217 Int) (v_ArrVal_3215 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_139| Int) (v_ArrVal_3224 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_142| Int) (v_ArrVal_3210 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| Int) (v_ArrVal_3227 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216| Int) (v_ArrVal_3218 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3206) .cse11 (+ .cse0 1))))) (let ((.cse7 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_3210) |c_~#queue~0.base|)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse8 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216| 4) |c_~#queue~0.offset|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|)) (.cse2 (select (store (store .cse1 |c_~#queue~0.base| (store (store (store (store .cse7 .cse3 .cse8) .cse9 |v_t1Thread1of1ForFork0_enqueue_~x#1_142|) .cse5 v_ArrVal_3215) .cse6 v_ArrVal_3217)) |c_~#stored_elements~0.base| v_ArrVal_3218) |c_~#queue~0.base|))) (or (not (= (select (select (store (store .cse1 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 1) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse5 v_ArrVal_3224) .cse6 1)) |c_~#stored_elements~0.base| v_ArrVal_3227) |c_~#queue~0.base|) .cse3) 400)) (not (= 400 (select .cse2 .cse3))) (not (= (select (store (store (store .cse2 .cse5 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_164|)) .cse3 1) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_139|) .cse6) 400)) (< (+ (select (store (store (store .cse7 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse8) .cse9 |v_t1Thread1of1ForFork0_enqueue_~x#1_142|) .cse6) 1) v_ArrVal_3217) (< (select .cse2 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_213|) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_216|)))))))))) (< (select .cse12 .cse11) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_219|)))) is different from false [2024-11-13 07:21:29,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:21:29,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 815 treesize of output 575 [2024-11-13 07:21:29,435 INFO L349 Elim1Store]: treesize reduction 40, result has 58.3 percent of original size [2024-11-13 07:21:29,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1247 treesize of output 1111 [2024-11-13 07:21:29,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:21:29,490 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 484 treesize of output 470 [2024-11-13 07:21:29,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 55 treesize of output 51 [2024-11-13 07:21:29,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 113 [2024-11-13 07:21:29,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 42 treesize of output 34 [2024-11-13 07:21:29,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 4 [2024-11-13 07:21:29,740 INFO L349 Elim1Store]: treesize reduction 38, result has 42.4 percent of original size [2024-11-13 07:21:29,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 44 [2024-11-13 07:21:29,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:21:29,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 168 [2024-11-13 07:21:29,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2024-11-13 07:21:29,973 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:21:29,975 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-13 07:21:29,994 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:21:29,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 206 [2024-11-13 07:21:30,015 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:21:30,019 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 07:21:30,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:21:30,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 80 [2024-11-13 07:21:44,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3178 backedges. 1693 proven. 277 refuted. 71 times theorem prover too weak. 1067 trivial. 70 not checked. [2024-11-13 07:21:44,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724118947] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:21:44,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:21:44,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 41] total 83 [2024-11-13 07:21:44,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002040467] [2024-11-13 07:21:44,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:21:44,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2024-11-13 07:21:44,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:21:44,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2024-11-13 07:21:44,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1011, Invalid=4299, Unknown=132, NotChecked=1530, Total=6972 [2024-11-13 07:21:44,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:21:44,582 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:21:44,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 7.035714285714286) internal successors, (591), 83 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:21:44,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:21:44,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:21:44,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:21:44,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:21:44,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:21:44,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:21:44,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:21:44,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:21:44,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:21:44,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:21:44,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:21:44,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:21:44,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:21:44,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:21:44,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:21:44,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-11-13 07:21:44,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:21:44,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:21:44,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 07:21:44,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:21:44,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:21:44,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-13 07:21:44,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2024-11-13 07:21:44,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-11-13 07:21:44,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:21:44,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-13 07:21:44,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:22:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:22:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:22:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:22:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:22:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:22:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:22:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:22:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:22:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:22:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:22:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:22:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:22:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:22:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:22:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:22:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-13 07:22:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:22:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:22:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 07:22:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:22:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:22:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 07:22:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-11-13 07:22:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-13 07:22:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:22:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 07:22:34,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-11-13 07:22:34,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 07:22:35,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:22:35,058 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:22:35,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:22:35,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2063787373, now seen corresponding path program 8 times [2024-11-13 07:22:35,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:22:35,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733607091] [2024-11-13 07:22:35,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:22:35,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:22:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:22:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 1886 proven. 262 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2024-11-13 07:22:50,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:22:50,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733607091] [2024-11-13 07:22:50,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733607091] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:22:50,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258082578] [2024-11-13 07:22:50,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 07:22:50,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:22:50,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:22:50,539 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 07:22:50,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 07:22:51,901 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 07:22:51,901 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 07:22:51,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 4469 conjuncts, 144 conjuncts are in the unsatisfiable core [2024-11-13 07:22:51,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:22:52,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 07:22:52,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:22:52,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:22:52,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:22:52,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2024-11-13 07:22:52,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:22:52,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:22:52,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:22:52,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 07:22:52,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:22:52,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2024-11-13 07:22:52,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:22:52,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:22:52,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:22:53,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:22:53,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:22:53,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 07:22:53,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:22:53,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2024-11-13 07:22:53,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:22:53,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:22:53,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:22:53,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:22:53,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:22:53,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:22:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 939 proven. 73 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked. [2024-11-13 07:22:53,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:22:54,430 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3831 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3831) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse1))))) is different from false [2024-11-13 07:22:54,447 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3831 (Array Int Int)) (v_ArrVal_3828 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3828) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3831) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse1))))) is different from false [2024-11-13 07:22:54,463 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3831 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_177| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_3828 Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3828) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3831) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_177|)) .cse1))))) is different from false [2024-11-13 07:22:54,477 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274|) (forall ((v_ArrVal_3831 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_177| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_3828 Int)) (not (= 400 (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3828) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3831) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_177|)) .cse3)))))))) is different from false [2024-11-13 07:22:55,847 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| Int) (v_ArrVal_3831 (Array Int Int)) (v_ArrVal_3823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_177| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_3828 Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse4 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_3823) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_3828) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3831) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_177|)) .cse1))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274|))))) is different from false [2024-11-13 07:22:55,893 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| Int) (v_ArrVal_3820 Int) (v_ArrVal_3831 (Array Int Int)) (v_ArrVal_3823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_177| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_3828 Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3820) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_3823) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274|) (not (= 400 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_3828) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3831) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_177|)) .cse1))))))) is different from false [2024-11-13 07:22:55,926 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_180| Int) (v_ArrVal_3820 Int) (v_ArrVal_3831 (Array Int Int)) (v_ArrVal_3823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_177| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_3828 Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3820) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_3823) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274|) (not (= 400 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_180|))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_3828) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3831) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_177|)) .cse1))))))) is different from false [2024-11-13 07:22:55,953 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_277| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_180| Int) (v_ArrVal_3820 Int) (v_ArrVal_3831 (Array Int Int)) (v_ArrVal_3823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_177| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_3828 Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_277| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3820) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_3823) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274|) (not (= 400 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_180|))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_3828) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3831) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_177|)) .cse1))))))) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_277|)))) is different from false [2024-11-13 07:22:56,297 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3817 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_180| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_277| Int) (v_ArrVal_3820 Int) (v_ArrVal_3831 (Array Int Int)) (v_ArrVal_3823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_177| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_3828 Int)) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3817) |c_~#queue~0.base|))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_277| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse6 .cse3 v_ArrVal_3820) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3823) |c_~#queue~0.base|))) (or (not (= 400 (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_180|))) (store (store .cse2 .cse3 v_ArrVal_3828) .cse1 (+ (select .cse2 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3831) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_177|)) .cse1))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_277|))))) is different from false [2024-11-13 07:22:56,356 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3817 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_180| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_277| Int) (v_ArrVal_3820 Int) (v_ArrVal_3831 (Array Int Int)) (v_ArrVal_3823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_177| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_3828 Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse6 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_3817) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse7 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_277| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 .cse5 v_ArrVal_3820) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3823) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274|) (not (= 400 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_180|))) (store (store .cse4 .cse5 v_ArrVal_3828) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3831) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_177|)) .cse1))) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_277|)))))) is different from false [2024-11-13 07:22:56,678 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3815 Int) (v_ArrVal_3817 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_180| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_277| Int) (v_ArrVal_3820 Int) (v_ArrVal_3831 (Array Int Int)) (v_ArrVal_3823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_177| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_3828 Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3815) .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_3817) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_277| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 .cse6 v_ArrVal_3820) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3823) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_277|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274|) (not (= 400 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_274| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_180|))) (store (store .cse5 .cse6 v_ArrVal_3828) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3831) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_177|)) .cse1)))))))) is different from false [2024-11-13 07:23:00,108 INFO L349 Elim1Store]: treesize reduction 306, result has 39.5 percent of original size [2024-11-13 07:23:00,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 1535 treesize of output 729 [2024-11-13 07:23:00,149 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-13 07:23:00,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 807 treesize of output 771 [2024-11-13 07:23:00,311 INFO L349 Elim1Store]: treesize reduction 68, result has 52.4 percent of original size [2024-11-13 07:23:00,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 793 treesize of output 688 [2024-11-13 07:23:00,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:23:00,373 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 922 treesize of output 918 [2024-11-13 07:23:00,535 INFO L349 Elim1Store]: treesize reduction 40, result has 29.8 percent of original size [2024-11-13 07:23:00,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 345 treesize of output 284 [2024-11-13 07:23:00,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:23:00,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 245 treesize of output 239 [2024-11-13 07:23:00,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 214 treesize of output 190 [2024-11-13 07:23:00,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 32 treesize of output 24 [2024-11-13 07:23:00,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 42 treesize of output 34 [2024-11-13 07:23:00,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-13 07:23:00,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:23:00,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 179 [2024-11-13 07:23:01,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 07:23:01,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 235 [2024-11-13 07:23:01,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 939 proven. 52 refuted. 2 times theorem prover too weak. 1741 trivial. 19 not checked. [2024-11-13 07:23:01,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258082578] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 07:23:01,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 07:23:01,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 22, 33] total 85 [2024-11-13 07:23:01,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152829760] [2024-11-13 07:23:01,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 07:23:01,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2024-11-13 07:23:01,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 07:23:01,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2024-11-13 07:23:01,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=4842, Unknown=46, NotChecked=1716, Total=7310 [2024-11-13 07:23:01,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:23:01,333 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 07:23:01,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 5.848837209302325) internal successors, (503), 85 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 07:23:01,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:23:01,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:23:01,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:23:01,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:23:01,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:23:01,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:23:01,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:23:01,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:23:01,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:23:01,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:23:01,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:23:01,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:23:01,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:23:01,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:23:01,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:23:01,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-11-13 07:23:01,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:23:01,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:23:01,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 07:23:01,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:23:01,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:23:01,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-13 07:23:01,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-11-13 07:23:01,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-11-13 07:23:01,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:23:01,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-13 07:23:01,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2024-11-13 07:23:01,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 07:23:02,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 07:23:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:23:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 07:23:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:23:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:23:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:23:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:23:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:23:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 07:23:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:23:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 07:23:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:23:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:23:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:23:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:23:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 07:23:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-13 07:23:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 07:23:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 07:23:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 07:23:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 07:23:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:23:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 07:23:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-11-13 07:23:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-13 07:23:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 07:23:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-13 07:23:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-11-13 07:23:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-13 07:23:13,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-13 07:23:13,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-13 07:23:13,320 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 07:23:13,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 07:23:13,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1127493040, now seen corresponding path program 1 times [2024-11-13 07:23:13,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 07:23:13,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987103791] [2024-11-13 07:23:13,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:23:13,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 07:23:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:23:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 07:23:20,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 07:23:20,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987103791] [2024-11-13 07:23:20,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987103791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 07:23:20,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943010732] [2024-11-13 07:23:20,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 07:23:20,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 07:23:20,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 07:23:20,312 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 07:23:20,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 07:23:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 07:23:20,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 2548 conjuncts, 151 conjuncts are in the unsatisfiable core [2024-11-13 07:23:20,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 07:23:20,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 07:23:21,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:23:21,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:23:21,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 07:23:21,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:23:21,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2024-11-13 07:23:21,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:23:21,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:23:21,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:23:21,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 07:23:21,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:23:21,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2024-11-13 07:23:21,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:23:21,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:23:22,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:23:22,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:23:22,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:23:22,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 07:23:22,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:23:22,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2024-11-13 07:23:22,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:23:22,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:23:23,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:23:23,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:23:23,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:23:23,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-13 07:23:23,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:23:23,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2024-11-13 07:23:23,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 07:23:23,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 07:23:23,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:23:23,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 07:23:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-13 07:23:23,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 07:23:31,049 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_4047 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_4047 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2024-11-13 07:23:31,060 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_4047 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_4047 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-13 07:23:31,093 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_4047 (Array Int Int)) (v_ArrVal_4043 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_4043) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse4) 4)))) (forall ((v_ArrVal_4047 (Array Int Int)) (v_ArrVal_4043 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_4043) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2024-11-13 07:23:31,126 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_4047 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_4043 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse0 .cse1 v_ArrVal_4043) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse5) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_4047 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_4043 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse6 .cse1 v_ArrVal_4043) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse5) 4)))))) is different from false [2024-11-13 07:23:31,164 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select .cse4 .cse3))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|) (forall ((v_ArrVal_4047 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_4043 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse1 .cse2 v_ArrVal_4043) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int)) (or (forall ((v_ArrVal_4047 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_4043 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse6 .cse2 v_ArrVal_4043) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|)))))) is different from false [2024-11-13 07:24:33,186 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_4039 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4039) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|) (forall ((v_ArrVal_4047 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_4043 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 v_ArrVal_4043) .cse1 (+ (select (store (store (store .cse0 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_4039 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4039) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_4047 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_4043 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse6 .cse2 .cse7) .cse8 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 v_ArrVal_4043) .cse1 (+ (select (store (store (store .cse6 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse7) .cse8 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|)))))) is different from false [2024-11-13 07:24:33,252 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_4039 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_4039) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_4047 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_4043 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse3 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 v_ArrVal_4043) .cse6 (+ (select (store (store (store .cse1 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse3) .cse4 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse6) 4)))) (< (select .cse1 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_4039 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse7 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_4039) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_4047 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_4043 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse8 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse7 .cse2 .cse8) .cse9 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5 v_ArrVal_4043) .cse6 (+ (select (store (store (store .cse7 .cse5 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 .cse8) .cse9 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse6) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|)))))) is different from false [2024-11-13 07:24:41,862 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse11 .cse10)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 1604)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_4039 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int) (v_ArrVal_4035 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse8 .cse9 v_ArrVal_4035) .cse10 (+ (select .cse8 .cse10) 1)))))) (let ((.cse2 (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_4039) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_4047 (Array Int Int)) (v_subst_9 Int) (v_ArrVal_4043 Int)) (<= (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse2 .cse3 .cse4) .cse5 v_subst_9) .cse6 v_ArrVal_4043) .cse7 (+ (select (store (store (store .cse2 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse4) .cse5 v_subst_9) .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse2 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_4039 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int) (v_ArrVal_4035 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse16 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse16 .cse9 v_ArrVal_4035) .cse10 (+ (select .cse16 .cse10) 1)))))) (let ((.cse13 (select (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_4039) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_4047 (Array Int Int)) (v_subst_10 Int) (v_ArrVal_4043 Int)) (<= 0 (+ (* (select (select (store (store .cse12 |c_~#queue~0.base| (let ((.cse14 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse13 .cse3 .cse14) .cse15 v_subst_10) .cse6 v_ArrVal_4043) .cse7 (+ (select (store (store (store .cse13 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse14) .cse15 v_subst_10) .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset|))) (< (select .cse13 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|)))))))))) is different from false [2024-11-13 07:24:43,924 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (select .cse8 .cse2))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293|) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_4039 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int) (v_ArrVal_4035 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 .cse6 v_ArrVal_4035) .cse2 (+ (select .cse7 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4039) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|) (forall ((v_ArrVal_4047 (Array Int Int)) (v_subst_10 Int) (v_ArrVal_4043 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse3 .cse4) .cse5 v_subst_10) .cse6 v_ArrVal_4043) .cse2 (+ (select (store (store (store .cse1 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse4) .cse5 v_subst_10) .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|)))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int)) (or (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_4039 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int) (v_ArrVal_4035 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse12 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse12 .cse6 v_ArrVal_4035) .cse2 (+ (select .cse12 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4039) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_4047 (Array Int Int)) (v_subst_9 Int) (v_ArrVal_4043 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse9 .cse3 .cse10) .cse11 v_subst_9) .cse6 v_ArrVal_4043) .cse2 (+ (select (store (store (store .cse9 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 .cse10) .cse11 v_subst_9) .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse9 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|)))) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293|)))))) is different from false [2024-11-13 07:25:11,326 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse9 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse10 (+ 1608 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|)) (.cse11 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse9 .cse10 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse11 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293|) (forall ((v_subst_14 Int) (v_subst_12 Int) (v_ArrVal_4039 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int) (v_ArrVal_4035 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse8 .cse7 v_ArrVal_4035) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4039) |c_~#queue~0.base|))) (or (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|) (forall ((v_ArrVal_4047 (Array Int Int)) (v_subst_10 Int) (v_ArrVal_4043 Int)) (<= 0 (+ (* (select (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse5 (+ v_subst_12 1)) (.cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse2 .cse4 .cse5) .cse6 v_subst_10) .cse7 v_ArrVal_4043) .cse1 (+ (select (store (store (store .cse2 .cse7 (+ (- 1) v_subst_14)) .cse4 .cse5) .cse6 v_subst_10) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)))))))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (let ((.cse14 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse9 .cse10 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse11 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))))) (let ((.cse12 (select .cse14 |c_~#queue~0.base|))) (or (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293|) (forall ((v_subst_13 Int) (v_ArrVal_4039 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| Int) (v_ArrVal_4035 Int) (v_subst_11 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse13 (select (store (store .cse14 |c_~#queue~0.base| (let ((.cse17 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_293| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse17 .cse7 v_ArrVal_4035) .cse1 (+ (select .cse17 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4039) |c_~#queue~0.base|))) (or (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290|) (forall ((v_ArrVal_4047 (Array Int Int)) (v_subst_9 Int) (v_ArrVal_4043 Int)) (<= (+ (* (select (select (store (store .cse14 |c_~#queue~0.base| (let ((.cse15 (+ v_subst_11 1)) (.cse16 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_290| 4) |c_~#queue~0.offset|))) (store (store (store (store .cse13 .cse4 .cse15) .cse16 v_subst_9) .cse7 v_ArrVal_4043) .cse1 (+ (select (store (store (store .cse13 .cse7 (+ (- 1) v_subst_13)) .cse4 .cse15) .cse16 v_subst_9) .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_4047) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))))))) is different from false Killed by 15