./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f 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_ok_longest.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 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 08:39:12,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 08:39:12,130 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf [2024-11-11 08:39:12,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 08:39:12,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 08:39:12,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 08:39:12,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 08:39:12,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 08:39:12,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 08:39:12,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 08:39:12,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 08:39:12,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 08:39:12,173 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 08:39:12,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 08:39:12,174 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 08:39:12,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 08:39:12,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 08:39:12,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 08:39:12,177 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-11 08:39:12,177 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-11 08:39:12,177 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-11 08:39:12,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 08:39:12,181 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-11 08:39:12,181 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 08:39:12,181 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-11 08:39:12,181 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 08:39:12,182 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 08:39:12,182 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 08:39:12,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 08:39:12,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 08:39:12,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 08:39:12,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-11 08:39:12,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 08:39:12,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 08:39:12,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 08:39:12,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 08:39:12,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 08:39:12,184 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-11 08:39:12,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-11 08:39:12,185 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-11 08:39:12,185 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-11 08:39:12,186 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 -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2024-11-11 08:39:12,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 08:39:12,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 08:39:12,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 08:39:12,486 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 08:39:12,498 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 08:39:12,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/queue_ok_longest.i [2024-11-11 08:39:13,957 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 08:39:14,244 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 08:39:14,245 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longest.i [2024-11-11 08:39:14,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c30db6855/9ee3da0d24da41e78279f7ca253f5e1d/FLAG7844583c3 [2024-11-11 08:39:14,278 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c30db6855/9ee3da0d24da41e78279f7ca253f5e1d [2024-11-11 08:39:14,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 08:39:14,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 08:39:14,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 08:39:14,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 08:39:14,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 08:39:14,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:39:14" (1/1) ... [2024-11-11 08:39:14,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b13316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:14, skipping insertion in model container [2024-11-11 08:39:14,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:39:14" (1/1) ... [2024-11-11 08:39:14,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 08:39:14,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 08:39:14,897 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 08:39:14,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 08:39:15,086 INFO L204 MainTranslator]: Completed translation [2024-11-11 08:39:15,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:15 WrapperNode [2024-11-11 08:39:15,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 08:39:15,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 08:39:15,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 08:39:15,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 08:39:15,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:15" (1/1) ... [2024-11-11 08:39:15,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:15" (1/1) ... [2024-11-11 08:39:15,319 INFO L138 Inliner]: procedures = 274, calls = 1654, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1801 [2024-11-11 08:39:15,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 08:39:15,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 08:39:15,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 08:39:15,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 08:39:15,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:15" (1/1) ... [2024-11-11 08:39:15,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:15" (1/1) ... [2024-11-11 08:39:15,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:15" (1/1) ... [2024-11-11 08:39:15,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:15" (1/1) ... [2024-11-11 08:39:15,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:15" (1/1) ... [2024-11-11 08:39:15,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:15" (1/1) ... [2024-11-11 08:39:15,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:15" (1/1) ... [2024-11-11 08:39:15,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:15" (1/1) ... [2024-11-11 08:39:15,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 08:39:15,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 08:39:15,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 08:39:15,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 08:39:15,452 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:15" (1/1) ... [2024-11-11 08:39:15,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-11 08:39:15,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:39:15,497 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-11 08:39:15,504 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-11 08:39:15,556 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-11 08:39:15,556 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-11 08:39:15,556 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-11 08:39:15,557 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-11 08:39:15,557 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-11 08:39:15,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-11 08:39:15,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-11 08:39:15,557 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-11 08:39:15,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 08:39:15,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-11 08:39:15,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 08:39:15,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 08:39:15,560 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-11 08:39:15,744 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 08:39:15,748 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 08:39:17,775 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-11 08:39:17,775 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 08:39:49,357 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 08:39:49,358 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 08:39:49,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:39:49 BoogieIcfgContainer [2024-11-11 08:39:49,358 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 08:39:49,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 08:39:49,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 08:39:49,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 08:39:49,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:39:14" (1/3) ... [2024-11-11 08:39:49,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf653a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:39:49, skipping insertion in model container [2024-11-11 08:39:49,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:15" (2/3) ... [2024-11-11 08:39:49,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf653a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:39:49, skipping insertion in model container [2024-11-11 08:39:49,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:39:49" (3/3) ... [2024-11-11 08:39:49,366 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2024-11-11 08:39:49,385 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 08:39:49,386 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2024-11-11 08:39:49,386 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-11 08:39:49,538 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-11 08:39:49,605 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 08:39:49,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-11 08:39:49,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:39:49,608 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-11 08:39:49,609 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-11 08:39:49,649 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-11 08:39:49,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-11-11 08:39:49,669 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;@41282fbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 08:39:49,670 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-11-11 08:39:50,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:39:50,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:39:50,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1364929463, now seen corresponding path program 1 times [2024-11-11 08:39:50,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:39:50,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231555253] [2024-11-11 08:39:50,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:50,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:39:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:50,908 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-11 08:39:50,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:39:50,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231555253] [2024-11-11 08:39:50,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231555253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:39:50,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:39:50,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 08:39:50,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712860670] [2024-11-11 08:39:50,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:39:50,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:39:50,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:39:50,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:39:50,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:39:50,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:50,955 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:39:50,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11 08:39:50,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:51,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:51,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 08:39:51,245 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:39:51,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:39:51,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1364929464, now seen corresponding path program 1 times [2024-11-11 08:39:51,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:39:51,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935344467] [2024-11-11 08:39:51,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:51,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:39:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:54,393 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-11 08:39:54,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:39:54,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935344467] [2024-11-11 08:39:54,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935344467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:39:54,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:39:54,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 08:39:54,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492091277] [2024-11-11 08:39:54,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:39:54,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 08:39:54,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:39:54,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 08:39:54,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 08:39:54,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:54,400 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:39:54,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-11 08:39:54,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:54,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:56,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:56,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:56,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 08:39:56,698 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:39:56,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:39:56,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1169571525, now seen corresponding path program 1 times [2024-11-11 08:39:56,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:39:56,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888295532] [2024-11-11 08:39:56,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:56,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:39:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:57,134 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-11 08:39:57,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:39:57,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888295532] [2024-11-11 08:39:57,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888295532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:39:57,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:39:57,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-11 08:39:57,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631011571] [2024-11-11 08:39:57,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:39:57,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:39:57,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:39:57,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:39:57,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:39:57,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:57,142 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:39:57,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-11 08:39:57,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:57,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:57,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:58,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:58,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:58,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:58,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 08:39:58,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:39:58,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:39:58,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1169571526, now seen corresponding path program 1 times [2024-11-11 08:39:58,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:39:58,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271883324] [2024-11-11 08:39:58,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:58,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:39:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:39:59,100 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-11 08:39:59,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:39:59,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271883324] [2024-11-11 08:39:59,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271883324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:39:59,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:39:59,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 08:39:59,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675806088] [2024-11-11 08:39:59,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:39:59,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 08:39:59,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:39:59,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 08:39:59,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 08:39:59,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:59,104 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:39:59,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11 08:39:59,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:59,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:59,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:59,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:39:59,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:59,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:39:59,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:39:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:39:59,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 08:39:59,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:39:59,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:39:59,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1934480841, now seen corresponding path program 1 times [2024-11-11 08:39:59,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:39:59,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917895621] [2024-11-11 08:39:59,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:39:59,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:39:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:40:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:40:02,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:40:02,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917895621] [2024-11-11 08:40:02,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917895621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:40:02,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373970724] [2024-11-11 08:40:02,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:40:02,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:40:02,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:40:02,126 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-11 08:40:02,128 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-11 08:40:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:40:02,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 3449 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-11 08:40:02,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:40:02,968 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-11 08:40:03,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:03,017 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-11 08:40:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:40:03,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:40:03,196 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_90 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_90) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_90 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_90) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-11 08:40:03,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:03,219 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-11 08:40:03,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:03,232 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 46 treesize of output 45 [2024-11-11 08:40:03,249 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-11 08:40:03,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:03,258 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 29 treesize of output 30 [2024-11-11 08:40:03,265 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:03,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:03,271 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 27 treesize of output 15 [2024-11-11 08:40:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:40:03,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373970724] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:40:03,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:40:03,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-11-11 08:40:03,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472512914] [2024-11-11 08:40:03,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:40:03,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-11 08:40:03,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:40:03,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-11 08:40:03,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=283, Unknown=1, NotChecked=34, Total=380 [2024-11-11 08:40:03,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:03,477 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:40:03,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.105263157894737) internal successors, (78), 19 states have internal predecessors, (78), 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-11 08:40:03,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:03,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:03,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:03,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:03,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:04,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:04,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:04,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:04,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:04,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 08:40:04,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 08:40:04,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:40:04,252 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:40:04,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:40:04,252 INFO L85 PathProgramCache]: Analyzing trace with hash -582725739, now seen corresponding path program 1 times [2024-11-11 08:40:04,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:40:04,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703023247] [2024-11-11 08:40:04,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:40:04,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:40:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:40:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:40:05,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:40:05,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703023247] [2024-11-11 08:40:05,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703023247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:40:05,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334885307] [2024-11-11 08:40:05,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:40:05,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:40:05,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:40:05,098 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-11 08:40:05,099 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-11 08:40:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:40:05,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 3493 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-11 08:40:05,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:40:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:40:05,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:40:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:40:06,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334885307] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:40:06,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:40:06,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2024-11-11 08:40:06,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702526292] [2024-11-11 08:40:06,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:40:06,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 08:40:06,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:40:06,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 08:40:06,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-11 08:40:06,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:06,138 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:40:06,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 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-11 08:40:06,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:06,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:06,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:06,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:06,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 08:40:06,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:07,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:07,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:07,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:07,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:07,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:40:07,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:07,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 08:40:07,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:40:07,798 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:40:07,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:40:07,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1711366447, now seen corresponding path program 1 times [2024-11-11 08:40:07,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:40:07,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859754164] [2024-11-11 08:40:07,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:40:07,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:40:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:40:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 08:40:08,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:40:08,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859754164] [2024-11-11 08:40:08,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859754164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:40:08,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:40:08,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 08:40:08,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118381582] [2024-11-11 08:40:08,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:40:08,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:40:08,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:40:08,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:40:08,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:40:08,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:08,394 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:40:08,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-11 08:40:08,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:08,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:08,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:08,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:08,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:40:08,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:08,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:08,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:08,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:08,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:08,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:08,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:40:08,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:08,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:08,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 08:40:08,804 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:40:08,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:40:08,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1419387955, now seen corresponding path program 1 times [2024-11-11 08:40:08,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:40:08,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914562213] [2024-11-11 08:40:08,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:40:08,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:40:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:40:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 08:40:12,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:40:12,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914562213] [2024-11-11 08:40:12,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914562213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:40:12,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:40:12,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 08:40:12,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967278127] [2024-11-11 08:40:12,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:40:12,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 08:40:12,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:40:12,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 08:40:12,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-11 08:40:12,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:12,551 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:40:12,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 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-11 08:40:12,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:12,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:12,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:12,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:12,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:40:12,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:12,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:12,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:12,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:12,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:12,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:12,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:12,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:40:12,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:12,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:12,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:12,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 08:40:12,889 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:40:12,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:40:12,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2031146453, now seen corresponding path program 2 times [2024-11-11 08:40:12,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:40:12,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168180505] [2024-11-11 08:40:12,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:40:12,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:40:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:40:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:40:16,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:40:16,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168180505] [2024-11-11 08:40:16,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168180505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:40:16,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066438510] [2024-11-11 08:40:16,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 08:40:16,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:40:16,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:40:16,825 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-11 08:40:16,826 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-11 08:40:17,644 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 08:40:17,644 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 08:40:17,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 3531 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-11 08:40:17,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:40:17,812 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-11 08:40:17,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:17,852 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-11 08:40:17,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:17,942 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-11 08:40:17,972 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-11 08:40:18,052 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-11 08:40:18,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:18,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-11 08:40:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:40:18,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:40:18,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 38 treesize of output 34 [2024-11-11 08:40:18,396 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_287 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_287) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_287 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_287) |c_~#queue~0.base|) .cse0) 801)))) is different from false [2024-11-11 08:40:18,710 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_30| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_30|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_283 Int) (v_ArrVal_287 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_30|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_283))) (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ 1 (select .cse1 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_287) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_30| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_30|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_283 Int) (v_ArrVal_287 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_30|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_283))) (store (store .cse6 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ 1 (select .cse6 .cse3))))) |c_~#stored_elements~0.base| v_ArrVal_287) |c_~#queue~0.base|) .cse5) 801))))))) is different from false [2024-11-11 08:40:19,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:19,115 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 110 treesize of output 80 [2024-11-11 08:40:19,150 INFO L349 Elim1Store]: treesize reduction 42, result has 58.0 percent of original size [2024-11-11 08:40:19,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 3 new quantified variables, introduced 4 case distinctions, treesize of input 127 treesize of output 141 [2024-11-11 08:40:19,168 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-11 08:40:19,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:19,178 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 71 treesize of output 71 [2024-11-11 08:40:19,188 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-11 08:40:19,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:19,218 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-11 08:40:19,239 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-11 08:40:19,246 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:19,248 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 68 treesize of output 58 [2024-11-11 08:40:19,258 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:19,259 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:19,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:19,262 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 26 treesize of output 14 [2024-11-11 08:40:19,269 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:19,271 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:19,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:19,280 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 114 treesize of output 84 [2024-11-11 08:40:19,283 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:19,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:19,294 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 3 case distinctions, treesize of input 76 treesize of output 71 [2024-11-11 08:40:19,303 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:19,305 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:19,309 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:19,312 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 73 treesize of output 63 [2024-11-11 08:40:19,320 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:19,320 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:19,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:19,324 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 26 treesize of output 14 [2024-11-11 08:40:19,330 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:19,332 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:19,502 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-11 08:40:19,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066438510] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:40:19,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:40:19,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 33 [2024-11-11 08:40:19,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343855030] [2024-11-11 08:40:19,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:40:19,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-11 08:40:19,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:40:19,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-11 08:40:19,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=846, Unknown=41, NotChecked=126, Total=1190 [2024-11-11 08:40:19,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:19,507 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:40:19,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.264705882352941) internal successors, (111), 34 states have internal predecessors, (111), 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-11 08:40:19,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:19,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:19,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:19,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:19,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:40:19,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:19,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:19,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:19,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:23,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:40:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:23,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:23,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 08:40:23,071 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-11 08:40:23,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:40:23,240 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:40:23,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:40:23,241 INFO L85 PathProgramCache]: Analyzing trace with hash 797166360, now seen corresponding path program 3 times [2024-11-11 08:40:23,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:40:23,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812051623] [2024-11-11 08:40:23,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:40:23,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:40:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:40:27,498 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-11 08:40:27,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:40:27,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812051623] [2024-11-11 08:40:27,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812051623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:40:27,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:40:27,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 08:40:27,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234834879] [2024-11-11 08:40:27,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:40:27,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 08:40:27,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:40:27,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 08:40:27,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-11 08:40:27,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:27,503 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:40:27,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 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-11 08:40:27,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:27,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:27,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:27,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:27,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:40:27,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:27,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:27,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:27,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-11-11 08:40:27,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:28,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:40:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 08:40:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 08:40:28,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 08:40:28,118 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:40:28,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:40:28,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1568714076, now seen corresponding path program 1 times [2024-11-11 08:40:28,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:40:28,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567822219] [2024-11-11 08:40:28,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:40:28,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:40:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:40:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-11 08:40:28,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:40:28,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567822219] [2024-11-11 08:40:28,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567822219] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:40:28,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072086269] [2024-11-11 08:40:28,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:40:28,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:40:28,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:40:28,690 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-11 08:40:28,692 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-11 08:40:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:40:29,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 3682 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 08:40:29,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:40:29,449 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-11 08:40:29,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:40:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-11 08:40:29,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072086269] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:40:29,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:40:29,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 2, 2] total 7 [2024-11-11 08:40:29,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803049029] [2024-11-11 08:40:29,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:40:29,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 08:40:29,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:40:29,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 08:40:29,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-11 08:40:29,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:29,543 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:40:29,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.142857142857142) internal successors, (78), 8 states have internal predecessors, (78), 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-11 08:40:29,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:29,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:29,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:29,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:29,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:40:29,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:29,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:29,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:29,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-11 08:40:29,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 08:40:29,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:40:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:29,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:29,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 08:40:29,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 08:40:29,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:29,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 08:40:29,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-11 08:40:29,938 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:40:29,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:40:29,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2010838983, now seen corresponding path program 4 times [2024-11-11 08:40:29,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:40:29,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34846095] [2024-11-11 08:40:29,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:40:29,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:40:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:40:35,616 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 62 proven. 54 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 08:40:35,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:40:35,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34846095] [2024-11-11 08:40:35,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34846095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:40:35,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116440485] [2024-11-11 08:40:35,616 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 08:40:35,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:40:35,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:40:35,618 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-11 08:40:35,619 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-11 08:40:36,123 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 08:40:36,123 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 08:40:36,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 3777 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-11 08:40:36,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:40:36,457 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-11 08:40:36,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:36,499 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-11 08:40:36,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:36,615 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-11 08:40:36,654 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-11 08:40:36,764 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-11 08:40:36,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:36,811 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-11 08:40:36,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:36,906 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-11 08:40:36,943 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-11 08:40:37,044 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-11 08:40:37,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:37,093 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-11 08:40:37,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:37,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-11 08:40:37,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-11 08:40:37,327 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-11 08:40:37,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:37,374 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-11 08:40:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 62 proven. 54 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 08:40:37,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:40:37,618 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_546 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse0))))) (forall ((v_ArrVal_546 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse0)) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-11 08:40:43,458 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse2 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse5 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|)))))))) is different from false [2024-11-11 08:40:43,519 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse3 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse1)))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse6 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse6 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse1))) (select |c_#length| |c_~#queue~0.base|)))))))) is different from false [2024-11-11 08:40:43,562 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)))))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse3 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= 0 (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse6 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse6 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)))))))) is different from false [2024-11-11 08:40:44,081 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.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 ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse8 .cse9 v_ArrVal_538))) (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse5 .cse7) 1)))))) (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_1 Int)) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse1 .cse2 (+ v_subst_1 1)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|))))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse8 .cse9 v_ArrVal_538))) (store (store .cse13 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse13 .cse7) 1)))))) (let ((.cse12 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_2 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse11 .cse2 (+ v_subst_2 1)) .cse3 (+ (select .cse11 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse12 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|))))))) is different from false [2024-11-11 08:40:46,149 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (select .cse8 .cse7)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_538))) (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse5 .cse7) 1)))))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_1 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse3 .cse4 (+ v_subst_1 1)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse1) 4)))))))) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_538))) (store (store .cse13 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse13 .cse7) 1)))))) (let ((.cse10 (select (store .cse11 |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_2 Int)) (<= (+ (* (select (select (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse12 .cse4 (+ v_subst_2 1)) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))))))) is different from false [2024-11-11 08:40:48,204 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select .cse6 .cse2))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_538))) (store (store .cse5 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_1 Int)) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse3 .cse4 (+ v_subst_1 1)) .cse2 (+ 1 (select .cse3 .cse2))))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse2)))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse9 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_538))) (store (store .cse9 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse9 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_2 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse7 .cse4 (+ v_subst_2 1)) .cse2 (+ 1 (select .cse7 .cse2))))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse8 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|)))) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|)))))) is different from false [2024-11-11 08:40:48,253 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_536 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_536) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_538))) (store (store .cse5 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_2 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse3 .cse4 (+ v_subst_2 1)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))))) (forall ((v_ArrVal_536 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse9 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_536) |c_~#queue~0.base|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse8 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_538))) (store (store .cse8 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_1 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse7 .cse4 (+ v_subst_1 1)) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse1) 4))))))) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|)))))) is different from false [2024-11-11 08:40:48,357 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_536 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_536) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse5 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_538))) (store (store .cse6 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_1 Int)) (<= 0 (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse3 .cse4 (+ v_subst_1 1)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|))))))) (forall ((v_ArrVal_536 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_536) |c_~#queue~0.base|))) (or (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse9 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse10 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_538))) (store (store .cse10 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_2 Int)) (<= (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse8 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse8 .cse4 (+ v_subst_2 1)) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|))))))))) is different from false [2024-11-11 08:40:48,424 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))))) (and (forall ((v_ArrVal_536 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_536) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_538))) (store (store .cse6 .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_2 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse4 .cse5 (+ v_subst_2 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))))))) (forall ((v_ArrVal_536 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse10 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_536) |c_~#queue~0.base|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse7 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse9 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_538))) (store (store .cse9 .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_1 Int)) (<= 0 (+ (* (select (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse8 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse8 .cse5 (+ v_subst_1 1)) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)))))) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|)))))) is different from false [2024-11-11 08:40:48,616 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse10 (+ (select .cse7 .cse9) 1))) (and (forall ((v_ArrVal_536 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 .cse10)))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_536) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_subst_3 Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_538))) (store (store .cse6 .cse5 (+ v_subst_3 1)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_1 Int)) (<= 0 (+ (* (select (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse4 .cse5 (+ v_subst_1 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)))))))))) (forall ((v_ArrVal_536 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse11 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 .cse10)))) (let ((.cse15 (select (store .cse11 |c_~#stored_elements~0.base| v_ArrVal_536) |c_~#queue~0.base|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_subst_4 Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse13 (select (store (store .cse11 |c_~#queue~0.base| (let ((.cse14 (store .cse15 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_538))) (store (store .cse14 .cse5 (+ v_subst_4 1)) .cse1 (+ (select .cse14 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_2 Int)) (<= (+ (* (select (select (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse13 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse12 .cse5 (+ v_subst_2 1)) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|)))) (< (select .cse15 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|)))))))) is different from false [2024-11-11 08:40:48,888 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_533 Int) (v_ArrVal_536 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (store .cse10 .cse11 v_ArrVal_533))) (store (store .cse7 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse7 .cse9) 1)))))) (let ((.cse6 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_536) |c_~#queue~0.base|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_subst_4 Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse4 (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse5 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_538))) (store (store .cse5 .cse2 (+ v_subst_4 1)) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_2 Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse1 .cse2 (+ v_subst_2 1)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |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_56|)))) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|))))) (forall ((v_ArrVal_533 Int) (v_ArrVal_536 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse17 (store .cse10 .cse11 v_ArrVal_533))) (store (store .cse17 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ (select .cse17 .cse9) 1)))))) (let ((.cse16 (select (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_536) |c_~#queue~0.base|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_subst_3 Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse14 (select (store (store .cse12 |c_~#queue~0.base| (let ((.cse15 (store .cse16 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_538))) (store (store .cse15 .cse2 (+ v_subst_3 1)) .cse3 (+ (select .cse15 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_1 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse13 .cse2 (+ v_subst_1 1)) .cse3 (+ (select .cse13 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse3) 4)))) (< (select .cse14 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|)))) (< (select .cse16 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|))))))) is different from false [2024-11-11 08:40:51,002 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse11 .cse10)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) (forall ((v_ArrVal_533 Int) (v_ArrVal_536 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_533))) (store (store .cse8 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ (select .cse8 .cse10) 1)))))) (let ((.cse7 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_536) |c_~#queue~0.base|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_subst_4 Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse6 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_538))) (store (store .cse6 .cse5 (+ v_subst_4 1)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_2 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse4 .cse5 (+ v_subst_2 1)) .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse2) 4) 4) (select |c_#length| |c_~#queue~0.base|)))))) (< (select .cse7 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) (forall ((v_ArrVal_533 Int) (v_ArrVal_536 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse17 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_533))) (store (store .cse17 .cse9 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ (select .cse17 .cse10) 1)))))) (let ((.cse16 (select (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_536) |c_~#queue~0.base|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_subst_3 Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse12 (select (store (store .cse13 |c_~#queue~0.base| (let ((.cse15 (store .cse16 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_538))) (store (store .cse15 .cse5 (+ v_subst_3 1)) .cse2 (+ (select .cse15 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (< (select .cse12 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_1 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse14 .cse5 (+ v_subst_1 1)) .cse2 (+ (select .cse14 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse2) 4))))))) (< (select .cse16 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|)))))))))) is different from false [2024-11-11 08:40:53,097 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (select .cse7 .cse2))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int)) (or (forall ((v_ArrVal_533 Int) (v_ArrVal_536 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) |c_~#queue~0.offset|) v_ArrVal_533))) (store (store .cse6 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_536) |c_~#queue~0.base|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_subst_4 Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse4 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_538))) (store (store .cse4 .cse1 (+ v_subst_4 1)) .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_2 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse0 .cse1 (+ v_subst_2 1)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse2) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|)))) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|)))) (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int)) (or (forall ((v_ArrVal_533 Int) (v_ArrVal_536 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse13 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) |c_~#queue~0.offset|) v_ArrVal_533))) (store (store .cse13 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse13 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_536) |c_~#queue~0.base|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_subst_3 Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse11 (store .cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_538))) (store (store .cse11 .cse1 (+ v_subst_3 1)) .cse2 (+ (select .cse11 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_1 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse9 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse9 .cse1 (+ v_subst_1 1)) .cse2 (+ (select .cse9 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))) (< (select .cse10 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|)))) (< (select .cse12 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|)))) (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|)))))) is different from false [2024-11-11 08:40:53,195 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_531 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_531) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_533 Int) (v_ArrVal_536 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) |c_~#queue~0.offset|) v_ArrVal_533))) (store (store .cse6 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_536) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_subst_4 Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_538))) (store (store .cse5 .cse4 (+ v_subst_4 1)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_2 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse3 .cse4 (+ v_subst_2 1)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))))) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62| Int) (v_ArrVal_531 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_531) |c_~#queue~0.base|))) (or (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) (forall ((v_ArrVal_533 Int) (v_ArrVal_536 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse13 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_62|) |c_~#queue~0.offset|) v_ArrVal_533))) (store (store .cse13 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_536) |c_~#queue~0.base|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_subst_3 Int) (v_ArrVal_538 Int) (v_ArrVal_541 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse11 (store .cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_538))) (store (store .cse11 .cse4 (+ v_subst_3 1)) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_541) |c_~#queue~0.base|))) (or (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 Int) (v_subst_1 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse10 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_542))) (store (store .cse10 .cse4 (+ v_subst_1 1)) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_546) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)))))) (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|))))))))) is different from false [2024-11-11 08:40:53,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:53,316 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 811 treesize of output 561 [2024-11-11 08:40:53,374 INFO L349 Elim1Store]: treesize reduction 127, result has 53.0 percent of original size [2024-11-11 08:40:53,374 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 662 treesize of output 666 [2024-11-11 08:40:53,449 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-11 08:40:53,456 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-11 08:40:53,460 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-11 08:40:53,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:53,478 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 85 treesize of output 83 [2024-11-11 08:40:53,485 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 14 treesize of output 10 [2024-11-11 08:40:53,502 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-11 08:40:53,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:53,523 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-11 08:40:53,548 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,550 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:53,559 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:53,569 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,570 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,570 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:53,578 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 30 [2024-11-11 08:40:53,581 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,584 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 27 treesize of output 15 [2024-11-11 08:40:53,596 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,599 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:53,604 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:53,611 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,612 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,612 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,622 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 08:40:53,622 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 1 [2024-11-11 08:40:53,627 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,629 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:53,646 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:53,653 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,653 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,654 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,659 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 08:40:53,660 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 1 [2024-11-11 08:40:53,667 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,669 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:53,675 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,676 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,676 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,677 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,677 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,677 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,685 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 08:40:53,686 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 92 treesize of output 1 [2024-11-11 08:40:53,692 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:53,695 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,696 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,696 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,700 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 16 [2024-11-11 08:40:53,708 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,710 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:53,713 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,715 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:53,719 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,721 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:53,742 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,745 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 97 treesize of output 85 [2024-11-11 08:40:53,755 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,756 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:53,759 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 33 treesize of output 17 [2024-11-11 08:40:53,764 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,768 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 266 treesize of output 242 [2024-11-11 08:40:53,782 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,783 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,784 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,784 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,785 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:53,789 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 44 treesize of output 24 [2024-11-11 08:40:53,798 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,801 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 82 treesize of output 70 [2024-11-11 08:40:53,811 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,812 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:53,816 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 23 treesize of output 11 [2024-11-11 08:40:53,828 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,831 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 91 treesize of output 77 [2024-11-11 08:40:53,840 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,841 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:53,845 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 23 treesize of output 11 [2024-11-11 08:40:53,852 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,856 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 141 treesize of output 125 [2024-11-11 08:40:53,868 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,869 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,869 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,870 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,870 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:53,875 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 29 treesize of output 17 [2024-11-11 08:40:53,881 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,884 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 82 treesize of output 70 [2024-11-11 08:40:53,893 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,894 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:53,899 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 23 treesize of output 11 [2024-11-11 08:40:53,910 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,914 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 97 treesize of output 85 [2024-11-11 08:40:53,923 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,924 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:53,928 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 33 treesize of output 17 [2024-11-11 08:40:53,935 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,938 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 184 treesize of output 164 [2024-11-11 08:40:53,950 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,951 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,952 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,952 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,953 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:53,957 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 42 treesize of output 22 [2024-11-11 08:40:53,964 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,967 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 82 treesize of output 70 [2024-11-11 08:40:53,976 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,977 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:53,981 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 23 treesize of output 11 [2024-11-11 08:40:53,995 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:53,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 232 treesize of output 208 [2024-11-11 08:40:54,011 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,012 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,012 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,013 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,014 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,018 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 42 treesize of output 22 [2024-11-11 08:40:54,027 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,031 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 312 treesize of output 280 [2024-11-11 08:40:54,046 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,047 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,048 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,048 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,049 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,049 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,050 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,050 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,051 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,054 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 44 treesize of output 24 [2024-11-11 08:40:54,062 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,065 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 169 treesize of output 149 [2024-11-11 08:40:54,073 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,073 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,074 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,074 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,075 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,079 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 32 treesize of output 16 [2024-11-11 08:40:54,092 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,094 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,098 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,102 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,102 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,103 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,110 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 08:40:54,110 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 1 [2024-11-11 08:40:54,115 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,117 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,130 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,136 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,136 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,137 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,142 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 11 [2024-11-11 08:40:54,149 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,149 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,154 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,155 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,155 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,156 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,156 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,156 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,164 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 08:40:54,165 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 92 treesize of output 1 [2024-11-11 08:40:54,174 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,177 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,185 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,187 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,191 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,192 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,196 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,201 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,201 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,202 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,206 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 08:40:54,207 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 1 [2024-11-11 08:40:54,213 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,215 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,218 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,220 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,224 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,228 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,229 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,229 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,235 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 08:40:54,235 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 1 [2024-11-11 08:40:54,255 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,257 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,263 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,267 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,268 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,268 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,276 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 08:40:54,276 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 1 [2024-11-11 08:40:54,280 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,282 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,290 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,293 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,298 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,301 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,307 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,311 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,319 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,321 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,326 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,328 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,333 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,335 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,344 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,347 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,353 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,359 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,360 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,360 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,366 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 08:40:54,367 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 1 [2024-11-11 08:40:54,370 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,373 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,390 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,393 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,400 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,405 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,406 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,407 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,418 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 08:40:54,418 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 1 [2024-11-11 08:40:54,423 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,426 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,433 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,436 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,442 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,448 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,449 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,449 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,460 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 08:40:54,460 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 1 [2024-11-11 08:40:54,465 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,467 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,476 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,479 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,486 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,492 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,492 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,493 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,505 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 08:40:54,505 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 1 [2024-11-11 08:40:54,510 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,513 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,525 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,531 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,532 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,533 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,538 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 11 [2024-11-11 08:40:54,547 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,548 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,554 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,555 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,555 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,556 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,556 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,557 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,574 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 08:40:54,575 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 75 treesize of output 1 [2024-11-11 08:40:54,581 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,587 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,588 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,588 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,599 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 08:40:54,599 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 1 [2024-11-11 08:40:54,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:54,614 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 808 treesize of output 558 [2024-11-11 08:40:54,619 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:40:54,630 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 3 case distinctions, treesize of input 234 treesize of output 145 [2024-11-11 08:40:54,644 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,647 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,652 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,654 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,659 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,661 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,670 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,673 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,680 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,686 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,687 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,687 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,699 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 08:40:54,700 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 1 [2024-11-11 08:40:54,705 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,708 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,720 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,724 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 176 treesize of output 156 [2024-11-11 08:40:54,737 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,738 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,739 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,739 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,740 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,746 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 60 treesize of output 44 [2024-11-11 08:40:54,759 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,764 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 96 treesize of output 82 [2024-11-11 08:40:54,774 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,775 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,783 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 48 treesize of output 36 [2024-11-11 08:40:54,790 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,794 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 111 treesize of output 97 [2024-11-11 08:40:54,805 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,806 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,813 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 58 treesize of output 42 [2024-11-11 08:40:54,822 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,825 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:54,896 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:40:54,902 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,903 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,903 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,911 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 08:40:54,911 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 1 [2024-11-11 08:40:54,916 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:40:54,919 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 08:40:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 6 proven. 25 refuted. 6 times theorem prover too weak. 1 trivial. 79 not checked. [2024-11-11 08:40:55,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116440485] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:40:55,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:40:55,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 27] total 63 [2024-11-11 08:40:55,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850645247] [2024-11-11 08:40:55,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:40:55,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-11 08:40:55,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:40:55,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-11 08:40:55,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=2034, Unknown=76, NotChecked=1650, Total=4160 [2024-11-11 08:40:55,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:40:55,261 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:40:55,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 3.28125) internal successors, (210), 64 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-11 08:40:55,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:55,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:40:55,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:55,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:55,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:40:55,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:55,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:40:55,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:40:55,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-11 08:40:55,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 08:40:55,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:40:55,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:41:06,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:41:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:41:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:41:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:41:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:41:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:41:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:41:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:41:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 08:41:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 08:41:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:41:06,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 08:41:06,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 08:41:06,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-11 08:41:06,373 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:41:06,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:41:06,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1651989271, now seen corresponding path program 5 times [2024-11-11 08:41:06,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:41:06,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248100843] [2024-11-11 08:41:06,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:41:06,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:41:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:41:10,282 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 116 proven. 7 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-11 08:41:10,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:41:10,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248100843] [2024-11-11 08:41:10,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248100843] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:41:10,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387378469] [2024-11-11 08:41:10,284 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-11 08:41:10,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:41:10,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:41:10,286 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-11 08:41:10,287 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-11 08:41:18,336 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-11-11 08:41:18,336 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 08:41:18,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 4023 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-11 08:41:18,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:41:18,409 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 13 treesize of output 9 [2024-11-11 08:41:18,440 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-11 08:41:18,619 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:41:18,639 INFO L349 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2024-11-11 08:41:18,639 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-11 08:41:18,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:41:18,687 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:41:18,687 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 38 treesize of output 31 [2024-11-11 08:41:18,784 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 3 [2024-11-11 08:41:18,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:41:18,827 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-11 08:41:18,925 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:41:18,934 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-11 08:41:18,934 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2024-11-11 08:41:18,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:41:18,980 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-11 08:41:18,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-11 08:41:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 116 proven. 7 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-11 08:41:19,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:41:21,287 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_703 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_702) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94|) |c_~#queue~0.offset|) v_ArrVal_703) .cse1) 800)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94|)))) is different from false [2024-11-11 08:41:21,304 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94| Int) (v_ArrVal_702 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_703 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))) |c_~#stored_elements~0.base| v_ArrVal_702) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94|) |c_~#queue~0.offset|) v_ArrVal_703) .cse1) 800)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|))))) is different from false [2024-11-11 08:41:21,350 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94| Int) (v_ArrVal_702 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_703 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))) |c_~#stored_elements~0.base| v_ArrVal_702) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94|) |c_~#queue~0.offset|) v_ArrVal_703) .cse1) 800)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|))))) is different from false [2024-11-11 08:41:21,395 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_698 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94| Int) (v_ArrVal_702 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_703 Int)) (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|) v_ArrVal_698)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))) |c_~#stored_elements~0.base| v_ArrVal_702) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94|) |c_~#queue~0.offset|) v_ArrVal_703) .cse1) 800)))))) is different from false [2024-11-11 08:41:21,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) (forall ((v_ArrVal_698 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94| Int) (v_ArrVal_702 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| Int) (v_ArrVal_703 Int)) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_97|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_698))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82| 1))) |c_~#stored_elements~0.base| v_ArrVal_702) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94|) |c_~#queue~0.offset|) v_ArrVal_703) .cse3) 800)) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_82|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94|)))))))) is different from false [2024-11-11 08:41:22,209 INFO L349 Elim1Store]: treesize reduction 273, result has 40.9 percent of original size [2024-11-11 08:41:22,210 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 251 treesize of output 320 [2024-11-11 08:41:22,249 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-11 08:41:22,249 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 219 treesize of output 201 [2024-11-11 08:41:22,262 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 61 treesize of output 53 [2024-11-11 08:41:22,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:41:22,289 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 74 treesize of output 74 [2024-11-11 08:41:22,310 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 17 treesize of output 9 [2024-11-11 08:41:22,410 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 17 treesize of output 9 [2024-11-11 08:41:22,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:41:22,461 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 75 treesize of output 77 [2024-11-11 08:41:22,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:41:22,583 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 142 treesize of output 140 [2024-11-11 08:41:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 116 proven. 1 refuted. 0 times theorem prover too weak. 195 trivial. 6 not checked. [2024-11-11 08:41:22,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387378469] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:41:22,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:41:22,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 39 [2024-11-11 08:41:22,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824321138] [2024-11-11 08:41:22,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:41:22,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-11 08:41:22,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:41:22,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-11 08:41:22,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=994, Unknown=13, NotChecked=350, Total=1560 [2024-11-11 08:41:22,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:41:22,724 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:41:22,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.65) internal successors, (106), 39 states have internal predecessors, (106), 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-11 08:41:22,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:41:22,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:41:22,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:41:22,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:41:22,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:41:22,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:41:22,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:41:22,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:41:22,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-11 08:41:22,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 08:41:22,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:41:22,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-11-11 08:41:22,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:41:24,171 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94| Int) (v_ArrVal_703 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94|) (not (= 800 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94|) |c_~#queue~0.offset|) v_ArrVal_703) .cse1)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_703 Int)) (let ((.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_702) |c_~#queue~0.base|))) (or (not (= 800 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94|) |c_~#queue~0.offset|) v_ArrVal_703) .cse1))) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_94|)))))) is different from false [2024-11-11 08:41:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:41:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:41:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:41:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:41:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:41:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:41:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:41:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:41:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 08:41:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 08:41:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:41:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 08:41:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-11 08:41:24,505 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-11 08:41:24,681 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,SelfDestructingSolverStorable12 [2024-11-11 08:41:24,681 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:41:24,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:41:24,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1975566600, now seen corresponding path program 1 times [2024-11-11 08:41:24,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:41:24,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451194758] [2024-11-11 08:41:24,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:41:24,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:41:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:41:29,239 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:41:29,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:41:29,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451194758] [2024-11-11 08:41:29,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451194758] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:41:29,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341590018] [2024-11-11 08:41:29,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:41:29,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:41:29,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:41:29,241 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-11 08:41:29,242 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-11 08:41:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:41:29,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 3538 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-11 08:41:29,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:41:29,796 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-11 08:41:29,854 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 19 treesize of output 18 [2024-11-11 08:41:30,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:41:30,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:41:30,107 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 34 treesize of output 21 [2024-11-11 08:41:30,168 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-11 08:41:30,396 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-11 08:41:30,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:41:30,473 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-11 08:41:30,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:41:30,618 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-11 08:41:30,658 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-11 08:41:30,754 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-11 08:41:30,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:41:30,806 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-11 08:41:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:41:30,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:41:31,138 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_770 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_770 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-11 08:41:31,271 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2024-11-11 08:41:33,308 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.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| 3204))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_766))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_766))) (store (store .cse6 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset|))))) is different from false [2024-11-11 08:41:42,592 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_765 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_766))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|)))) (forall ((v_ArrVal_765 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_766))) (store (store .cse4 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|)))))) is different from false [2024-11-11 08:41:42,648 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_765 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (let ((.cse4 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_766))) (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|)))) (forall ((v_ArrVal_765 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (let ((.cse6 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse5 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_766))) (store (store .cse5 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |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_105|)))))) is different from false [2024-11-11 08:41:42,676 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)))))) (and (forall ((v_ArrVal_765 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ (* 4 (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_766))) (store (store .cse3 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) (forall ((v_ArrVal_765 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (let ((.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (or (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= 0 (+ (* 4 (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse6 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_766))) (store (store .cse6 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|)))))))) is different from false [2024-11-11 08:41:59,388 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (select .cse6 .cse1))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int)) (or (forall ((v_ArrVal_761 Int)) (let ((.cse4 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) v_ArrVal_761))) (let ((.cse5 (select .cse4 .cse1))) (or (forall ((v_ArrVal_765 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_subst_6 Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_766))) (store (store .cse2 .cse3 (+ v_subst_6 1)) .cse1 (+ (select .cse2 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)))))) (= 800 .cse5))))) (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int)) (or (forall ((v_ArrVal_761 Int)) (let ((.cse11 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) v_ArrVal_761))) (let ((.cse8 (select .cse11 .cse1))) (or (= 800 .cse8) (forall ((v_ArrVal_765 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse11 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (or (forall ((v_subst_5 Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse9 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_766))) (store (store .cse9 .cse3 (+ v_subst_5 1)) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|)))))))) (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|)))))) is different from false [2024-11-11 08:42:22,717 INFO L349 Elim1Store]: treesize reduction 312, result has 39.3 percent of original size [2024-11-11 08:42:22,717 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 450 treesize of output 377 [2024-11-11 08:42:22,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:42:22,768 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 348 treesize of output 346 [2024-11-11 08:42:22,778 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 14 treesize of output 10 [2024-11-11 08:42:22,792 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-11 08:42:22,837 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 17 treesize of output 9 [2024-11-11 08:42:22,894 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 17 treesize of output 9 [2024-11-11 08:42:22,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:42:22,988 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 114 treesize of output 112 [2024-11-11 08:42:23,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:42:23,227 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 175 treesize of output 161 [2024-11-11 08:42:23,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:42:23,378 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:42:23,528 INFO L349 Elim1Store]: treesize reduction 296, result has 22.3 percent of original size [2024-11-11 08:42:23,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 423 treesize of output 233 [2024-11-11 08:42:23,546 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:42:23,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:42:23,552 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 115 treesize of output 107 [2024-11-11 08:42:23,563 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:42:23,565 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:42:23,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:42:23,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 77 [2024-11-11 08:42:23,585 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:42:23,599 INFO L349 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2024-11-11 08:42:23,600 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 64 treesize of output 44 [2024-11-11 08:42:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 3 times theorem prover too weak. 0 trivial. 10 not checked. [2024-11-11 08:42:23,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341590018] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:42:23,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:42:23,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 21] total 51 [2024-11-11 08:42:23,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459593067] [2024-11-11 08:42:23,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:42:23,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-11 08:42:23,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:42:23,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-11 08:42:23,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1678, Unknown=88, NotChecked=658, Total=2756 [2024-11-11 08:42:23,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:42:23,711 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:42:23,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.1923076923076925) internal successors, (114), 52 states have internal predecessors, (114), 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-11 08:42:23,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:42:23,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:42:23,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:42:23,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:42:23,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:42:23,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:42:23,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:42:23,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:42:23,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-11 08:42:23,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 08:42:23,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:42:23,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-11-11 08:42:23,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-11 08:42:23,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:42:31,285 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-11 08:42:33,342 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-11 08:42:33,438 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse18 (select .cse9 .cse11)) (.cse22 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) 0)))) (let ((.cse26 (select .cse22 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse12 (+ .cse18 1))) (let ((.cse16 (= 800 .cse18)) (.cse10 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse9 .cse11 .cse12))) (.cse27 (select .cse26 .cse1)) (.cse2 (select |c_#length| |c_~#queue~0.base|)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (* .cse18 4)) (.cse4 (* (select (select |c_#memory_int| |c_~#queue~0.base|) .cse1) 4))) (and (forall ((v_ArrVal_770 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_770 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse1) 4) 4) .cse2)) (<= (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| .cse3) (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (<= (+ .cse4 |c_~#queue~0.offset| 4) .cse2) (or (and (forall ((v_ArrVal_765 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse11 .cse12)))) (let ((.cse5 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (or (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_subst_6 Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_766))) (store (store .cse7 .cse8 (+ v_subst_6 1)) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse1) 4)))))))) (forall ((v_ArrVal_765 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (let ((.cse14 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse11 .cse12)))) (let ((.cse13 (select (store .cse14 |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (or (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_subst_5 Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse14 |c_~#queue~0.base| (let ((.cse15 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_766))) (store (store .cse15 .cse8 (+ v_subst_5 1)) .cse1 (+ (select .cse15 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse1) 4)) .cse2))))))) .cse16) (forall ((v_ArrVal_770 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse1) 4)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse17 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_766))) (store (store .cse17 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse11 (+ (select .cse17 .cse11) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2)) (< .cse18 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|))) (forall ((v_ArrVal_765 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (let ((.cse20 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse19 (store .cse20 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_766))) (store (store .cse19 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse19 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (< (select .cse20 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int)) (or (forall ((v_ArrVal_761 Int)) (let ((.cse24 (store .cse26 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) v_ArrVal_761))) (let ((.cse25 (select .cse24 .cse1))) (or (forall ((v_ArrVal_765 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (let ((.cse21 (select (store (store .cse22 |c_~#queue~0.base| (store (store .cse24 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse25 1))) |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (or (< (select .cse21 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_subst_6 Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= 0 (+ (* 4 (select (select (store (store .cse22 |c_~#queue~0.base| (let ((.cse23 (store .cse21 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_766))) (store (store .cse23 .cse8 (+ v_subst_6 1)) .cse1 (+ (select .cse23 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|)))))) (= 800 .cse25))))) (< .cse27 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|))) (or (and (forall ((v_ArrVal_765 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (let ((.cse28 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (or (< (select .cse28 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ (* 4 (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse29 (store .cse28 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_766))) (store (store .cse29 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse29 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) .cse2))))) (forall ((v_ArrVal_765 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (let ((.cse30 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (or (< (select .cse30 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= 0 (+ (* 4 (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse31 (store .cse30 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_766))) (store (store .cse31 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse31 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))))) .cse16) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse32 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_766))) (store (store .cse32 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse11 (+ (select .cse32 .cse11) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (< .cse18 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|))) (forall ((v_ArrVal_765 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (let ((.cse34 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse33 (store .cse34 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_766))) (store (store .cse33 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse33 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2)) (< (select .cse34 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|)))) (forall ((v_ArrVal_770 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse1) 4) 4) .cse2)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| Int)) (or (< .cse27 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108|) (forall ((v_ArrVal_761 Int)) (let ((.cse37 (store .cse26 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_108| 4) |c_~#queue~0.offset|) v_ArrVal_761))) (let ((.cse38 (select .cse37 .cse1))) (or (forall ((v_ArrVal_765 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (let ((.cse35 (select (store (store .cse22 |c_~#queue~0.base| (store (store .cse37 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse38 1))) |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (or (< (select .cse35 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((v_subst_5 Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ (* (select (select (store (store .cse22 |c_~#queue~0.base| (let ((.cse36 (store .cse35 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_766))) (store (store .cse36 .cse8 (+ v_subst_5 1)) .cse1 (+ (select .cse36 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2))))) (= 800 .cse38))))))) (<= 0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| .cse3)) (<= 0 (+ .cse4 |c_~#queue~0.offset|))))))) is different from false [2024-11-11 08:42:33,468 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (select |c_#length| |c_~#queue~0.base|)) (.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_770 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse0) 4) 4) .cse1)) (forall ((v_ArrVal_770 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_765 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_766))) (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse0 (+ (select .cse2 .cse0) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (< (select .cse4 .cse0) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|)))) (forall ((v_ArrVal_765 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_765) |c_~#queue~0.base|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_766))) (store (store .cse5 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse0 (+ (select .cse5 .cse0) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) .cse1)) (< (select .cse6 .cse0) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|)))))) is different from false [2024-11-11 08:42:35,522 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (select .cse5 .cse4))) (let ((.cse0 (* .cse6 4)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (select |c_#length| |c_~#queue~0.base|))) (and (<= (+ .cse0 |c_~#queue~0.offset| 4) .cse1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_766))) (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse4) 4)))) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|))) (<= 0 (+ .cse0 |c_~#queue~0.offset|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (or (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_766))) (store (store .cse7 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ (select .cse7 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse4) 4)) .cse1)))))))) is different from false [2024-11-11 08:42:39,412 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-11 08:42:42,030 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-11 08:42:44,382 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-11 08:42:45,042 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (select .cse5 .cse4)) (.cse13 (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4))) (let ((.cse8 (select |c_#length| |c_~#queue~0.base|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ |c_~#queue~0.offset| 3204)) (.cse1 (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ .cse13 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (* .cse10 4))) (and (<= (+ 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| .cse0) .cse1) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse5 .cse6 v_ArrVal_766))) (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse7)) |c_~#queue~0.offset| 4) .cse8)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_766))) (store (store .cse9 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ (select .cse9 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset| 4) .cse8)) (< .cse10 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (store .cse5 .cse6 v_ArrVal_766))) (store (store .cse11 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ (select .cse11 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse7)) |c_~#queue~0.offset|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_770 (Array Int Int)) (v_ArrVal_766 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse12 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_766))) (store (store .cse12 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ (select .cse12 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_770) |c_~#queue~0.base|) .cse7) 4) |c_~#queue~0.offset|))) (< .cse10 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|))) (<= (+ .cse13 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) .cse1) (<= 0 .cse6) (<= 0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| .cse0)))))) is different from false [2024-11-11 08:42:46,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:42:46,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:42:46,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:42:46,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:42:46,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:42:46,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:42:46,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:42:46,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:42:46,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 08:42:46,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 08:42:46,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:42:46,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 08:42:46,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 08:42:46,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-11 08:42:46,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-11 08:42:46,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:42:46,807 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:42:46,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:42:46,807 INFO L85 PathProgramCache]: Analyzing trace with hash -494166057, now seen corresponding path program 6 times [2024-11-11 08:42:46,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:42:46,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279756586] [2024-11-11 08:42:46,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:42:46,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:42:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:42:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 264 proven. 223 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 08:42:58,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:42:58,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279756586] [2024-11-11 08:42:58,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279756586] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:42:58,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372569388] [2024-11-11 08:42:58,381 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-11 08:42:58,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:42:58,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:42:58,383 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-11 08:42:58,384 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-11 08:43:56,010 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2024-11-11 08:43:56,010 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 08:43:56,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 4105 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-11 08:43:56,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:43:57,538 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 26 treesize of output 14 [2024-11-11 08:43:57,620 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 17 treesize of output 12 [2024-11-11 08:43:57,801 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-11 08:43:57,801 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 30 [2024-11-11 08:43:57,835 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 24 treesize of output 12 [2024-11-11 08:43:58,125 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 34 treesize of output 18 [2024-11-11 08:43:58,216 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 25 treesize of output 18 [2024-11-11 08:43:58,425 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-11 08:43:58,425 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 40 [2024-11-11 08:43:58,581 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 46 treesize of output 22 [2024-11-11 08:43:58,766 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 48 treesize of output 24 [2024-11-11 08:43:58,884 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 39 treesize of output 28 [2024-11-11 08:43:59,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-11-11 08:43:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 241 proven. 40 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-11 08:43:59,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:43:59,343 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|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_962 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_962 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2024-11-11 08:43:59,353 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_962 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_962 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2024-11-11 08:43:59,378 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_962 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_962 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2024-11-11 08:44:33,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:44:33,086 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2152 treesize of output 1042 [2024-11-11 08:44:33,138 INFO L349 Elim1Store]: treesize reduction 50, result has 56.9 percent of original size [2024-11-11 08:44:33,139 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 1022 treesize of output 904 [2024-11-11 08:44:33,182 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 355 treesize of output 343 [2024-11-11 08:44:33,193 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 338 treesize of output 334 [2024-11-11 08:44:33,204 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 334 treesize of output 326 [2024-11-11 08:44:33,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 08:44:33,221 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 412 treesize of output 400 [2024-11-11 08:44:33,232 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 328 treesize of output 304 [2024-11-11 08:44:33,243 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 299 treesize of output 291 [2024-11-11 08:44:33,252 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 291 treesize of output 287 [2024-11-11 08:44:33,298 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-11 08:44:33,457 INFO L349 Elim1Store]: treesize reduction 38, result has 42.4 percent of original size [2024-11-11 08:44:33,458 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 98 treesize of output 95 [2024-11-11 08:44:33,464 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 19 treesize of output 15 [2024-11-11 08:44:33,548 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-11 08:44:33,549 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 344 [2024-11-11 08:44:33,569 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 284 treesize of output 260 [2024-11-11 08:44:33,583 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 255 treesize of output 247 [2024-11-11 08:44:33,598 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 247 treesize of output 243 [2024-11-11 08:44:33,614 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 253 treesize of output 241 [2024-11-11 08:44:33,631 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 236 treesize of output 232 [2024-11-11 08:44:33,645 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 232 treesize of output 224 [2024-11-11 08:44:33,753 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-11 08:44:33,813 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 470 treesize of output 458 [2024-11-11 08:44:33,832 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 453 treesize of output 449 [2024-11-11 08:44:33,851 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 449 treesize of output 441 [2024-11-11 08:44:33,920 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-11 08:44:33,920 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 573 treesize of output 555 [2024-11-11 08:44:33,948 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 447 treesize of output 423 [2024-11-11 08:44:33,970 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 418 treesize of output 410 [2024-11-11 08:44:33,991 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 410 treesize of output 406 [2024-11-11 08:44:34,159 INFO L349 Elim1Store]: treesize reduction 128, result has 28.5 percent of original size [2024-11-11 08:44:34,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 273 treesize of output 214 [2024-11-11 08:44:34,174 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:44:34,174 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:44:34,178 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 08:44:34,178 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 22 treesize of output 11 [2024-11-11 08:44:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 14 proven. 178 refuted. 46 times theorem prover too weak. 226 trivial. 43 not checked. [2024-11-11 08:44:37,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372569388] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:44:37,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:44:37,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 20, 27] total 78 [2024-11-11 08:44:37,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103100802] [2024-11-11 08:44:37,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:44:37,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2024-11-11 08:44:37,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:44:37,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2024-11-11 08:44:37,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=4911, Unknown=98, NotChecked=456, Total=6320 [2024-11-11 08:44:37,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:44:37,354 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:44:37,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 79 states have (on average 2.9873417721518987) internal successors, (236), 79 states have internal predecessors, (236), 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-11 08:44:37,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:44:37,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:44:37,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:44:37,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:44:37,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:44:37,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:44:37,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:44:37,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:44:37,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-11 08:44:37,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 08:44:37,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:44:37,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-11-11 08:44:37,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-11 08:44:37,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-11 08:44:37,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:44:41,644 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse31 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse32 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse31 .cse32 (+ (select .cse31 .cse32) 1))))) (.cse2 (select |c_#length| |c_~#queue~0.base|))) (let ((.cse14 (< .cse2 (+ 3212 |c_~#queue~0.offset|))) (.cse15 (and (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_954 Int)) (let ((.cse20 (let ((.cse22 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse3) 4)) v_ArrVal_954)))) (let ((.cse21 (select .cse20 .cse3))) (or (forall ((v_ArrVal_957 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse18 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse20 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse21 1))) |c_~#stored_elements~0.base| v_ArrVal_957) |c_~#queue~0.base|))) (let ((.cse19 (* (select .cse18 .cse3) 4))) (let ((.cse16 (+ |c_~#queue~0.offset| .cse19))) (or (< .cse16 0) (forall ((v_subst_7 Int) (v_ArrVal_959 Int) (v_ArrVal_962 (Array Int Int))) (<= (+ (* (select (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse17 (store .cse18 .cse16 v_ArrVal_959))) (store (store .cse17 .cse6 (+ v_subst_7 1)) .cse3 (+ (select .cse17 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse2)) (< .cse2 (+ |c_~#queue~0.offset| 4 .cse19))))))) (= 800 .cse21))))) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_954 Int)) (let ((.cse28 (let ((.cse30 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_952) |c_~#queue~0.base|))) (store .cse30 (+ |c_~#queue~0.offset| (* (select .cse30 .cse3) 4)) v_ArrVal_954)))) (let ((.cse29 (select .cse28 .cse3))) (or (forall ((v_ArrVal_957 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse27 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|))) (let ((.cse24 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse28 .cse6 .cse27) .cse3 (+ .cse29 1))) |c_~#stored_elements~0.base| v_ArrVal_957) |c_~#queue~0.base|))) (let ((.cse25 (+ |c_~#queue~0.offset| (* (select .cse24 .cse3) 4)))) (or (forall ((v_subst_8 Int) (v_ArrVal_959 Int) (v_ArrVal_962 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse23 (store .cse24 .cse25 v_ArrVal_959))) (store (store .cse23 .cse6 (+ v_subst_8 1)) .cse3 (+ (select .cse23 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (< .cse25 0) (< .cse2 (+ (* (select (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse26 (store v_ArrVal_952 (+ |c_~#queue~0.offset| (* (select v_ArrVal_952 .cse3) 4)) v_ArrVal_954))) (store (store .cse26 .cse6 .cse27) .cse3 (+ (select .cse26 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_957) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4))))))) (= 800 .cse29))))))) (.cse0 (select (select |c_#memory_int| 5) 3204)) (.cse1 (* (select (select |c_#memory_int| |c_~#queue~0.base|) .cse3) 4))) (and (not (= 801 .cse0)) (= |c_~#stored_elements~0.base| 4) (= |c_~#queue~0.offset| 0) (<= (+ .cse1 |c_~#queue~0.offset| 4) .cse2) (forall ((v_ArrVal_962 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse3) 4)) .cse2)) (= 5 |c_~#queue~0.base|) (or (and (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse7 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_957) |c_~#queue~0.base|))) (let ((.cse9 (* 4 (select .cse7 .cse3)))) (let ((.cse8 (+ |c_~#queue~0.offset| .cse9))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_959 Int) (v_ArrVal_962 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse7 .cse8 v_ArrVal_959))) (store (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse3) 4)))) (< .cse2 (+ |c_~#queue~0.offset| .cse9 4)) (< .cse8 0)))))) (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse11 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_957) |c_~#queue~0.base|))) (let ((.cse13 (* 4 (select .cse11 .cse3)))) (let ((.cse12 (+ |c_~#queue~0.offset| .cse13))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_959 Int) (v_ArrVal_962 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse10 (store .cse11 .cse12 v_ArrVal_959))) (store (store .cse10 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse10 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse3) 4)) .cse2)) (< .cse2 (+ |c_~#queue~0.offset| .cse13 4)) (< .cse12 0))))))) .cse14) (or .cse14 .cse15) (<= (select |c_#length| 4) 3200) (= 3212 (select |c_#length| 5)) (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800) .cse14 .cse15) (not (= .cse0 802)) (<= 0 (+ .cse1 |c_~#queue~0.offset|)) (forall ((v_ArrVal_962 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_962) |c_~#queue~0.base|) .cse3) 4))))))) is different from false [2024-11-11 08:45:08,762 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-11 08:45:11,573 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-11 08:45:15,452 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-11 08:45:17,733 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-11 08:45:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:45:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:45:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:45:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:27,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:45:27,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 08:45:27,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 08:45:27,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:45:27,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 08:45:27,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 08:45:27,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-11 08:45:27,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-11-11 08:45:27,824 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-11 08:45:27,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-11 08:45:27,984 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:45:27,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2140186798, now seen corresponding path program 1 times [2024-11-11 08:45:27,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:27,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612426103] [2024-11-11 08:45:27,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:27,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:28,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:28,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612426103] [2024-11-11 08:45:28,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612426103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:45:28,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898932350] [2024-11-11 08:45:28,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:28,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:45:28,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:45:28,185 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-11 08:45:28,186 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-11 08:45:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:28,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 3510 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 08:45:28,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:45:28,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:28,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:45:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:28,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898932350] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:45:28,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:45:28,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-11 08:45:28,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098555499] [2024-11-11 08:45:28,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:45:28,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 08:45:28,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:28,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 08:45:28,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 08:45:28,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:28,727 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:28,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 08:45:28,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:28,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:28,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:28,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:45:28,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:45:28,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:45:28,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:28,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:45:28,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-11 08:45:28,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 08:45:28,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:45:28,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-11-11 08:45:28,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-11 08:45:28,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-11 08:45:28,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-11-11 08:45:28,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:29,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:45:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:45:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:45:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:45:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 08:45:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 08:45:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:45:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 08:45:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 08:45:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-11 08:45:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-11-11 08:45:29,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:29,061 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-11 08:45:29,236 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,SelfDestructingSolverStorable15 [2024-11-11 08:45:29,237 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:45:29,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:29,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1793680364, now seen corresponding path program 1 times [2024-11-11 08:45:29,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:29,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083951431] [2024-11-11 08:45:29,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:29,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:29,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:29,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083951431] [2024-11-11 08:45:29,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083951431] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:45:29,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175138097] [2024-11-11 08:45:29,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:29,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:45:29,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:45:29,500 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-11 08:45:29,501 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-11 08:45:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:29,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 3594 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 08:45:29,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:45:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:30,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:45:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:30,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175138097] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:45:30,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:45:30,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-11 08:45:30,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591656139] [2024-11-11 08:45:30,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:45:30,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 08:45:30,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:30,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 08:45:30,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-11 08:45:30,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:30,167 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:30,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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-11 08:45:30,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:30,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:30,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:30,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:45:30,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:45:30,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:45:30,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:30,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:45:30,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-11 08:45:30,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 08:45:30,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:45:30,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-11-11 08:45:30,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-11 08:45:30,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-11 08:45:30,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-11-11 08:45:30,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:30,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:30,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:30,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:45:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:45:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:45:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:45:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 08:45:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 08:45:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:45:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 08:45:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 08:45:30,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-11 08:45:30,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-11-11 08:45:30,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:30,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:45:30,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-11 08:45:30,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 08:45:30,776 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2024-11-11 08:45:30,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:30,777 INFO L85 PathProgramCache]: Analyzing trace with hash 787939244, now seen corresponding path program 2 times [2024-11-11 08:45:30,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:30,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529062971] [2024-11-11 08:45:30,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:30,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:31,352 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:31,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:31,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529062971] [2024-11-11 08:45:31,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529062971] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:45:31,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626810434] [2024-11-11 08:45:31,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 08:45:31,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:45:31,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:45:31,356 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-11 08:45:31,359 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-11 08:45:31,840 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-11 08:45:31,840 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 08:45:31,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 3418 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 08:45:31,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:45:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-11 08:45:31,883 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 08:45:31,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626810434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:45:31,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 08:45:31,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [13] total 14 [2024-11-11 08:45:31,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988714721] [2024-11-11 08:45:31,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:45:31,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:45:31,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:31,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:45:31,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2024-11-11 08:45:31,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:31,886 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:31,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 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-11 08:45:31,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:31,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:31,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:31,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:45:31,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:45:31,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:45:31,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:31,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:45:31,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-11 08:45:31,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 08:45:31,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:45:31,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-11-11 08:45:31,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-11 08:45:31,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-11 08:45:31,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-11-11 08:45:31,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:31,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:45:31,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:32,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:32,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:32,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:45:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 08:45:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:45:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:45:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 08:45:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 08:45:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:45:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 08:45:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 08:45:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-11 08:45:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-11-11 08:45:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:32,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:45:32,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:32,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 18 remaining) [2024-11-11 08:45:32,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 18 remaining) [2024-11-11 08:45:32,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 18 remaining) [2024-11-11 08:45:32,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 18 remaining) [2024-11-11 08:45:32,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 18 remaining) [2024-11-11 08:45:32,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 18 remaining) [2024-11-11 08:45:32,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2024-11-11 08:45:32,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2024-11-11 08:45:32,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 18 remaining) [2024-11-11 08:45:32,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 18 remaining) [2024-11-11 08:45:32,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 18 remaining) [2024-11-11 08:45:32,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 18 remaining) [2024-11-11 08:45:32,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 18 remaining) [2024-11-11 08:45:32,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 18 remaining) [2024-11-11 08:45:32,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 18 remaining) [2024-11-11 08:45:32,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 18 remaining) [2024-11-11 08:45:32,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 18 remaining) [2024-11-11 08:45:32,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 18 remaining) [2024-11-11 08:45:32,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-11 08:45:32,317 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,SelfDestructingSolverStorable17 [2024-11-11 08:45:32,336 INFO L421 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 08:45:32,339 INFO L317 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/3) [2024-11-11 08:45:32,346 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 08:45:32,347 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-11 08:45:32,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-11 08:45:32,348 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;@41282fbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 08:45:32,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-11 08:45:32,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-11 08:45:32,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:32,357 INFO L85 PathProgramCache]: Analyzing trace with hash 116063861, now seen corresponding path program 1 times [2024-11-11 08:45:32,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:32,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447300864] [2024-11-11 08:45:32,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:32,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:32,510 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-11 08:45:32,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:32,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447300864] [2024-11-11 08:45:32,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447300864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:45:32,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:45:32,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 08:45:32,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848851941] [2024-11-11 08:45:32,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:45:32,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:45:32,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:32,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:45:32,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:45:32,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:32,513 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:32,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11 08:45:32,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:32,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:32,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 08:45:32,601 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-11 08:45:32,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:32,602 INFO L85 PathProgramCache]: Analyzing trace with hash 116063862, now seen corresponding path program 1 times [2024-11-11 08:45:32,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:32,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757150865] [2024-11-11 08:45:32,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:32,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:32,993 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-11 08:45:32,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:32,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757150865] [2024-11-11 08:45:32,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757150865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:45:32,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:45:32,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 08:45:32,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301133554] [2024-11-11 08:45:32,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:45:32,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 08:45:32,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:32,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 08:45:32,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 08:45:32,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:32,995 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:32,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-11 08:45:32,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:32,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:33,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:33,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:33,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 08:45:33,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-11 08:45:33,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:33,089 INFO L85 PathProgramCache]: Analyzing trace with hash -131658310, now seen corresponding path program 1 times [2024-11-11 08:45:33,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:33,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7065295] [2024-11-11 08:45:33,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:33,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:33,191 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-11 08:45:33,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:33,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7065295] [2024-11-11 08:45:33,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7065295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:45:33,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:45:33,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 08:45:33,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039415983] [2024-11-11 08:45:33,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:45:33,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:45:33,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:33,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:45:33,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:45:33,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:33,194 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:33,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11 08:45:33,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:33,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:33,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:33,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:33,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:33,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:33,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 08:45:33,269 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-11 08:45:33,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:33,270 INFO L85 PathProgramCache]: Analyzing trace with hash -131658309, now seen corresponding path program 1 times [2024-11-11 08:45:33,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:33,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274551725] [2024-11-11 08:45:33,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:33,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:33,809 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-11 08:45:33,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:33,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274551725] [2024-11-11 08:45:33,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274551725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:45:33,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:45:33,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 08:45:33,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163818482] [2024-11-11 08:45:33,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:45:33,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 08:45:33,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:33,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 08:45:33,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 08:45:33,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:33,811 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:33,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-11 08:45:33,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:33,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:33,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:33,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:34,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:34,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:34,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:34,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:45:34,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 08:45:34,166 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-11 08:45:34,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:34,166 INFO L85 PathProgramCache]: Analyzing trace with hash 428256295, now seen corresponding path program 1 times [2024-11-11 08:45:34,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:34,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213455648] [2024-11-11 08:45:34,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:34,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:34,325 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-11 08:45:34,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:34,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213455648] [2024-11-11 08:45:34,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213455648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:45:34,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:45:34,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-11 08:45:34,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830481907] [2024-11-11 08:45:34,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:45:34,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:45:34,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:34,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:45:34,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:45:34,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:34,327 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:34,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 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-11 08:45:34,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:34,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:34,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:34,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:45:34,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:35,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:35,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:35,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:35,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:45:35,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:35,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 08:45:35,583 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-11 08:45:35,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:35,584 INFO L85 PathProgramCache]: Analyzing trace with hash -696983822, now seen corresponding path program 1 times [2024-11-11 08:45:35,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:35,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328096496] [2024-11-11 08:45:35,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:35,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:35,900 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-11 08:45:35,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:35,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328096496] [2024-11-11 08:45:35,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328096496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:45:35,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:45:35,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 08:45:35,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143759432] [2024-11-11 08:45:35,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:45:35,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 08:45:35,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:35,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 08:45:35,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 08:45:35,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:35,902 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:35,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-11 08:45:35,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:35,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:35,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:35,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:45:35,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:35,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:45:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:36,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:45:36,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 08:45:36,254 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-11 08:45:36,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:36,254 INFO L85 PathProgramCache]: Analyzing trace with hash -696983821, now seen corresponding path program 1 times [2024-11-11 08:45:36,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:36,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417710857] [2024-11-11 08:45:36,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:36,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:36,863 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-11 08:45:36,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:36,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417710857] [2024-11-11 08:45:36,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417710857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:45:36,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:45:36,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 08:45:36,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838288487] [2024-11-11 08:45:36,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:45:36,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 08:45:36,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:36,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 08:45:36,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 08:45:36,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:36,865 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:36,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-11 08:45:36,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:36,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:36,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:36,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:45:36,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:36,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:45:36,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:37,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:37,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:37,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:37,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:45:37,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:37,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:45:37,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 08:45:37,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2024-11-11 08:45:37,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2024-11-11 08:45:37,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2024-11-11 08:45:37,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2024-11-11 08:45:37,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2024-11-11 08:45:37,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2024-11-11 08:45:37,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2024-11-11 08:45:37,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2024-11-11 08:45:37,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2024-11-11 08:45:37,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2024-11-11 08:45:37,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (3 of 14 remaining) [2024-11-11 08:45:37,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (2 of 14 remaining) [2024-11-11 08:45:37,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 14 remaining) [2024-11-11 08:45:37,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 14 remaining) [2024-11-11 08:45:37,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 08:45:37,268 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-11 08:45:37,269 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (2/3) [2024-11-11 08:45:37,272 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 08:45:37,275 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-11 08:45:37,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2024-11-11 08:45:37,276 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;@41282fbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 08:45:37,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-11 08:45:37,564 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-11 08:45:37,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:37,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1479631120, now seen corresponding path program 1 times [2024-11-11 08:45:37,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:37,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842251536] [2024-11-11 08:45:37,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:37,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:37,721 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-11 08:45:37,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:37,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842251536] [2024-11-11 08:45:37,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842251536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:45:37,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:45:37,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 08:45:37,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751519448] [2024-11-11 08:45:37,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:45:37,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:45:37,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:37,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:45:37,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:45:37,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:37,723 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:37,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-11 08:45:37,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:38,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:38,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 08:45:38,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-11 08:45:38,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:38,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1479631119, now seen corresponding path program 1 times [2024-11-11 08:45:38,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:38,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818415451] [2024-11-11 08:45:38,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:38,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:38,359 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-11 08:45:38,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:38,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818415451] [2024-11-11 08:45:38,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818415451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:45:38,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:45:38,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 08:45:38,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538014099] [2024-11-11 08:45:38,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:45:38,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:45:38,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:38,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:45:38,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:45:38,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:38,361 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:38,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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-11 08:45:38,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:38,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:38,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:38,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:38,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-11 08:45:38,781 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-11 08:45:38,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:38,782 INFO L85 PathProgramCache]: Analyzing trace with hash 140463107, now seen corresponding path program 1 times [2024-11-11 08:45:38,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:38,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866211639] [2024-11-11 08:45:38,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:38,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:38,933 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-11 08:45:38,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:38,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866211639] [2024-11-11 08:45:38,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866211639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:45:38,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:45:38,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 08:45:38,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257493227] [2024-11-11 08:45:38,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:45:38,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:45:38,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:38,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:45:38,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:45:38,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:38,936 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:38,936 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-11 08:45:38,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:38,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:38,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:39,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:39,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:39,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:39,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-11 08:45:39,169 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-11 08:45:39,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:39,170 INFO L85 PathProgramCache]: Analyzing trace with hash -211141676, now seen corresponding path program 1 times [2024-11-11 08:45:39,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:39,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459346696] [2024-11-11 08:45:39,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:39,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 08:45:39,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:39,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459346696] [2024-11-11 08:45:39,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459346696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:45:39,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:45:39,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 08:45:39,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213819639] [2024-11-11 08:45:39,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:45:39,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:45:39,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:39,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:45:39,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:45:39,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:39,531 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:39,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-11 08:45:39,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:39,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:39,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:39,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:39,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:39,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:39,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:39,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:39,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-11 08:45:39,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-11 08:45:39,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:39,710 INFO L85 PathProgramCache]: Analyzing trace with hash -2004850011, now seen corresponding path program 1 times [2024-11-11 08:45:39,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:39,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279900651] [2024-11-11 08:45:39,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:39,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:39,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:39,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279900651] [2024-11-11 08:45:39,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279900651] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:45:39,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367709466] [2024-11-11 08:45:39,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:39,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:45:39,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:45:39,961 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-11 08:45:39,963 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-11 08:45:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:40,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 3487 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 08:45:40,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:45:40,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:40,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:45:40,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:40,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367709466] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:45:40,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:45:40,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-11 08:45:40,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117725109] [2024-11-11 08:45:40,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:45:40,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 08:45:40,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:40,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 08:45:40,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 08:45:40,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:40,500 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:40,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 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-11 08:45:40,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:40,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:40,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:40,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:40,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:40,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:40,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:40,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:40,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:40,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:40,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-11 08:45:40,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:45:40,882 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-11 08:45:40,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:40,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2091923986, now seen corresponding path program 2 times [2024-11-11 08:45:40,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:40,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754213487] [2024-11-11 08:45:40,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:40,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:41,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:41,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754213487] [2024-11-11 08:45:41,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754213487] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:45:41,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181120388] [2024-11-11 08:45:41,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 08:45:41,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:45:41,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:45:41,166 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:45:41,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-11 08:45:41,657 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-11 08:45:41,657 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 08:45:41,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 3412 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 08:45:41,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:45:42,026 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-11 08:45:42,027 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 08:45:42,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181120388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:45:42,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 08:45:42,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 10 [2024-11-11 08:45:42,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14121527] [2024-11-11 08:45:42,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:45:42,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 08:45:42,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:42,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 08:45:42,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-11 08:45:42,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:42,029 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:42,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-11 08:45:42,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:42,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:42,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:42,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:42,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:42,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:45:42,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-11 08:45:42,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:45:42,691 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-11 08:45:42,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:42,692 INFO L85 PathProgramCache]: Analyzing trace with hash 535905517, now seen corresponding path program 1 times [2024-11-11 08:45:42,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:42,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122083016] [2024-11-11 08:45:42,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:42,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-11 08:45:42,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:42,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122083016] [2024-11-11 08:45:42,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122083016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:45:42,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 08:45:42,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 08:45:42,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45283780] [2024-11-11 08:45:42,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:45:42,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 08:45:42,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:42,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 08:45:42,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 08:45:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:42,823 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:42,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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-11 08:45:42,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:42,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:42,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:42,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:42,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:42,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:45:42,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:43,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:43,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:43,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:43,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:43,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:43,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:45:43,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:43,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-11 08:45:43,010 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-11 08:45:43,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:43,010 INFO L85 PathProgramCache]: Analyzing trace with hash 535905518, now seen corresponding path program 1 times [2024-11-11 08:45:43,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:43,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066941096] [2024-11-11 08:45:43,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:43,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:43,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:43,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066941096] [2024-11-11 08:45:43,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066941096] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:45:43,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585463601] [2024-11-11 08:45:43,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:43,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:45:43,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:45:43,353 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:45:43,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-11 08:45:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:43,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 3736 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 08:45:43,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:45:43,946 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:43,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:45:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:44,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585463601] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:45:44,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:45:44,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-11 08:45:44,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397162375] [2024-11-11 08:45:44,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:45:44,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 08:45:44,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:44,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 08:45:44,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-11 08:45:44,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:44,073 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:44,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 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-11 08:45:44,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:44,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:44,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:44,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:44,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:44,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:45:44,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:44,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:44,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:44,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:44,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:44,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:44,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:44,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:45:44,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:44,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:45:44,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-11 08:45:44,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:45:44,656 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-11 08:45:44,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:44,657 INFO L85 PathProgramCache]: Analyzing trace with hash -417411564, now seen corresponding path program 2 times [2024-11-11 08:45:44,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:44,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478549521] [2024-11-11 08:45:44,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:44,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:45,211 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:45,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:45,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478549521] [2024-11-11 08:45:45,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478549521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:45:45,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172605604] [2024-11-11 08:45:45,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 08:45:45,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:45:45,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:45:45,213 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:45:45,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-11 08:45:46,146 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 08:45:46,146 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 08:45:46,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 4186 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 08:45:46,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:45:46,346 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:46,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:45:46,671 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:46,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172605604] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:45:46,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:45:46,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-11 08:45:46,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618765411] [2024-11-11 08:45:46,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:45:46,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-11 08:45:46,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:46,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-11 08:45:46,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-11 08:45:46,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:46,674 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:46,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.64) internal successors, (241), 25 states have internal predecessors, (241), 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-11 08:45:46,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:46,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:46,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:46,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:46,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:46,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:45:46,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:46,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:45:46,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:47,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:47,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:47,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:47,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:47,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:47,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:45:47,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:47,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:45:47,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-11 08:45:47,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-11 08:45:47,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-11 08:45:47,398 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-11 08:45:47,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:47,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1242716512, now seen corresponding path program 3 times [2024-11-11 08:45:47,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:47,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741170390] [2024-11-11 08:45:47,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:47,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2332 backedges. 0 proven. 2332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:48,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:48,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741170390] [2024-11-11 08:45:48,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741170390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:45:48,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37506383] [2024-11-11 08:45:48,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 08:45:48,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:45:48,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:45:48,919 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:45:48,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-11 08:45:52,341 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-11 08:45:52,341 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 08:45:52,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 3661 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-11 08:45:52,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:45:53,626 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-11 08:45:53,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:45:53,669 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-11 08:45:53,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 08:45:53,768 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-11 08:45:53,808 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-11 08:45:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2332 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 1920 trivial. 0 not checked. [2024-11-11 08:45:53,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 08:45:53,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37506383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 08:45:53,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 08:45:53,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [25] total 31 [2024-11-11 08:45:53,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893297039] [2024-11-11 08:45:53,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 08:45:53,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 08:45:53,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:53,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 08:45:53,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=605, Unknown=0, NotChecked=0, Total=930 [2024-11-11 08:45:53,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:53,869 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:53,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 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-11 08:45:53,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:53,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:53,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:53,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:53,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:53,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:45:53,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:53,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:45:53,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-11 08:45:53,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:54,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:54,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:54,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:54,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:54,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:54,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:45:54,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:54,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:45:54,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-11 08:45:54,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:45:54,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-11 08:45:55,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-11 08:45:55,128 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-11 08:45:55,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:45:55,128 INFO L85 PathProgramCache]: Analyzing trace with hash 699347786, now seen corresponding path program 1 times [2024-11-11 08:45:55,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:45:55,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5496284] [2024-11-11 08:45:55,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:55,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:45:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 0 proven. 2476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:56,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 08:45:56,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5496284] [2024-11-11 08:45:56,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5496284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 08:45:56,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396364052] [2024-11-11 08:45:56,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:45:56,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 08:45:56,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 08:45:56,700 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 08:45:56,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-11 08:45:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 08:45:57,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 5238 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-11 08:45:57,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 08:45:57,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 0 proven. 2476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:57,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 08:45:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 0 proven. 2476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 08:45:59,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396364052] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 08:45:59,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 08:45:59,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2024-11-11 08:45:59,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872689389] [2024-11-11 08:45:59,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 08:45:59,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-11 08:45:59,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 08:45:59,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-11 08:45:59,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2024-11-11 08:45:59,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:45:59,134 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 08:45:59,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 10.254901960784315) internal successors, (523), 51 states have internal predecessors, (523), 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-11 08:45:59,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:59,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:59,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:59,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:59,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:45:59,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:45:59,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:45:59,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:45:59,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-11 08:45:59,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:45:59,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 08:46:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:46:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:46:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:46:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:46:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 08:46:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 08:46:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 08:46:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 08:46:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-11 08:46:00,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 08:46:00,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-11 08:46:00,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-11 08:46:00,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-11 08:46:00,677 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-11 08:46:00,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 08:46:00,678 INFO L85 PathProgramCache]: Analyzing trace with hash -12951557, now seen corresponding path program 2 times [2024-11-11 08:46:00,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 08:46:00,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373181091] [2024-11-11 08:46:00,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 08:46:00,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 08:46:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat