./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-08-08_07-59-58.files/protection-local/37_stack_lock_p0_vs_concur-pthread.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c091e2ee Calling Ultimate with: /root/.sdkman/candidates/java/current/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/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i ./goblint.2024-08-08_07-59-58.files/protection-local/37_stack_lock_p0_vs_concur-pthread.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-c091e2e-m [2024-08-14 09:52:27,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 09:52:28,005 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-14 09:52:28,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 09:52:28,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 09:52:28,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 09:52:28,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 09:52:28,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 09:52:28,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 09:52:28,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 09:52:28,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 09:52:28,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 09:52:28,034 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 09:52:28,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 09:52:28,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 09:52:28,035 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-14 09:52:28,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 09:52:28,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-14 09:52:28,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 09:52:28,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 09:52:28,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 09:52:28,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 09:52:28,039 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 09:52:28,039 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-14 09:52:28,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 09:52:28,039 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 09:52:28,040 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 09:52:28,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 09:52:28,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 09:52:28,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 09:52:28,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-14 09:52:28,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 09:52:28,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 09:52:28,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 09:52:28,041 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 09:52:28,041 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-14 09:52:28,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 09:52:28,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 09:52:28,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-14 09:52:28,045 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 09:52:28,045 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-14 09:52:28,046 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-14 09:52:28,046 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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-08-14 09:52:28,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 09:52:28,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 09:52:28,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 09:52:28,317 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 09:52:28,317 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 09:52:28,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2024-08-14 09:52:29,619 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 09:52:29,833 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 09:52:29,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2024-08-14 09:52:29,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/db703a90f/a33d51f4ad2d446fba4cd95b684ccbb1/FLAG94e85be57 [2024-08-14 09:52:30,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/db703a90f/a33d51f4ad2d446fba4cd95b684ccbb1 [2024-08-14 09:52:30,179 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 09:52:30,180 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 09:52:30,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-08_07-59-58.files/protection-local/37_stack_lock_p0_vs_concur-pthread.yml/witness.yml [2024-08-14 09:52:30,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 09:52:30,240 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-14 09:52:30,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 09:52:30,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 09:52:30,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 09:52:30,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 09:52:30" (1/2) ... [2024-08-14 09:52:30,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34370acc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 09:52:30, skipping insertion in model container [2024-08-14 09:52:30,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 09:52:30" (1/2) ... [2024-08-14 09:52:30,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@321a3b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 09:52:30, skipping insertion in model container [2024-08-14 09:52:30,247 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 09:52:30" (2/2) ... [2024-08-14 09:52:30,248 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34370acc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 09:52:30, skipping insertion in model container [2024-08-14 09:52:30,248 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 09:52:30" (2/2) ... [2024-08-14 09:52:30,249 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-14 09:52:30,270 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-08-14 09:52:30,270 INFO L97 edCorrectnessWitness]: Location invariant before [L713-L713] (0 <= top) && (top <= 64) [2024-08-14 09:52:30,271 INFO L97 edCorrectnessWitness]: Location invariant before [L706-L706] (0 <= top) && (top <= 64) [2024-08-14 09:52:30,302 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-14 09:52:30,584 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i[31052,31065] [2024-08-14 09:52:30,590 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 09:52:30,600 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-08-14 09:52:30,664 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i[31052,31065] Start Parsing Local [2024-08-14 09:52:30,665 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 09:52:30,695 INFO L206 MainTranslator]: Completed translation [2024-08-14 09:52:30,695 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 09:52:30 WrapperNode [2024-08-14 09:52:30,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 09:52:30,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-14 09:52:30,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-14 09:52:30,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-14 09:52:30,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 09:52:30" (1/1) ... [2024-08-14 09:52:30,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 09:52:30" (1/1) ... [2024-08-14 09:52:30,736 INFO L138 Inliner]: procedures = 165, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 86 [2024-08-14 09:52:30,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-14 09:52:30,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 09:52:30,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 09:52:30,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 09:52:30,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 09:52:30" (1/1) ... [2024-08-14 09:52:30,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 09:52:30" (1/1) ... [2024-08-14 09:52:30,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 09:52:30" (1/1) ... [2024-08-14 09:52:30,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 09:52:30" (1/1) ... [2024-08-14 09:52:30,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 09:52:30" (1/1) ... [2024-08-14 09:52:30,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 09:52:30" (1/1) ... [2024-08-14 09:52:30,773 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 09:52:30" (1/1) ... [2024-08-14 09:52:30,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 09:52:30" (1/1) ... [2024-08-14 09:52:30,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 09:52:30,780 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-14 09:52:30,781 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-14 09:52:30,781 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-14 09:52:30,782 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 09:52:30" (1/1) ... [2024-08-14 09:52:30,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-14 09:52:30,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:52:30,821 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-08-14 09:52:30,827 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-08-14 09:52:30,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-08-14 09:52:30,863 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-08-14 09:52:30,863 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-08-14 09:52:30,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-08-14 09:52:30,863 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-08-14 09:52:30,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 09:52:30,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-14 09:52:30,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-14 09:52:30,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-14 09:52:30,863 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-08-14 09:52:30,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 09:52:30,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 09:52:30,865 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-08-14 09:52:30,994 INFO L244 CfgBuilder]: Building ICFG [2024-08-14 09:52:30,997 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 09:52:31,133 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-08-14 09:52:31,133 INFO L293 CfgBuilder]: Performing block encoding [2024-08-14 09:52:31,256 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 09:52:31,257 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-08-14 09:52:31,258 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.08 09:52:31 BoogieIcfgContainer [2024-08-14 09:52:31,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-14 09:52:31,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 09:52:31,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 09:52:31,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 09:52:31,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 09:52:30" (1/4) ... [2024-08-14 09:52:31,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b458d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 09:52:31, skipping insertion in model container [2024-08-14 09:52:31,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 09:52:30" (2/4) ... [2024-08-14 09:52:31,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b458d94 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.08 09:52:31, skipping insertion in model container [2024-08-14 09:52:31,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 09:52:30" (3/4) ... [2024-08-14 09:52:31,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b458d94 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.08 09:52:31, skipping insertion in model container [2024-08-14 09:52:31,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.08 09:52:31" (4/4) ... [2024-08-14 09:52:31,272 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur-pthread.i [2024-08-14 09:52:31,288 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 09:52:31,288 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-08-14 09:52:31,288 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-14 09:52:31,322 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-14 09:52:31,351 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 09:52:31,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-14 09:52:31,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:52:31,353 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-08-14 09:52:31,355 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-08-14 09:52:31,404 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-14 09:52:31,414 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-08-14 09:52:31,419 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@227b3078, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 09:52:31,419 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-08-14 09:52:31,508 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:52:31,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:31,512 INFO L85 PathProgramCache]: Analyzing trace with hash 150307150, now seen corresponding path program 1 times [2024-08-14 09:52:31,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:31,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572104927] [2024-08-14 09:52:31,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:31,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:31,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:52:31,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572104927] [2024-08-14 09:52:31,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572104927] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:52:31,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 09:52:31,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-08-14 09:52:31,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321218350] [2024-08-14 09:52:31,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:52:31,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 09:52:31,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:52:31,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 09:52:31,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 09:52:31,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:31,778 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:52:31,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-08-14 09:52:31,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:31,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:31,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-14 09:52:31,842 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:52:31,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:31,842 INFO L85 PathProgramCache]: Analyzing trace with hash -528617194, now seen corresponding path program 1 times [2024-08-14 09:52:31,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:31,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761027573] [2024-08-14 09:52:31,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:31,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:32,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:52:32,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761027573] [2024-08-14 09:52:32,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761027573] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:52:32,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 09:52:32,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-14 09:52:32,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530159967] [2024-08-14 09:52:32,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:52:32,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 09:52:32,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:52:32,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 09:52:32,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-14 09:52:32,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:32,048 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:52:32,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 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-08-14 09:52:32,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:32,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:32,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:32,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 09:52:32,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-14 09:52:32,180 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:52:32,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:32,180 INFO L85 PathProgramCache]: Analyzing trace with hash 306972498, now seen corresponding path program 1 times [2024-08-14 09:52:32,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:32,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676340631] [2024-08-14 09:52:32,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:32,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:32,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:52:32,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676340631] [2024-08-14 09:52:32,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676340631] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:52:32,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 09:52:32,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 09:52:32,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283557429] [2024-08-14 09:52:32,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:52:32,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 09:52:32,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:52:32,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 09:52:32,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-14 09:52:32,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:32,331 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:52:32,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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-08-14 09:52:32,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:32,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 09:52:32,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:32,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:32,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 09:52:32,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 09:52:32,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 3 remaining) [2024-08-14 09:52:32,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 3 remaining) [2024-08-14 09:52:32,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-08-14 09:52:32,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-14 09:52:32,446 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-08-14 09:52:32,448 INFO L308 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE,SAFE (1/2) [2024-08-14 09:52:32,451 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 09:52:32,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-14 09:52:32,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:52:32,455 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-14 09:52:32,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-08-14 09:52:32,462 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-14 09:52:32,462 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-14 09:52:32,463 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@227b3078, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 09:52:32,463 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 09:52:32,534 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 09:52:32,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:32,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1583709203, now seen corresponding path program 1 times [2024-08-14 09:52:32,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:32,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723333933] [2024-08-14 09:52:32,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:32,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:32,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:32,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:52:32,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723333933] [2024-08-14 09:52:32,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723333933] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:52:32,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 09:52:32,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-14 09:52:32,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098998027] [2024-08-14 09:52:32,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:52:32,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 09:52:32,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:52:32,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 09:52:32,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 09:52:32,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:32,582 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:52:32,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 09:52:32,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:32,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:32,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-08-14 09:52:32,626 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 09:52:32,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:32,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1194974795, now seen corresponding path program 1 times [2024-08-14 09:52:32,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:32,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741583971] [2024-08-14 09:52:32,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:32,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:32,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:52:32,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741583971] [2024-08-14 09:52:32,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741583971] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:52:32,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 09:52:32,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 09:52:32,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245604635] [2024-08-14 09:52:32,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:52:32,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 09:52:32,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:52:32,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 09:52:32,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-14 09:52:32,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:32,718 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:52:32,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-08-14 09:52:32,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:32,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:32,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:32,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 09:52:32,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-14 09:52:32,809 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 09:52:32,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:32,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1542646995, now seen corresponding path program 1 times [2024-08-14 09:52:32,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:32,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533706740] [2024-08-14 09:52:32,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:32,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:32,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:32,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:52:32,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533706740] [2024-08-14 09:52:32,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533706740] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:52:32,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 09:52:32,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-14 09:52:32,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201642919] [2024-08-14 09:52:32,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:52:32,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 09:52:32,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:52:32,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 09:52:32,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-14 09:52:32,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:32,949 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:52:32,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-08-14 09:52:32,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:32,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-14 09:52:32,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:33,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:33,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 09:52:33,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-14 09:52:33,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-14 09:52:33,028 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 09:52:33,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:33,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1610541106, now seen corresponding path program 1 times [2024-08-14 09:52:33,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:33,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716573681] [2024-08-14 09:52:33,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:33,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 09:52:33,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 09:52:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 09:52:33,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 09:52:33,083 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 09:52:33,083 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-14 09:52:33,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-14 09:52:33,086 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-08-14 09:52:33,087 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-08-14 09:52:33,089 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-14 09:52:33,089 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-08-14 09:52:33,112 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-14 09:52:33,115 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 09:52:33,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-14 09:52:33,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:52:33,121 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-14 09:52:33,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-08-14 09:52:33,125 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-14 09:52:33,125 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-14 09:52:33,125 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@227b3078, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 09:52:33,125 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 09:52:33,242 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 09:52:33,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:33,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1122837360, now seen corresponding path program 1 times [2024-08-14 09:52:33,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:33,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600278570] [2024-08-14 09:52:33,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:33,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-14 09:52:33,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:52:33,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600278570] [2024-08-14 09:52:33,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600278570] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:52:33,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 09:52:33,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-14 09:52:33,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857724927] [2024-08-14 09:52:33,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:52:33,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 09:52:33,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:52:33,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 09:52:33,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 09:52:33,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:33,303 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:52:33,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 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-08-14 09:52:33,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:33,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:33,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-08-14 09:52:33,378 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 09:52:33,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:33,378 INFO L85 PathProgramCache]: Analyzing trace with hash -889200088, now seen corresponding path program 1 times [2024-08-14 09:52:33,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:33,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393098970] [2024-08-14 09:52:33,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:33,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:33,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:52:33,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393098970] [2024-08-14 09:52:33,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393098970] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:52:33,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405643628] [2024-08-14 09:52:33,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:33,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:52:33,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:52:33,526 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-08-14 09:52:33,527 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-08-14 09:52:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:33,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-14 09:52:33,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:52:33,652 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-08-14 09:52:33,676 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:33,677 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 09:52:33,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405643628] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:52:33,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 09:52:33,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-08-14 09:52:33,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369212347] [2024-08-14 09:52:33,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:52:33,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 09:52:33,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:52:33,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 09:52:33,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-08-14 09:52:33,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:33,678 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:52:33,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-08-14 09:52:33,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:33,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:33,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:33,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:33,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-08-14 09:52:33,915 WARN L477 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-08-14 09:52:33,915 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 09:52:33,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:33,917 INFO L85 PathProgramCache]: Analyzing trace with hash 642535261, now seen corresponding path program 1 times [2024-08-14 09:52:33,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:33,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216499829] [2024-08-14 09:52:33,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:33,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-14 09:52:34,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:52:34,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216499829] [2024-08-14 09:52:34,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216499829] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:52:34,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 09:52:34,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 09:52:34,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433876502] [2024-08-14 09:52:34,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:52:34,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 09:52:34,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:52:34,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 09:52:34,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-14 09:52:34,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:34,077 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:52:34,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-08-14 09:52:34,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:34,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:34,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:34,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:34,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:34,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 09:52:34,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-08-14 09:52:34,156 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 09:52:34,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:34,156 INFO L85 PathProgramCache]: Analyzing trace with hash -466935943, now seen corresponding path program 1 times [2024-08-14 09:52:34,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:34,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888648825] [2024-08-14 09:52:34,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:34,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 09:52:34,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 09:52:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 09:52:34,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 09:52:34,179 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 09:52:34,179 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-14 09:52:34,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-08-14 09:52:34,180 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-08-14 09:52:34,180 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-08-14 09:52:34,180 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-14 09:52:34,180 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-08-14 09:52:34,198 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-14 09:52:34,200 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 09:52:34,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-14 09:52:34,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:52:34,202 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-14 09:52:34,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-08-14 09:52:34,204 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-14 09:52:34,205 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-08-14 09:52:34,205 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@227b3078, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 09:52:34,205 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-08-14 09:52:34,318 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:52:34,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:34,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1844731757, now seen corresponding path program 1 times [2024-08-14 09:52:34,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:34,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245930498] [2024-08-14 09:52:34,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:34,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 09:52:34,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:52:34,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245930498] [2024-08-14 09:52:34,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245930498] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:52:34,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 09:52:34,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-14 09:52:34,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678389544] [2024-08-14 09:52:34,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:52:34,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 09:52:34,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:52:34,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 09:52:34,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 09:52:34,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:34,364 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:52:34,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 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-08-14 09:52:34,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:34,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:34,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-08-14 09:52:34,427 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:52:34,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:34,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1608911659, now seen corresponding path program 1 times [2024-08-14 09:52:34,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:34,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462327752] [2024-08-14 09:52:34,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:34,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:34,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:52:34,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462327752] [2024-08-14 09:52:34,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462327752] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:52:34,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71346186] [2024-08-14 09:52:34,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:34,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:52:34,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:52:34,552 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-08-14 09:52:34,555 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-08-14 09:52:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:34,651 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-14 09:52:34,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:52:34,657 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-08-14 09:52:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:34,678 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 09:52:34,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71346186] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:52:34,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 09:52:34,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-08-14 09:52:34,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826452446] [2024-08-14 09:52:34,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:52:34,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 09:52:34,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:52:34,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 09:52:34,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-08-14 09:52:34,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:34,680 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:52:34,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-08-14 09:52:34,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:34,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:35,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:35,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:35,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-08-14 09:52:35,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-08-14 09:52:35,373 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:52:35,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:35,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1157482927, now seen corresponding path program 1 times [2024-08-14 09:52:35,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:35,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134889712] [2024-08-14 09:52:35,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:35,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:35,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:35,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:52:35,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134889712] [2024-08-14 09:52:35,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134889712] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:52:35,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354020643] [2024-08-14 09:52:35,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:35,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:52:35,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:52:35,489 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-08-14 09:52:35,490 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-08-14 09:52:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:35,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2024-08-14 09:52:35,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:52:35,604 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 8 treesize of output 1 [2024-08-14 09:52:35,621 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-08-14 09:52:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:35,644 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 09:52:35,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:52:35,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-14 09:52:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:35,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354020643] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 09:52:35,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 09:52:35,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-08-14 09:52:35,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059415683] [2024-08-14 09:52:35,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 09:52:35,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-14 09:52:35,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:52:35,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-14 09:52:35,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-08-14 09:52:35,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:35,932 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:52:35,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 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-08-14 09:52:35,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:35,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:35,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:36,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:36,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:36,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:36,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-08-14 09:52:36,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-08-14 09:52:36,606 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:52:36,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:36,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1334266025, now seen corresponding path program 1 times [2024-08-14 09:52:36,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:36,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094215989] [2024-08-14 09:52:36,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:36,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:36,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:36,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:52:36,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094215989] [2024-08-14 09:52:36,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094215989] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:52:36,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342955821] [2024-08-14 09:52:36,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:36,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:52:36,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:52:36,780 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-08-14 09:52:36,780 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-08-14 09:52:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:36,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-14 09:52:36,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:52:36,894 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 8 treesize of output 1 [2024-08-14 09:52:36,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-14 09:52:36,926 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-08-14 09:52:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:36,942 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 09:52:37,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:52:37,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-14 09:52:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:37,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342955821] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 09:52:37,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 09:52:37,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-08-14 09:52:37,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194183903] [2024-08-14 09:52:37,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 09:52:37,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-14 09:52:37,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:52:37,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-14 09:52:37,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-08-14 09:52:37,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:37,152 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:52:37,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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-08-14 09:52:37,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:37,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:37,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:37,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:37,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:37,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:37,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:37,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-14 09:52:37,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-08-14 09:52:38,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:52:38,092 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:52:38,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:38,092 INFO L85 PathProgramCache]: Analyzing trace with hash -40978486, now seen corresponding path program 1 times [2024-08-14 09:52:38,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:38,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355027855] [2024-08-14 09:52:38,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:38,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:38,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 09:52:38,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:52:38,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355027855] [2024-08-14 09:52:38,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355027855] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:52:38,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133256756] [2024-08-14 09:52:38,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:38,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:52:38,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:52:38,203 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-08-14 09:52:38,205 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-08-14 09:52:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:38,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-14 09:52:38,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:52:38,320 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-08-14 09:52:38,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 09:52:38,349 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 09:52:38,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:52:38,440 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 4 case distinctions, treesize of input 38 treesize of output 52 [2024-08-14 09:52:38,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:52:38,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-08-14 09:52:38,469 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 37 treesize of output 23 [2024-08-14 09:52:38,475 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 5 treesize of output 3 [2024-08-14 09:52:38,481 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 20 treesize of output 12 [2024-08-14 09:52:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 09:52:38,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133256756] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 09:52:38,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 09:52:38,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-08-14 09:52:38,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951045671] [2024-08-14 09:52:38,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 09:52:38,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-14 09:52:38,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:52:38,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-14 09:52:38,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-08-14 09:52:38,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:38,501 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:52:38,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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-08-14 09:52:38,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:38,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:38,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:38,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-14 09:52:38,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:38,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:38,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:38,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 09:52:38,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-08-14 09:52:39,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-08-14 09:52:39,093 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:52:39,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:39,094 INFO L85 PathProgramCache]: Analyzing trace with hash -2063358310, now seen corresponding path program 1 times [2024-08-14 09:52:39,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:39,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376933568] [2024-08-14 09:52:39,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:39,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:39,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:52:39,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376933568] [2024-08-14 09:52:39,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376933568] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:52:39,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731594766] [2024-08-14 09:52:39,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:39,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:52:39,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:52:39,452 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-08-14 09:52:39,456 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-08-14 09:52:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:39,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 13 conjunts are in the unsatisfiable core [2024-08-14 09:52:39,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:52:39,584 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 8 treesize of output 1 [2024-08-14 09:52:39,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-14 09:52:39,618 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-08-14 09:52:39,670 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-14 09:52:39,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-14 09:52:39,691 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-08-14 09:52:39,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:39,720 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 09:52:39,799 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_3 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) is different from false [2024-08-14 09:52:39,979 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 10 treesize of output 8 [2024-08-14 09:52:39,987 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 10 treesize of output 8 [2024-08-14 09:52:40,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:52:40,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-14 09:52:40,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:52:40,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-08-14 09:52:40,243 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-14 09:52:40,244 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 18 treesize of output 10 [2024-08-14 09:52:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:40,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731594766] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 09:52:40,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 09:52:40,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2024-08-14 09:52:40,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159904855] [2024-08-14 09:52:40,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 09:52:40,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-08-14 09:52:40,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:52:40,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-08-14 09:52:40,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=380, Unknown=2, NotChecked=40, Total=506 [2024-08-14 09:52:40,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:40,284 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:52:40,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.217391304347826) internal successors, (120), 22 states have internal predecessors, (120), 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-08-14 09:52:40,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:40,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:40,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:40,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:40,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 09:52:40,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:42,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 09:52:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-08-14 09:52:42,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-08-14 09:52:42,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-08-14 09:52:42,673 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:52:42,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:42,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1319353030, now seen corresponding path program 2 times [2024-08-14 09:52:42,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:42,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161586400] [2024-08-14 09:52:42,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:42,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:43,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:52:43,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161586400] [2024-08-14 09:52:43,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161586400] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:52:43,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679159055] [2024-08-14 09:52:43,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 09:52:43,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:52:43,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:52:43,127 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-08-14 09:52:43,128 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-08-14 09:52:43,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-08-14 09:52:43,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 09:52:43,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 7 conjunts are in the unsatisfiable core [2024-08-14 09:52:43,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:52:43,256 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 16 treesize of output 8 [2024-08-14 09:52:43,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-14 09:52:43,287 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 09:52:43,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679159055] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:52:43,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 09:52:43,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-08-14 09:52:43,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181875873] [2024-08-14 09:52:43,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:52:43,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 09:52:43,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:52:43,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 09:52:43,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-08-14 09:52:43,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:43,288 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:52:43,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 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-08-14 09:52:43,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:43,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:43,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:43,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:43,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 09:52:43,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-08-14 09:52:43,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:43,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:43,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:43,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:43,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:43,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 09:52:43,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-08-14 09:52:43,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:52:43,955 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-08-14 09:52:44,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-08-14 09:52:44,144 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:52:44,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:44,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2033089872, now seen corresponding path program 3 times [2024-08-14 09:52:44,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:44,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504825434] [2024-08-14 09:52:44,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:44,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:44,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:52:44,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504825434] [2024-08-14 09:52:44,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504825434] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:52:44,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131783219] [2024-08-14 09:52:44,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-14 09:52:44,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:52:44,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:52:44,397 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-08-14 09:52:44,398 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-08-14 09:52:44,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-08-14 09:52:44,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 09:52:44,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 17 conjunts are in the unsatisfiable core [2024-08-14 09:52:44,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:52:44,503 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-08-14 09:52:44,506 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 8 treesize of output 1 [2024-08-14 09:52:44,559 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-08-14 09:52:44,559 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 2 case distinctions, treesize of input 60 treesize of output 88 [2024-08-14 09:52:44,582 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 5 treesize of output 3 [2024-08-14 09:52:44,611 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-08-14 09:52:44,611 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 2 case distinctions, treesize of input 31 treesize of output 36 [2024-08-14 09:52:44,617 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 5 treesize of output 3 [2024-08-14 09:52:44,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:52:44,629 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 15 treesize of output 19 [2024-08-14 09:52:45,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:52:45,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 193 treesize of output 141 [2024-08-14 09:52:45,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:52:45,329 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 82 treesize of output 87 [2024-08-14 09:52:45,333 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 78 treesize of output 76 [2024-08-14 09:52:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-14 09:52:45,532 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 09:52:45,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131783219] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:52:45,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 09:52:45,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 20 [2024-08-14 09:52:45,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110054562] [2024-08-14 09:52:45,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:52:45,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-14 09:52:45,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:52:45,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-14 09:52:45,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2024-08-14 09:52:45,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:45,534 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:52:45,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 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-08-14 09:52:45,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:45,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:45,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:45,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:45,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 09:52:45,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-08-14 09:52:45,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:52:45,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:46,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:46,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:46,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:46,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:46,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 09:52:46,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-08-14 09:52:46,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:52:46,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:52:46,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-08-14 09:52:46,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:52:46,764 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:52:46,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:46,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1747557515, now seen corresponding path program 1 times [2024-08-14 09:52:46,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:46,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670711481] [2024-08-14 09:52:46,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:46,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:47,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:52:47,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670711481] [2024-08-14 09:52:47,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670711481] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:52:47,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258124383] [2024-08-14 09:52:47,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:47,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:52:47,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:52:47,013 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-08-14 09:52:47,018 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-08-14 09:52:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:47,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 13 conjunts are in the unsatisfiable core [2024-08-14 09:52:47,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:52:47,158 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 8 treesize of output 1 [2024-08-14 09:52:47,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-14 09:52:47,203 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-14 09:52:47,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-14 09:52:47,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-14 09:52:47,234 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-08-14 09:52:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:47,257 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 09:52:47,317 WARN L854 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_8 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or (forall ((v_DerPreprocessor_7 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (< c_~next_alloc_idx~0 65))) is different from false [2024-08-14 09:52:47,365 WARN L854 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (let ((.cse0 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (< c_~next_alloc_idx~0 65))) is different from false [2024-08-14 09:52:47,621 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 10 treesize of output 8 [2024-08-14 09:52:47,635 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 10 treesize of output 8 [2024-08-14 09:52:47,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-14 09:52:47,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:52:47,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-14 09:52:47,881 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 86 treesize of output 76 [2024-08-14 09:52:47,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:52:47,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-08-14 09:52:47,894 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-14 09:52:47,895 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 18 treesize of output 10 [2024-08-14 09:52:47,927 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:52:47,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258124383] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 09:52:47,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 09:52:47,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2024-08-14 09:52:47,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781280435] [2024-08-14 09:52:47,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 09:52:47,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-08-14 09:52:47,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:52:47,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-08-14 09:52:47,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=307, Unknown=2, NotChecked=74, Total=462 [2024-08-14 09:52:47,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:47,929 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:52:47,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.590909090909091) internal successors, (101), 21 states have internal predecessors, (101), 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-08-14 09:52:47,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:47,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:47,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:47,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:47,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 09:52:47,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-08-14 09:52:47,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:52:47,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:52:47,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:48,193 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (< 64 c_~next_alloc_idx~0)) (.cse3 (< 62 c_~next_alloc_idx~0)) (.cse2 (< c_~next_alloc_idx~0 63)) (.cse0 (< c_~next_alloc_idx~0 65))) (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (<= c_~next_alloc_idx~0 62) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (< 0 c_~top~0) (or .cse1 (and (or .cse2 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse3 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (or .cse1 (let ((.cse4 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or .cse3 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse4 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or .cse2 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse4 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) .cse0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))))) is different from false [2024-08-14 09:52:48,380 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~next_alloc_idx~0 65)) (.cse0 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (and (<= 3 .cse0) (<= 0 (+ c_~next_alloc_idx~0 1)) (not (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse1) (<= c_~next_alloc_idx~0 62) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse1) (= .cse0 3) (< 0 c_~top~0) (or (< 64 c_~next_alloc_idx~0) (and (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))))) is different from false [2024-08-14 09:52:50,093 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 65))) (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (<= c_~next_alloc_idx~0 62) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (or (< 64 c_~next_alloc_idx~0) (and (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))) (<= 3 c_~top~0))) is different from false [2024-08-14 09:52:50,294 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 65))) (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (<= c_~next_alloc_idx~0 62) (or (< 64 c_~next_alloc_idx~0) (let ((.cse1 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) .cse0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))))) is different from false [2024-08-14 09:52:50,434 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65)) (< 0 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))) (<= 3 c_~top~0)) is different from false [2024-08-14 09:52:50,608 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65)) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))) (<= 3 c_~top~0)) is different from false [2024-08-14 09:52:51,311 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65)) (<= c_~next_alloc_idx~0 62) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))) (<= 3 c_~top~0)) is different from false [2024-08-14 09:52:51,369 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65)) (<= c_~next_alloc_idx~0 62) (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 3) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))) (<= 3 c_~top~0)) is different from false [2024-08-14 09:52:53,192 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (and (<= 3 .cse0) (<= 0 (+ c_~next_alloc_idx~0 1)) (not (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65)) (<= c_~next_alloc_idx~0 62) (= .cse0 3) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))) (<= 3 c_~top~0))) is different from false [2024-08-14 09:52:53,495 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 65))) (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (<= c_~next_alloc_idx~0 62) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 3) (< 0 c_~top~0) (or (< 64 c_~next_alloc_idx~0) (and (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))))) is different from false [2024-08-14 09:52:54,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:54,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:54,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:54,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:54,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 09:52:54,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-08-14 09:52:54,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:52:54,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:52:54,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-08-14 09:52:54,258 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-08-14 09:52:54,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:52:54,446 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:52:54,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:54,446 INFO L85 PathProgramCache]: Analyzing trace with hash 254653069, now seen corresponding path program 2 times [2024-08-14 09:52:54,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:54,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340580138] [2024-08-14 09:52:54,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:54,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 09:52:54,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:52:54,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340580138] [2024-08-14 09:52:54,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340580138] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:52:54,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096072434] [2024-08-14 09:52:54,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 09:52:54,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:52:54,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:52:54,732 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-08-14 09:52:54,733 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-08-14 09:52:54,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-08-14 09:52:54,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 09:52:54,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 19 conjunts are in the unsatisfiable core [2024-08-14 09:52:54,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:52:54,867 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 8 treesize of output 1 [2024-08-14 09:52:54,870 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-08-14 09:52:54,941 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2024-08-14 09:52:54,941 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 2 case distinctions, treesize of input 60 treesize of output 69 [2024-08-14 09:52:54,966 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 16 treesize of output 5 [2024-08-14 09:52:55,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:52:55,308 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 88 treesize of output 60 [2024-08-14 09:52:55,317 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 35 treesize of output 33 [2024-08-14 09:52:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-14 09:52:55,373 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 09:52:55,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096072434] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:52:55,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 09:52:55,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 19 [2024-08-14 09:52:55,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725782357] [2024-08-14 09:52:55,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:52:55,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-14 09:52:55,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:52:55,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-14 09:52:55,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-08-14 09:52:55,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:55,375 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:52:55,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 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-08-14 09:52:55,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:55,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:55,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:55,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:55,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-14 09:52:55,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-08-14 09:52:55,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:52:55,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:52:55,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-08-14 09:52:55,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:57,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:57,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:57,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:57,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:57,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 09:52:57,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-08-14 09:52:57,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:52:57,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:52:57,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-08-14 09:52:57,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:52:57,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-08-14 09:52:57,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:52:57,268 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:52:57,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:52:57,269 INFO L85 PathProgramCache]: Analyzing trace with hash 358001874, now seen corresponding path program 4 times [2024-08-14 09:52:57,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:52:57,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347434052] [2024-08-14 09:52:57,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:52:57,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:52:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:52:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 09:52:57,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:52:57,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347434052] [2024-08-14 09:52:57,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347434052] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:52:57,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789693291] [2024-08-14 09:52:57,588 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-08-14 09:52:57,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:52:57,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:52:57,591 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-08-14 09:52:57,593 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-08-14 09:52:57,755 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-08-14 09:52:57,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 09:52:57,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 27 conjunts are in the unsatisfiable core [2024-08-14 09:52:57,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:52:57,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-14 09:52:57,779 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-08-14 09:52:57,982 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-08-14 09:52:57,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2024-08-14 09:52:58,022 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 0 case distinctions, treesize of input 19 treesize of output 12 [2024-08-14 09:52:58,068 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-14 09:52:58,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-14 09:52:58,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-08-14 09:52:58,169 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-08-14 09:52:58,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-08-14 09:52:58,215 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 09:52:58,215 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 09:52:58,283 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_DerPreprocessor_11 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (< c_~next_alloc_idx~0 65)) (or (forall ((v_DerPreprocessor_12 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (< 64 c_~next_alloc_idx~0))) is different from false [2024-08-14 09:52:58,334 WARN L854 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or (let ((.cse0 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_11 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_12 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))) (< 64 c_~next_alloc_idx~0))) is different from false [2024-08-14 09:52:58,456 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65)) (or (< 64 c_~next_alloc_idx~0) (let ((.cse0 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_12) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0))))))))) is different from false [2024-08-14 09:52:59,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:52:59,296 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 4 case distinctions, treesize of input 38 treesize of output 52 [2024-08-14 09:52:59,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:52:59,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-08-14 09:52:59,402 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 195 treesize of output 183 [2024-08-14 09:52:59,433 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 5 treesize of output 3 [2024-08-14 09:52:59,438 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 9 treesize of output 7 [2024-08-14 09:52:59,440 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 10 treesize of output 8 [2024-08-14 09:52:59,494 INFO L349 Elim1Store]: treesize reduction 34, result has 62.6 percent of original size [2024-08-14 09:52:59,494 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 4 case distinctions, treesize of input 174 treesize of output 216 [2024-08-14 09:52:59,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:52:59,522 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 268 treesize of output 263 [2024-08-14 09:52:59,536 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 159 treesize of output 157 [2024-08-14 09:52:59,544 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 157 treesize of output 155 [2024-08-14 09:52:59,551 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 155 treesize of output 153 [2024-08-14 09:52:59,558 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 153 treesize of output 151 [2024-08-14 09:52:59,657 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 6 [2024-08-14 09:52:59,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:52:59,668 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 27 treesize of output 31 [2024-08-14 09:52:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 09:52:59,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789693291] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 09:52:59,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 09:52:59,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2024-08-14 09:52:59,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063891884] [2024-08-14 09:52:59,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 09:52:59,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-08-14 09:52:59,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:52:59,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-08-14 09:52:59,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=626, Unknown=17, NotChecked=162, Total=930 [2024-08-14 09:52:59,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:52:59,843 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:52:59,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.0) internal successors, (124), 30 states have internal predecessors, (124), 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-08-14 09:52:59,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:59,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:52:59,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:59,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:52:59,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-14 09:52:59,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-08-14 09:52:59,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:52:59,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:52:59,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-08-14 09:52:59,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:52:59,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:53:01,474 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 (+ c_~next_alloc_idx~0 1)) (<= c_~next_alloc_idx~0 62) (or (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65)) (or (< 64 c_~next_alloc_idx~0) (let ((.cse0 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_12) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0))))))))) is different from false [2024-08-14 09:53:01,531 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 65)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse2 (< 62 c_~next_alloc_idx~0)) (.cse3 (< c_~next_alloc_idx~0 63))) (and (<= 0 (+ c_~next_alloc_idx~0 1)) (<= c_~next_alloc_idx~0 62) (or .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_ArrVal_1036 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0))))) (< 0 c_~top~0) (or (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (or .cse1 (= c_~next_alloc_idx~0 0) (and (or .cse2 (and (or (< 60 c_~next_alloc_idx~0) (and (or (< 0 (+ c_~next_alloc_idx~0 2)) (forall ((v_prenex_78 Int) (v_prenex_77 Int) (v_prenex_79 Int)) (or (not (= (select |c_#valid| v_prenex_79) 0)) (not (= (select (store (store |c_#valid| v_prenex_79 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_prenex_78) v_prenex_77) 0))))) (forall ((v_prenex_79 Int)) (or (not (= (select |c_#valid| v_prenex_79) 0)) (forall ((v_prenex_78 Int)) (not (= (select (store (store |c_#valid| v_prenex_79 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_prenex_78) v_prenex_79) 0))))))) (or (forall ((v_prenex_88 Int) (v_prenex_86 Int)) (or (not (= (select (store (store |c_#valid| v_prenex_86 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_prenex_88) v_prenex_86) 0)) (not (= (select |c_#valid| v_prenex_86) 0)))) (< c_~next_alloc_idx~0 61)))) (or .cse3 (forall ((v_prenex_84 Int) (v_prenex_80 Int) (v_prenex_82 Int)) (or (not (= (select (store (store |c_#valid| v_prenex_84 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_prenex_82) v_prenex_80) 0)) (not (= (select |c_#valid| v_prenex_84) 0))))))) (or .cse1 (let ((.cse4 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or .cse2 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse4 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_12) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse3 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse4 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)))))))))) is different from false [2024-08-14 09:53:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:53:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:53:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:53:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:53:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 09:53:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-08-14 09:53:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:53:03,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:53:03,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-08-14 09:53:03,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:53:03,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-08-14 09:53:03,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-08-14 09:53:03,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:53:03,382 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:53:03,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:53:03,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1343895542, now seen corresponding path program 2 times [2024-08-14 09:53:03,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:53:03,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169179768] [2024-08-14 09:53:03,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:53:03,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:53:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:53:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:53:03,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:53:03,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169179768] [2024-08-14 09:53:03,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169179768] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:53:03,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601093074] [2024-08-14 09:53:03,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 09:53:03,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:53:03,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:53:03,853 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-08-14 09:53:03,857 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-08-14 09:53:03,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-14 09:53:03,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 09:53:03,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 21 conjunts are in the unsatisfiable core [2024-08-14 09:53:04,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:53:04,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-14 09:53:04,017 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-08-14 09:53:04,083 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-08-14 09:53:04,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2024-08-14 09:53:04,113 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-08-14 09:53:04,205 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-08-14 09:53:04,206 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 16 treesize of output 18 [2024-08-14 09:53:04,225 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-08-14 09:53:04,235 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:53:04,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 09:53:04,305 WARN L854 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (and (forall ((v_DerPreprocessor_17 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_17) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_DerPreprocessor_17 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_17) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)))) (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_DerPreprocessor_16 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)) (forall ((v_DerPreprocessor_16 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) is different from false [2024-08-14 09:53:05,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:53:05,390 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 4 case distinctions, treesize of input 38 treesize of output 52 [2024-08-14 09:53:05,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:53:05,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-08-14 09:53:05,497 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 363 treesize of output 349 [2024-08-14 09:53:05,551 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 24 treesize of output 22 [2024-08-14 09:53:05,554 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 48 treesize of output 44 [2024-08-14 09:53:05,557 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 23 treesize of output 21 [2024-08-14 09:53:05,578 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 25 treesize of output 23 [2024-08-14 09:53:05,580 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 48 treesize of output 44 [2024-08-14 09:53:05,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-08-14 09:53:05,601 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 568 treesize of output 536 [2024-08-14 09:53:05,642 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 48 treesize of output 44 [2024-08-14 09:53:05,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 22 treesize of output 20 [2024-08-14 09:53:05,676 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 24 treesize of output 22 [2024-08-14 09:53:05,679 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-08-14 09:53:05,700 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 40 treesize of output 36 [2024-08-14 09:53:05,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-08-14 09:53:05,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2024-08-14 09:53:05,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-08-14 09:53:05,754 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 24 treesize of output 22 [2024-08-14 09:53:05,757 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-08-14 09:53:05,823 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 17 treesize of output 15 [2024-08-14 09:53:05,826 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 24 treesize of output 20 [2024-08-14 09:53:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:53:06,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601093074] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 09:53:06,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 09:53:06,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 23 [2024-08-14 09:53:06,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690421180] [2024-08-14 09:53:06,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 09:53:06,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-08-14 09:53:06,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:53:06,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-08-14 09:53:06,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=433, Unknown=3, NotChecked=44, Total=600 [2024-08-14 09:53:06,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:53:06,027 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:53:06,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.625) internal successors, (87), 24 states have internal predecessors, (87), 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-08-14 09:53:06,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:53:06,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:53:06,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:53:06,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:53:06,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-14 09:53:06,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-08-14 09:53:06,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:53:06,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:53:06,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-08-14 09:53:06,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:53:06,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-08-14 09:53:06,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:53:11,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:53:16,786 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~next_alloc_idx~0 65))) (and (<= 0 (+ c_~next_alloc_idx~0 1)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (<= c_~next_alloc_idx~0 62) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_9) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 3) (or (< 64 c_~next_alloc_idx~0) (and (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_8 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))))) is different from false [2024-08-14 09:53:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:53:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:53:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:53:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:53:16,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 09:53:16,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-08-14 09:53:16,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:53:16,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:53:16,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-08-14 09:53:16,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:53:16,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-08-14 09:53:16,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-08-14 09:53:16,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-08-14 09:53:17,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-08-14 09:53:17,018 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:53:17,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:53:17,018 INFO L85 PathProgramCache]: Analyzing trace with hash -180467686, now seen corresponding path program 5 times [2024-08-14 09:53:17,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:53:17,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268753865] [2024-08-14 09:53:17,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:53:17,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:53:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:53:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 09:53:17,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:53:17,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268753865] [2024-08-14 09:53:17,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268753865] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:53:17,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745693108] [2024-08-14 09:53:17,259 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-08-14 09:53:17,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:53:17,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:53:17,264 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-08-14 09:53:17,264 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-08-14 09:53:17,391 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-08-14 09:53:17,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 09:53:17,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 21 conjunts are in the unsatisfiable core [2024-08-14 09:53:17,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:53:17,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-14 09:53:17,415 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 8 treesize of output 1 [2024-08-14 09:53:17,469 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-08-14 09:53:17,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2024-08-14 09:53:17,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-14 09:53:17,555 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 0 case distinctions, treesize of input 19 treesize of output 12 [2024-08-14 09:53:17,577 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-14 09:53:17,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-14 09:53:17,597 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-08-14 09:53:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 09:53:17,637 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 09:53:17,847 WARN L854 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((v_ArrVal_1196 Int) (v_DerPreprocessor_20 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_21 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_20) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (or (forall ((v_ArrVal_1196 Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_20 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_20) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)))) (< 64 c_~next_alloc_idx~0))) is different from false [2024-08-14 09:53:18,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:53:18,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-14 09:53:18,240 INFO L349 Elim1Store]: treesize reduction 12, result has 65.7 percent of original size [2024-08-14 09:53:18,240 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 156 [2024-08-14 09:53:18,248 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 168 treesize of output 166 [2024-08-14 09:53:18,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 138 treesize of output 136 [2024-08-14 09:53:18,256 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 136 treesize of output 134 [2024-08-14 09:53:18,259 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 134 treesize of output 132 [2024-08-14 09:53:18,263 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 132 treesize of output 130 [2024-08-14 09:53:18,268 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 130 treesize of output 128 [2024-08-14 09:53:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 09:53:18,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745693108] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 09:53:18,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 09:53:18,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 28 [2024-08-14 09:53:18,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752295254] [2024-08-14 09:53:18,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 09:53:18,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-08-14 09:53:18,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:53:18,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-08-14 09:53:18,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=633, Unknown=15, NotChecked=52, Total=812 [2024-08-14 09:53:18,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:53:18,436 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:53:18,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.517241379310345) internal successors, (131), 28 states have internal predecessors, (131), 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-08-14 09:53:18,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:53:18,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:53:18,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:53:18,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:53:18,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-14 09:53:18,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-08-14 09:53:18,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:53:18,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:53:18,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-08-14 09:53:18,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:53:18,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-08-14 09:53:18,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-08-14 09:53:18,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:53:20,050 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_ArrVal_1196 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int)) (or (not (= 0 (select (select (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_20) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)))) (or (< c_~next_alloc_idx~0 65) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| Int) (v_DerPreprocessor_20 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1196 Int) (v_DerPreprocessor_21 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int)) (or (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_21) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_20) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_20 (Array Int Int)) (v_ArrVal_1196 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int)) (or (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) 0)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_20) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_29|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (< 64 c_~next_alloc_idx~0))) is different from false [2024-08-14 09:53:20,162 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_ArrVal_1196 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| Int)) (or (not (= 0 (select (select (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_20) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1196) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_29|) 0)))) (not (= c_~top~0 0))) is different from false [2024-08-14 09:53:30,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:53:32,507 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-08-14 09:53:35,914 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-08-14 09:53:36,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:53:36,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:53:36,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-14 09:53:36,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:53:36,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-14 09:53:36,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-08-14 09:53:36,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:53:36,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:53:36,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-08-14 09:53:36,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:53:36,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-08-14 09:53:36,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-08-14 09:53:36,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-08-14 09:53:36,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-08-14 09:53:36,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-08-14 09:53:36,258 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:53:36,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:53:36,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2052094424, now seen corresponding path program 3 times [2024-08-14 09:53:36,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:53:36,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916663655] [2024-08-14 09:53:36,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:53:36,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:53:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:53:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:53:36,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:53:36,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916663655] [2024-08-14 09:53:36,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916663655] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:53:36,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607743411] [2024-08-14 09:53:36,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-14 09:53:36,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:53:36,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:53:36,504 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-08-14 09:53:36,505 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-08-14 09:53:36,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-08-14 09:53:36,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 09:53:36,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-14 09:53:36,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:53:36,633 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 8 treesize of output 1 [2024-08-14 09:53:36,643 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-08-14 09:53:36,707 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-08-14 09:53:36,708 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 2 case distinctions, treesize of input 28 treesize of output 23 [2024-08-14 09:53:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 09:53:36,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 09:53:39,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:53:39,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-14 09:53:39,487 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-14 09:53:39,487 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 296 treesize of output 286 [2024-08-14 09:53:39,494 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 176 treesize of output 168 [2024-08-14 09:53:39,498 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 164 treesize of output 156 [2024-08-14 09:53:39,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:53:39,511 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 476 treesize of output 468 [2024-08-14 09:53:39,519 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 261 treesize of output 253 [2024-08-14 09:53:39,570 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 6 [2024-08-14 09:53:39,577 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 6 [2024-08-14 09:53:39,597 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 121 treesize of output 119 [2024-08-14 09:53:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 09:53:39,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607743411] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 09:53:39,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 09:53:39,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2024-08-14 09:53:39,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224213599] [2024-08-14 09:53:39,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 09:53:39,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-08-14 09:53:39,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:53:39,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-08-14 09:53:39,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=306, Unknown=4, NotChecked=0, Total=380 [2024-08-14 09:53:39,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:53:39,667 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:53:39,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.894736842105263) internal successors, (93), 19 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-08-14 09:53:39,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:53:39,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:53:39,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-08-14 09:53:39,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:53:39,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-14 09:53:39,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2024-08-14 09:53:39,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:53:39,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:53:39,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-08-14 09:53:39,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:53:39,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-08-14 09:53:39,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2024-08-14 09:53:39,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-08-14 09:53:39,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:53:42,359 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-08-14 09:53:44,947 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-08-14 09:53:47,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:53:49,064 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-08-14 09:53:51,150 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-08-14 09:53:53,265 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-08-14 09:53:55,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:54:05,499 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-08-14 09:54:20,309 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-08-14 09:54:22,341 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-08-14 09:54:35,634 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-08-14 09:54:39,471 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-08-14 09:54:53,269 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-08-14 09:55:45,113 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (let ((.cse3 (+ c_~next_alloc_idx~0 2)) (.cse0 (< 64 c_~next_alloc_idx~0)) (.cse2 (= 3 .cse8)) (.cse13 (< c_~next_alloc_idx~0 65)) (.cse14 (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or .cse0 (let ((.cse1 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (and (<= .cse1 64) (<= 0 .cse1)))) .cse2 (<= 0 .cse3) (or .cse0 (and (or (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse4 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse4 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= (select (select (store .cse4 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_24) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse5 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse5 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= 0 (select (select (store .cse5 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_24) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) (< c_~next_alloc_idx~0 63)) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse7 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (let ((.cse6 (select .cse7 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (or (not (= (+ (select .cse6 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (< 0 (+ (select (select (store .cse7 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store .cse6 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| .cse3)) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1)))))))) (= 3 c_~top~0) (<= c_~next_alloc_idx~0 60) (<= 3 .cse8) (or .cse0 (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse9 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (or (not (= (+ (select .cse9 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (< 0 (+ (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store .cse9 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (let ((.cse10 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (or (< (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store .cse10 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 65) (not (= (+ (select .cse10 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0))))))) (or (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_24 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25))) (or (not (= (+ (select (select .cse11 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (< (select (select (store .cse11 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_24) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 65)))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_prenex_196 (Array Int Int)) (v_prenex_197 Int) (v_prenex_195 Int) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25))) (or (not (= (+ (select (select .cse12 v_prenex_195) v_prenex_197) 1) 0)) (< 0 (+ (select (select (store .cse12 v_prenex_195 v_prenex_196) |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 1)))))) .cse13) (or .cse13 (and (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_24) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)) (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_24) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))) (exists ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (= 5 (select (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (or .cse2 .cse14) (or .cse13 (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (or (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_24) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_36|) 1) 0)) (forall ((v_DerPreprocessor_24 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_24) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) (or (not .cse14) (and (<= .cse8 5) (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))) is different from false [2024-08-14 09:55:47,511 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-08-14 09:56:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:56:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:56:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-14 09:56:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:56:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-14 09:56:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-08-14 09:56:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:56:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:56:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-08-14 09:56:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:56:03,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-08-14 09:56:03,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-08-14 09:56:03,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-08-14 09:56:03,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-08-14 09:56:03,286 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-08-14 09:56:03,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-08-14 09:56:03,474 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:56:03,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:56:03,475 INFO L85 PathProgramCache]: Analyzing trace with hash -2103920734, now seen corresponding path program 6 times [2024-08-14 09:56:03,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:56:03,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74493348] [2024-08-14 09:56:03,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:56:03,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:56:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:56:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:56:03,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:56:03,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74493348] [2024-08-14 09:56:03,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74493348] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:56:03,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008805054] [2024-08-14 09:56:03,801 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-08-14 09:56:03,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:56:03,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:56:03,802 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 09:56:03,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-08-14 09:56:03,920 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-08-14 09:56:03,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 09:56:03,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 22 conjunts are in the unsatisfiable core [2024-08-14 09:56:03,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:56:03,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 46 [2024-08-14 09:56:03,959 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 5 treesize of output 3 [2024-08-14 09:56:03,967 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 16 treesize of output 5 [2024-08-14 09:56:03,969 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 5 treesize of output 3 [2024-08-14 09:56:04,108 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-08-14 09:56:04,109 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 2 case distinctions, treesize of input 57 treesize of output 85 [2024-08-14 09:56:04,152 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-08-14 09:56:04,201 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-08-14 09:56:04,202 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 2 case distinctions, treesize of input 57 treesize of output 58 [2024-08-14 09:56:04,208 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 5 treesize of output 3 [2024-08-14 09:56:04,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:56:04,219 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 37 treesize of output 37 [2024-08-14 09:56:04,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:56:04,482 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 51 treesize of output 35 [2024-08-14 09:56:04,550 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-14 09:56:04,551 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 09:56:04,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008805054] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:56:04,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 09:56:04,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2024-08-14 09:56:04,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110513613] [2024-08-14 09:56:04,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:56:04,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-14 09:56:04,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:56:04,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-14 09:56:04,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2024-08-14 09:56:04,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:56:04,552 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:56:04,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 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-08-14 09:56:04,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:56:04,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:56:04,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-08-14 09:56:04,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:56:04,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-14 09:56:04,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-08-14 09:56:04,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:56:04,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:56:04,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-08-14 09:56:04,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:56:04,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-08-14 09:56:04,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-08-14 09:56:04,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-08-14 09:56:04,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-08-14 09:56:04,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:56:07,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:56:07,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:56:07,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-14 09:56:07,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:56:07,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-14 09:56:07,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-08-14 09:56:07,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:56:07,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:56:07,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-08-14 09:56:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:56:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-08-14 09:56:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-08-14 09:56:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-08-14 09:56:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-08-14 09:56:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:56:07,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-08-14 09:56:07,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:56:07,686 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:56:07,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:56:07,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1048605138, now seen corresponding path program 7 times [2024-08-14 09:56:07,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:56:07,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865283770] [2024-08-14 09:56:07,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:56:07,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:56:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:56:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:56:08,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:56:08,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865283770] [2024-08-14 09:56:08,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865283770] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:56:08,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725046255] [2024-08-14 09:56:08,106 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-08-14 09:56:08,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:56:08,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:56:08,108 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 09:56:08,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-08-14 09:56:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:56:08,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-14 09:56:08,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:56:08,281 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 8 treesize of output 1 [2024-08-14 09:56:08,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-08-14 09:56:08,414 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-08-14 09:56:08,415 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 1 case distinctions, treesize of input 19 treesize of output 22 [2024-08-14 09:56:08,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:56:08,568 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 31 treesize of output 23 [2024-08-14 09:56:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:56:08,611 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 09:56:20,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:56:20,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-14 09:56:20,667 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 127 treesize of output 117 [2024-08-14 09:56:20,682 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 10 treesize of output 8 [2024-08-14 09:56:20,689 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 9 treesize of output 7 [2024-08-14 09:56:20,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:56:20,709 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 18 treesize of output 19 [2024-08-14 09:56:20,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2024-08-14 09:56:20,716 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 9 treesize of output 7 [2024-08-14 09:56:20,728 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 9 treesize of output 7 [2024-08-14 09:56:20,731 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 10 treesize of output 8 [2024-08-14 09:56:20,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 09:56:20,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725046255] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 09:56:20,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 09:56:20,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 6] total 18 [2024-08-14 09:56:20,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475156515] [2024-08-14 09:56:20,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 09:56:20,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-08-14 09:56:20,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:56:20,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-08-14 09:56:20,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=274, Unknown=7, NotChecked=0, Total=342 [2024-08-14 09:56:20,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:56:20,790 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:56:20,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.7894736842105265) internal successors, (110), 18 states have internal predecessors, (110), 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-08-14 09:56:20,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:56:20,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:56:20,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-08-14 09:56:20,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:56:20,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-14 09:56:20,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-08-14 09:56:20,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:56:20,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:56:20,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-08-14 09:56:20,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:56:20,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-08-14 09:56:20,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-08-14 09:56:20,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-08-14 09:56:20,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-08-14 09:56:20,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:56:20,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:56:23,779 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-08-14 09:56:25,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:56:27,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:56:29,883 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-08-14 09:56:31,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:56:33,747 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-08-14 09:56:36,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:56:37,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:56:39,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:56:47,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:56:49,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:56:51,215 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-08-14 09:56:52,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:56:54,868 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-08-14 09:56:56,888 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-08-14 09:56:58,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:56:58,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:56:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-14 09:56:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:56:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-14 09:56:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-08-14 09:56:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:56:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:56:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-08-14 09:56:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:56:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-08-14 09:56:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-08-14 09:56:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-08-14 09:56:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-08-14 09:56:58,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:56:58,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-08-14 09:56:58,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-08-14 09:56:58,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-08-14 09:56:58,604 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:56:58,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:56:58,604 INFO L85 PathProgramCache]: Analyzing trace with hash -18328603, now seen corresponding path program 2 times [2024-08-14 09:56:58,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:56:58,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481862329] [2024-08-14 09:56:58,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:56:58,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:56:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:56:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 09:56:58,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:56:58,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481862329] [2024-08-14 09:56:58,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481862329] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:56:58,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292066973] [2024-08-14 09:56:58,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 09:56:58,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:56:58,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:56:58,973 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 09:56:58,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-08-14 09:56:59,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-14 09:56:59,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 09:56:59,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjunts are in the unsatisfiable core [2024-08-14 09:56:59,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:56:59,153 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 8 treesize of output 1 [2024-08-14 09:56:59,183 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 8 treesize of output 1 [2024-08-14 09:56:59,189 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-08-14 09:56:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 09:56:59,220 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 09:56:59,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:56:59,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-14 09:56:59,545 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 09:56:59,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292066973] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 09:56:59,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 09:56:59,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-08-14 09:56:59,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924811800] [2024-08-14 09:56:59,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 09:56:59,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-14 09:56:59,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:56:59,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-14 09:56:59,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-08-14 09:56:59,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:56:59,547 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:56:59,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 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-08-14 09:56:59,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:56:59,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:56:59,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-08-14 09:56:59,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-14 09:56:59,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-14 09:56:59,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-08-14 09:56:59,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:56:59,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:56:59,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-08-14 09:56:59,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:56:59,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-08-14 09:56:59,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-08-14 09:56:59,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-08-14 09:56:59,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-08-14 09:56:59,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:56:59,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-08-14 09:56:59,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:57:03,526 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (< c_~next_alloc_idx~0 65)) (.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (< 62 c_~next_alloc_idx~0)) (.cse3 (< c_~next_alloc_idx~0 63)) (.cse2 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or .cse0 (and (or .cse1 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_12) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse3 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_11 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (= c_~next_alloc_idx~0 3) (or .cse4 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse4 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_ArrVal_1036 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0))))) (or .cse0 (and (or .cse3 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_12 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_12) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)))) .cse1))) (or (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse4) (= |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 0) (or .cse4 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_13) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse0 (= c_~next_alloc_idx~0 0) (and (or .cse1 (and (or (< 60 c_~next_alloc_idx~0) (and (or (< 0 (+ c_~next_alloc_idx~0 2)) (forall ((v_prenex_78 Int) (v_prenex_77 Int) (v_prenex_79 Int)) (or (not (= (select |c_#valid| v_prenex_79) 0)) (not (= (select (store (store |c_#valid| v_prenex_79 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_prenex_78) v_prenex_77) 0))))) (forall ((v_prenex_79 Int)) (or (not (= (select |c_#valid| v_prenex_79) 0)) (forall ((v_prenex_78 Int)) (not (= (select (store (store |c_#valid| v_prenex_79 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_prenex_78) v_prenex_79) 0))))))) (or (forall ((v_prenex_88 Int) (v_prenex_86 Int)) (or (not (= (select (store (store |c_#valid| v_prenex_86 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_prenex_88) v_prenex_86) 0)) (not (= (select |c_#valid| v_prenex_86) 0)))) (< c_~next_alloc_idx~0 61)))) (or .cse3 (forall ((v_prenex_84 Int) (v_prenex_80 Int) (v_prenex_82 Int)) (or (not (= (select (store (store |c_#valid| v_prenex_84 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_prenex_82) v_prenex_80) 0)) (not (= (select |c_#valid| v_prenex_84) 0))))))) (or .cse0 (and (or .cse1 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_12) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse3 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0))))))))) is different from false [2024-08-14 09:57:28,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:57:35,589 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-08-14 09:57:37,666 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-08-14 09:57:39,815 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-08-14 09:57:43,565 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse3 (< c_~next_alloc_idx~0 63)) (.cse1 (< 62 c_~next_alloc_idx~0)) (.cse4 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (let ((.cse2 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or .cse1 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_12 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_12) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse3 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_11 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))))) (or (and (or .cse0 (and (or .cse3 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_12 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_12) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)))) .cse1))) (or .cse4 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_1036 Int) (v_DerPreprocessor_11 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| 1) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1036) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_13) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_25|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))) (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse4 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_11) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (< 0 c_~top~0))) is different from false [2024-08-14 09:57:47,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:58:14,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:58:17,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:58:22,448 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-08-14 09:58:24,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:58:26,989 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-08-14 09:58:28,997 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-08-14 09:58:30,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:58:32,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:58:34,081 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-08-14 09:58:36,096 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-08-14 09:58:38,103 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-08-14 09:58:40,143 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-08-14 09:58:41,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:58:44,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:58:45,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:58:47,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 09:58:47,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:47,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:47,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-08-14 09:58:47,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:58:47,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-14 09:58:47,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-08-14 09:58:47,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:58:47,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:58:47,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-08-14 09:58:47,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:58:47,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-08-14 09:58:47,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-08-14 09:58:47,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-08-14 09:58:47,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-08-14 09:58:47,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-14 09:58:47,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-08-14 09:58:47,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:58:47,668 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 3 remaining) [2024-08-14 09:58:47,668 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 3 remaining) [2024-08-14 09:58:47,668 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-08-14 09:58:47,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-08-14 09:58:47,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-08-14 09:58:47,871 INFO L445 BasicCegarLoop]: Path program histogram: [7, 3, 2, 2, 1, 1, 1] [2024-08-14 09:58:47,873 INFO L308 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork0 was SAFE,SAFE,SAFE (1/4) [2024-08-14 09:58:47,993 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 09:58:47,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-14 09:58:47,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:58:47,996 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-14 09:58:48,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (23)] Waiting until timeout for monitored process [2024-08-14 09:58:48,014 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-14 09:58:48,014 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-14 09:58:48,014 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@227b3078, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 09:58:48,014 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 09:58:48,125 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 09:58:48,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:58:48,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1034262692, now seen corresponding path program 1 times [2024-08-14 09:58:48,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:58:48,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023925020] [2024-08-14 09:58:48,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:58:48,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:58:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:58:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-14 09:58:48,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:58:48,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023925020] [2024-08-14 09:58:48,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023925020] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:58:48,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 09:58:48,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-14 09:58:48,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819004886] [2024-08-14 09:58:48,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:58:48,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 09:58:48,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:58:48,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 09:58:48,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 09:58:48,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:58:48,157 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:58:48,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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-08-14 09:58:48,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:58:48,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:48,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-08-14 09:58:48,230 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 09:58:48,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:58:48,230 INFO L85 PathProgramCache]: Analyzing trace with hash 24134340, now seen corresponding path program 1 times [2024-08-14 09:58:48,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:58:48,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813096317] [2024-08-14 09:58:48,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:58:48,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:58:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:58:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-14 09:58:48,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:58:48,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813096317] [2024-08-14 09:58:48,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813096317] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:58:48,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474806808] [2024-08-14 09:58:48,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:58:48,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:58:48,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:58:48,316 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 09:58:48,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-08-14 09:58:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:58:48,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-14 09:58:48,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:58:48,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-08-14 09:58:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-14 09:58:48,482 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 09:58:48,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474806808] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:58:48,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 09:58:48,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-08-14 09:58:48,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902439204] [2024-08-14 09:58:48,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:58:48,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 09:58:48,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:58:48,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 09:58:48,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-08-14 09:58:48,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:58:48,483 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:58:48,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 09:58:48,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:48,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:58:48,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:48,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:48,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-08-14 09:58:48,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:58:48,732 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 09:58:48,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:58:48,732 INFO L85 PathProgramCache]: Analyzing trace with hash 665710870, now seen corresponding path program 1 times [2024-08-14 09:58:48,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:58:48,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312518741] [2024-08-14 09:58:48,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:58:48,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:58:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:58:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-14 09:58:48,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:58:48,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312518741] [2024-08-14 09:58:48,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312518741] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:58:48,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 09:58:48,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 09:58:48,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970033236] [2024-08-14 09:58:48,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:58:48,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 09:58:48,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:58:48,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 09:58:48,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-14 09:58:48,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:58:48,801 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:58:48,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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-08-14 09:58:48,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:48,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:48,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:58:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-14 09:58:48,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-08-14 09:58:48,922 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-14 09:58:48,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:58:48,922 INFO L85 PathProgramCache]: Analyzing trace with hash 117609650, now seen corresponding path program 1 times [2024-08-14 09:58:48,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:58:48,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305967784] [2024-08-14 09:58:48,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:58:48,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:58:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 09:58:48,934 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 09:58:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 09:58:48,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 09:58:48,953 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 09:58:48,953 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-14 09:58:48,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-08-14 09:58:48,954 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-08-14 09:58:48,955 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/4) [2024-08-14 09:58:48,955 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-14 09:58:48,955 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-08-14 09:58:48,976 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-14 09:58:48,979 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 09:58:48,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-14 09:58:48,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:58:48,981 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-14 09:58:48,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (25)] Waiting until timeout for monitored process [2024-08-14 09:58:48,984 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-14 09:58:48,984 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of4ForFork0 ======== [2024-08-14 09:58:48,985 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@227b3078, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 09:58:48,985 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-08-14 09:58:49,107 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:58:49,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:58:49,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1499481995, now seen corresponding path program 1 times [2024-08-14 09:58:49,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:58:49,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138217846] [2024-08-14 09:58:49,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:58:49,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:58:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:58:49,139 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 09:58:49,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:58:49,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138217846] [2024-08-14 09:58:49,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138217846] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:58:49,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 09:58:49,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-14 09:58:49,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035104784] [2024-08-14 09:58:49,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:58:49,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 09:58:49,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:58:49,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 09:58:49,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 09:58:49,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:58:49,141 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:58:49,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 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-08-14 09:58:49,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:58:49,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:49,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-08-14 09:58:49,220 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:58:49,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:58:49,220 INFO L85 PathProgramCache]: Analyzing trace with hash 271572029, now seen corresponding path program 1 times [2024-08-14 09:58:49,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:58:49,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544572285] [2024-08-14 09:58:49,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:58:49,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:58:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:58:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:58:49,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:58:49,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544572285] [2024-08-14 09:58:49,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544572285] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:58:49,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931862046] [2024-08-14 09:58:49,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:58:49,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:58:49,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:58:49,305 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 09:58:49,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-08-14 09:58:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:58:49,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-14 09:58:49,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:58:49,449 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-08-14 09:58:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:58:49,478 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 09:58:49,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931862046] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:58:49,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 09:58:49,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-08-14 09:58:49,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145264543] [2024-08-14 09:58:49,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:58:49,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 09:58:49,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:58:49,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 09:58:49,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-08-14 09:58:49,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:58:49,480 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:58:49,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-08-14 09:58:49,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:49,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:58:50,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:50,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:50,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-08-14 09:58:51,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-08-14 09:58:51,086 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:58:51,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:58:51,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1736072425, now seen corresponding path program 1 times [2024-08-14 09:58:51,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:58:51,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008040323] [2024-08-14 09:58:51,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:58:51,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:58:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:58:51,316 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:58:51,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:58:51,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008040323] [2024-08-14 09:58:51,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008040323] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:58:51,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953292154] [2024-08-14 09:58:51,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:58:51,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:58:51,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:58:51,321 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 09:58:51,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-08-14 09:58:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:58:51,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 10 conjunts are in the unsatisfiable core [2024-08-14 09:58:51,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:58:51,501 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 8 treesize of output 1 [2024-08-14 09:58:51,530 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-08-14 09:58:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:58:51,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 09:58:51,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:58:51,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-14 09:58:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:58:51,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953292154] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 09:58:51,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 09:58:51,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-08-14 09:58:51,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837963873] [2024-08-14 09:58:51,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 09:58:51,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-14 09:58:51,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:58:51,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-14 09:58:51,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-08-14 09:58:51,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:58:51,819 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:58:51,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 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-08-14 09:58:51,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:51,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:51,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:58:53,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:53,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:53,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-14 09:58:53,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-08-14 09:58:53,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-08-14 09:58:53,795 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:58:53,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:58:53,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1638380063, now seen corresponding path program 1 times [2024-08-14 09:58:53,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:58:53,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984643876] [2024-08-14 09:58:53,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:58:53,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:58:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:58:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:58:53,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:58:53,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984643876] [2024-08-14 09:58:53,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984643876] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:58:53,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086045502] [2024-08-14 09:58:53,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:58:53,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:58:53,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:58:53,916 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 09:58:53,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-08-14 09:58:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:58:54,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-14 09:58:54,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:58:54,096 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 8 treesize of output 1 [2024-08-14 09:58:54,125 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 8 treesize of output 1 [2024-08-14 09:58:54,153 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-08-14 09:58:54,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:58:54,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 09:58:54,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:58:54,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-14 09:58:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:58:54,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086045502] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 09:58:54,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 09:58:54,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-08-14 09:58:54,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905364515] [2024-08-14 09:58:54,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 09:58:54,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-14 09:58:54,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:58:54,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-14 09:58:54,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-08-14 09:58:54,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:58:54,618 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:58:54,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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-08-14 09:58:54,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:54,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:54,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-14 09:58:54,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:58:56,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:56,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:56,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-14 09:58:56,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-14 09:58:56,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-08-14 09:58:56,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-08-14 09:58:56,962 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:58:56,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:58:56,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1484172777, now seen corresponding path program 1 times [2024-08-14 09:58:56,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:58:56,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925895546] [2024-08-14 09:58:56,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:58:56,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:58:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:58:57,195 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:58:57,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:58:57,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925895546] [2024-08-14 09:58:57,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925895546] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:58:57,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541655690] [2024-08-14 09:58:57,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:58:57,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:58:57,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:58:57,199 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 09:58:57,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-08-14 09:58:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:58:57,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 12 conjunts are in the unsatisfiable core [2024-08-14 09:58:57,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:58:57,392 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 8 treesize of output 1 [2024-08-14 09:58:57,422 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 8 treesize of output 1 [2024-08-14 09:58:57,452 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 8 treesize of output 1 [2024-08-14 09:58:57,474 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-08-14 09:58:57,491 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:58:57,491 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 09:58:57,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:58:57,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-14 09:58:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:58:57,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541655690] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 09:58:57,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 09:58:57,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-08-14 09:58:57,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874362025] [2024-08-14 09:58:57,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 09:58:57,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-08-14 09:58:57,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:58:57,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-08-14 09:58:57,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-08-14 09:58:57,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:58:57,934 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:58:57,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.923076923076923) internal successors, (116), 13 states have internal predecessors, (116), 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-08-14 09:58:57,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:57,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:57,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-14 09:58:57,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-14 09:58:57,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:58:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:58:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-14 09:58:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-14 09:58:59,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-14 09:58:59,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-08-14 09:58:59,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,29 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:58:59,913 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:58:59,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:58:59,914 INFO L85 PathProgramCache]: Analyzing trace with hash -451042575, now seen corresponding path program 1 times [2024-08-14 09:58:59,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:58:59,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125951858] [2024-08-14 09:58:59,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:58:59,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:58:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:59:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:59:00,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:59:00,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125951858] [2024-08-14 09:59:00,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125951858] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:59:00,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577646207] [2024-08-14 09:59:00,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:59:00,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:59:00,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:59:00,282 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 09:59:00,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-08-14 09:59:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:59:00,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-14 09:59:00,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:59:00,476 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 8 treesize of output 1 [2024-08-14 09:59:00,504 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 8 treesize of output 1 [2024-08-14 09:59:00,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-14 09:59:00,559 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-08-14 09:59:00,651 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-14 09:59:00,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-14 09:59:00,687 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-08-14 09:59:00,725 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:59:00,725 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 09:59:00,809 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_35 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_35) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) is different from false [2024-08-14 09:59:01,024 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 10 treesize of output 8 [2024-08-14 09:59:01,037 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 10 treesize of output 8 [2024-08-14 09:59:01,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:59:01,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-14 09:59:01,977 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-14 09:59:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:59:02,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577646207] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 09:59:02,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 09:59:02,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2024-08-14 09:59:02,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44989977] [2024-08-14 09:59:02,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 09:59:02,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-08-14 09:59:02,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:59:02,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-08-14 09:59:02,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=401, Unknown=11, NotChecked=42, Total=552 [2024-08-14 09:59:02,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:59:02,026 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:59:02,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.125) internal successors, (123), 23 states have internal predecessors, (123), 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-08-14 09:59:02,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:59:02,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:59:02,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-14 09:59:02,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-14 09:59:02,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-14 09:59:02,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:59:13,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:59:13,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:59:13,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-14 09:59:13,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-14 09:59:13,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-14 09:59:13,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-08-14 09:59:13,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-08-14 09:59:13,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-08-14 09:59:13,872 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:59:13,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:59:13,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1788344206, now seen corresponding path program 1 times [2024-08-14 09:59:13,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:59:13,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401584736] [2024-08-14 09:59:13,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:59:13,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:59:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:59:14,265 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:59:14,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:59:14,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401584736] [2024-08-14 09:59:14,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401584736] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:59:14,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388015174] [2024-08-14 09:59:14,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:59:14,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:59:14,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:59:14,270 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 09:59:14,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-08-14 09:59:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:59:14,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2024-08-14 09:59:14,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:59:14,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-08-14 09:59:14,536 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-14 09:59:14,536 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 09:59:14,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388015174] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:59:14,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 09:59:14,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-08-14 09:59:14,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472301602] [2024-08-14 09:59:14,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:59:14,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-14 09:59:14,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:59:14,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-14 09:59:14,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-08-14 09:59:14,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:59:14,537 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:59:14,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-08-14 09:59:14,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:59:14,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:59:14,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-14 09:59:14,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-14 09:59:14,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-14 09:59:14,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-08-14 09:59:14,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:59:15,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:59:15,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:59:15,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-14 09:59:15,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-14 09:59:15,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-14 09:59:15,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-08-14 09:59:15,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:59:15,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2024-08-14 09:59:16,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-08-14 09:59:16,129 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:59:16,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:59:16,129 INFO L85 PathProgramCache]: Analyzing trace with hash 423370484, now seen corresponding path program 2 times [2024-08-14 09:59:16,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:59:16,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250652335] [2024-08-14 09:59:16,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:59:16,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:59:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:59:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:59:16,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:59:16,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250652335] [2024-08-14 09:59:16,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250652335] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:59:16,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840923829] [2024-08-14 09:59:16,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 09:59:16,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:59:16,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:59:16,410 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 09:59:16,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-08-14 09:59:16,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-08-14 09:59:16,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 09:59:16,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-14 09:59:16,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:59:16,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-08-14 09:59:16,605 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 8 treesize of output 1 [2024-08-14 09:59:16,656 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-08-14 09:59:16,656 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 2 case distinctions, treesize of input 47 treesize of output 79 [2024-08-14 09:59:16,696 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 5 treesize of output 3 [2024-08-14 09:59:17,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:59:17,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 117 [2024-08-14 09:59:17,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:59:17,299 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 77 treesize of output 82 [2024-08-14 09:59:17,303 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 73 treesize of output 69 [2024-08-14 09:59:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-14 09:59:17,458 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 09:59:17,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840923829] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:59:17,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 09:59:17,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 21 [2024-08-14 09:59:17,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002353281] [2024-08-14 09:59:17,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:59:17,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-14 09:59:17,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:59:17,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-14 09:59:17,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2024-08-14 09:59:17,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:59:17,462 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:59:17,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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-08-14 09:59:17,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:59:17,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:59:17,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-14 09:59:17,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-14 09:59:17,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-14 09:59:17,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-08-14 09:59:17,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:59:17,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:59:19,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-14 09:59:22,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-14 09:59:24,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:59:24,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:59:24,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-14 09:59:24,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-14 09:59:24,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-14 09:59:24,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-08-14 09:59:24,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:59:24,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:59:24,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-08-14 09:59:24,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-08-14 09:59:24,660 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:59:24,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:59:24,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1457489570, now seen corresponding path program 3 times [2024-08-14 09:59:24,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:59:24,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689258302] [2024-08-14 09:59:24,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:59:24,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:59:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:59:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:59:24,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:59:24,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689258302] [2024-08-14 09:59:24,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689258302] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:59:24,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899574249] [2024-08-14 09:59:24,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-14 09:59:24,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:59:24,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:59:24,950 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 09:59:24,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-08-14 09:59:25,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-08-14 09:59:25,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 09:59:25,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-14 09:59:25,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:59:25,136 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 8 treesize of output 1 [2024-08-14 09:59:25,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-08-14 09:59:25,193 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-08-14 09:59:25,193 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 2 case distinctions, treesize of input 47 treesize of output 79 [2024-08-14 09:59:25,224 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 5 treesize of output 3 [2024-08-14 09:59:25,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:59:25,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 115 [2024-08-14 09:59:25,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:59:25,933 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 75 treesize of output 80 [2024-08-14 09:59:25,938 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 71 treesize of output 67 [2024-08-14 09:59:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-14 09:59:26,126 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 09:59:26,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899574249] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 09:59:26,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 09:59:26,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 20 [2024-08-14 09:59:26,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568339003] [2024-08-14 09:59:26,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 09:59:26,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-14 09:59:26,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:59:26,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-14 09:59:26,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2024-08-14 09:59:26,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:59:26,128 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:59:26,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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-08-14 09:59:26,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:59:26,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:59:26,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-14 09:59:26,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-14 09:59:26,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-14 09:59:26,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-08-14 09:59:26,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:59:26,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:59:26,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:59:28,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-14 09:59:30,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-14 09:59:33,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-14 09:59:36,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-14 09:59:39,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-14 09:59:41,300 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 [0] [2024-08-14 09:59:41,567 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)) (.cse2 (not (= .cse3 0)))) (and (<= .cse0 64) (not (= c_~top~0 0)) (let ((.cse1 (= |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (or (and (exists ((v_DerPreprocessor_41 (Array Int Int))) (and (<= (select v_DerPreprocessor_41 |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_41) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse1) (and .cse2 (or (exists ((v_DerPreprocessor_41 (Array Int Int))) (and (= (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_41) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) .cse3) (<= (select v_DerPreprocessor_41 |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) 0))) (and (= |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) .cse1))))) (not (= .cse0 0)) (or (and .cse2 (or (and (<= c_~top~0 .cse3) (<= .cse3 64)) (exists ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| Int) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse4 (select (select |c_#memory_int| |thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (and (<= c_~top~0 .cse4) (<= .cse4 64) (not (= .cse4 0)) (exists ((v_DerPreprocessor_41 (Array Int Int))) (and (= (select (select (store |c_#memory_int| |thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_41) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) .cse3) (<= (select v_DerPreprocessor_41 |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) 0)))))))) (exists ((v_DerPreprocessor_41 (Array Int Int)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse5 (select (select |c_#memory_int| |thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (and (<= .cse5 64) (<= (select v_DerPreprocessor_41 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_41) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= .cse5 0)) (<= c_~top~0 .cse5)))))))) is different from true [2024-08-14 09:59:43,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-14 09:59:46,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-14 09:59:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:59:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:59:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-14 09:59:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-14 09:59:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-14 09:59:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-08-14 09:59:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:59:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:59:46,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-14 09:59:46,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2024-08-14 09:59:46,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-08-14 09:59:46,278 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 09:59:46,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 09:59:46,278 INFO L85 PathProgramCache]: Analyzing trace with hash -895613426, now seen corresponding path program 4 times [2024-08-14 09:59:46,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 09:59:46,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479656181] [2024-08-14 09:59:46,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 09:59:46,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 09:59:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 09:59:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:59:46,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 09:59:46,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479656181] [2024-08-14 09:59:46,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479656181] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 09:59:46,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990600348] [2024-08-14 09:59:46,626 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-08-14 09:59:46,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 09:59:46,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 09:59:46,628 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 09:59:46,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-08-14 09:59:46,820 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-08-14 09:59:46,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 09:59:46,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 15 conjunts are in the unsatisfiable core [2024-08-14 09:59:46,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 09:59:46,842 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 8 treesize of output 1 [2024-08-14 09:59:46,867 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 8 treesize of output 1 [2024-08-14 09:59:46,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-14 09:59:46,940 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-14 09:59:46,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-14 09:59:47,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-08-14 09:59:47,060 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-08-14 09:59:47,085 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 15 treesize of output 7 [2024-08-14 09:59:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:59:47,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 09:59:47,478 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 10 treesize of output 8 [2024-08-14 09:59:47,490 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 10 treesize of output 8 [2024-08-14 09:59:50,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 09:59:50,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-14 09:59:50,464 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-14 09:59:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 09:59:50,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990600348] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 09:59:50,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 09:59:50,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2024-08-14 09:59:50,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292980165] [2024-08-14 09:59:50,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 09:59:50,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-08-14 09:59:50,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 09:59:50,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-08-14 09:59:50,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=356, Unknown=19, NotChecked=0, Total=462 [2024-08-14 09:59:50,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:59:50,526 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 09:59:50,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.954545454545454) internal successors, (131), 21 states have internal predecessors, (131), 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-08-14 09:59:50,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:59:50,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 09:59:50,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-14 09:59:50,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-14 09:59:50,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-14 09:59:50,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-08-14 09:59:50,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 09:59:50,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-14 09:59:50,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-14 09:59:50,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 09:59:53,243 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-08-14 09:59:54,004 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse0 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (<= 5 (select .cse1 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (<= c_~next_alloc_idx~0 60) (forall ((v_DerPreprocessor_42 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (<= 0 (+ c_~next_alloc_idx~0 3)) (<= 5 c_~top~0) (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_prenex_348 Int) (v_prenex_346 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2587 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_prenex_349 Int) (v_prenex_347 (Array Int Int))) (or (= v_prenex_348 v_prenex_346) (< v_ArrVal_2587 (+ c_~next_alloc_idx~0 2)) (< 0 (select (select (store (let ((.cse2 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45))) (store .cse2 v_prenex_346 (store (select .cse2 v_prenex_346) v_prenex_349 v_ArrVal_2587))) v_prenex_348 v_prenex_347) v_prenex_346) v_prenex_349)))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_45 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (v_ArrVal_2587 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))) .cse0) (or .cse0 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))) (or .cse0 (forall ((v_prenex_345 Int) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_344 Int) (v_prenex_342 Int) (v_prenex_343 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) v_prenex_342 v_DerPreprocessor_43) v_prenex_344 v_prenex_343) v_prenex_342) v_prenex_345)) (= v_prenex_344 v_prenex_342)))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int)) (or (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))))) is different from false [2024-08-14 09:59:57,281 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-08-14 10:00:03,981 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse0 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 60) (forall ((v_DerPreprocessor_42 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (<= 0 (+ c_~next_alloc_idx~0 3)) (<= 5 c_~top~0) (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_prenex_348 Int) (v_prenex_346 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2587 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_prenex_349 Int) (v_prenex_347 (Array Int Int))) (or (= v_prenex_348 v_prenex_346) (< v_ArrVal_2587 (+ c_~next_alloc_idx~0 2)) (< 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45))) (store .cse1 v_prenex_346 (store (select .cse1 v_prenex_346) v_prenex_349 v_ArrVal_2587))) v_prenex_348 v_prenex_347) v_prenex_346) v_prenex_349)))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_45 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (< 0 (select .cse2 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (v_ArrVal_2587 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))) .cse0) (or .cse0 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))) (or .cse0 (forall ((v_prenex_345 Int) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_344 Int) (v_prenex_342 Int) (v_prenex_343 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) v_prenex_342 v_DerPreprocessor_43) v_prenex_344 v_prenex_343) v_prenex_342) v_prenex_345)) (= v_prenex_344 v_prenex_342)))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int)) (or (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))))) is different from false [2024-08-14 10:00:06,705 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-08-14 10:00:09,292 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse0 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (<= 5 (select .cse1 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (<= c_~next_alloc_idx~0 60) (forall ((v_DerPreprocessor_42 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (<= 0 (+ c_~next_alloc_idx~0 3)) (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_prenex_348 Int) (v_prenex_346 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2587 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_prenex_349 Int) (v_prenex_347 (Array Int Int))) (or (= v_prenex_348 v_prenex_346) (< v_ArrVal_2587 (+ c_~next_alloc_idx~0 2)) (< 0 (select (select (store (let ((.cse2 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45))) (store .cse2 v_prenex_346 (store (select .cse2 v_prenex_346) v_prenex_349 v_ArrVal_2587))) v_prenex_348 v_prenex_347) v_prenex_346) v_prenex_349)))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_45 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (< 0 c_~top~0) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (v_ArrVal_2587 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))) .cse0) (or .cse0 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))) (or .cse0 (forall ((v_prenex_345 Int) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_344 Int) (v_prenex_342 Int) (v_prenex_343 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) v_prenex_342 v_DerPreprocessor_43) v_prenex_344 v_prenex_343) v_prenex_342) v_prenex_345)) (= v_prenex_344 v_prenex_342)))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int)) (or (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))))) is different from false [2024-08-14 10:00:14,193 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-08-14 10:00:18,710 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse0 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (<= c_~next_alloc_idx~0 60) (forall ((v_DerPreprocessor_42 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (<= 0 (+ c_~next_alloc_idx~0 3)) (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_prenex_348 Int) (v_prenex_346 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2587 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_prenex_349 Int) (v_prenex_347 (Array Int Int))) (or (= v_prenex_348 v_prenex_346) (< v_ArrVal_2587 (+ c_~next_alloc_idx~0 2)) (< 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45))) (store .cse1 v_prenex_346 (store (select .cse1 v_prenex_346) v_prenex_349 v_ArrVal_2587))) v_prenex_348 v_prenex_347) v_prenex_346) v_prenex_349)))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_45 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (< 0 (select .cse2 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (< 0 c_~top~0) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (v_ArrVal_2587 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))) .cse0) (or .cse0 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))) (or .cse0 (forall ((v_prenex_345 Int) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_344 Int) (v_prenex_342 Int) (v_prenex_343 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) v_prenex_342 v_DerPreprocessor_43) v_prenex_344 v_prenex_343) v_prenex_342) v_prenex_345)) (= v_prenex_344 v_prenex_342)))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int)) (or (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))))) is different from false [2024-08-14 10:00:21,360 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-08-14 10:00:23,798 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse0 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (<= 5 (select .cse1 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (<= c_~next_alloc_idx~0 60) (forall ((v_DerPreprocessor_42 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (<= 0 (+ c_~next_alloc_idx~0 3)) (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_prenex_348 Int) (v_prenex_346 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2587 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_prenex_349 Int) (v_prenex_347 (Array Int Int))) (or (= v_prenex_348 v_prenex_346) (< v_ArrVal_2587 (+ c_~next_alloc_idx~0 2)) (< 0 (select (select (store (let ((.cse2 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45))) (store .cse2 v_prenex_346 (store (select .cse2 v_prenex_346) v_prenex_349 v_ArrVal_2587))) v_prenex_348 v_prenex_347) v_prenex_346) v_prenex_349)))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_45 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (v_ArrVal_2587 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))) .cse0) (or .cse0 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))) (or .cse0 (forall ((v_prenex_345 Int) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_344 Int) (v_prenex_342 Int) (v_prenex_343 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) v_prenex_342 v_DerPreprocessor_43) v_prenex_344 v_prenex_343) v_prenex_342) v_prenex_345)) (= v_prenex_344 v_prenex_342)))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int)) (or (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))))) is different from false [2024-08-14 10:00:24,069 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~next_alloc_idx~0 65))) (and (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_prenex_348 Int) (v_prenex_346 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2587 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_prenex_349 Int) (v_prenex_347 (Array Int Int))) (or (= v_prenex_348 v_prenex_346) (< v_ArrVal_2587 (+ c_~next_alloc_idx~0 2)) (< 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45))) (store .cse0 v_prenex_346 (store (select .cse0 v_prenex_346) v_prenex_349 v_ArrVal_2587))) v_prenex_348 v_prenex_347) v_prenex_346) v_prenex_349)))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_45 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (< 0 (select (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (v_ArrVal_2587 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or .cse1 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))) (or .cse1 (forall ((v_prenex_345 Int) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_344 Int) (v_prenex_342 Int) (v_prenex_343 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) v_prenex_342 v_DerPreprocessor_43) v_prenex_344 v_prenex_343) v_prenex_342) v_prenex_345)) (= v_prenex_344 v_prenex_342)))))) is different from false [2024-08-14 10:00:24,657 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~next_alloc_idx~0 65))) (and (<= 5 (select (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)) (or (< 64 c_~next_alloc_idx~0) (and (forall ((v_prenex_348 Int) (v_prenex_346 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2587 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_prenex_349 Int) (v_prenex_347 (Array Int Int))) (or (= v_prenex_348 v_prenex_346) (< v_ArrVal_2587 (+ c_~next_alloc_idx~0 2)) (< 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45))) (store .cse0 v_prenex_346 (store (select .cse0 v_prenex_346) v_prenex_349 v_ArrVal_2587))) v_prenex_348 v_prenex_347) v_prenex_346) v_prenex_349)))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_45 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (v_ArrVal_2587 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))) .cse1) (or .cse1 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_43) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))) (or .cse1 (forall ((v_prenex_345 Int) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_344 Int) (v_prenex_342 Int) (v_prenex_343 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) v_prenex_342 v_DerPreprocessor_43) v_prenex_344 v_prenex_343) v_prenex_342) v_prenex_345)) (= v_prenex_344 v_prenex_342)))) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| Int)) (or (forall ((v_ArrVal_2587 Int)) (or (< v_ArrVal_2587 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2587)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) 0)))))) is different from false [2024-08-14 10:00:26,667 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-08-14 10:00:33,688 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-08-14 10:00:38,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:00:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:00:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-14 10:00:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-14 10:00:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-14 10:00:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-08-14 10:00:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:00:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 10:00:38,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-14 10:00:38,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-08-14 10:00:38,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-08-14 10:00:38,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,34 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 10:00:38,867 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 10:00:38,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:00:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash -672411176, now seen corresponding path program 5 times [2024-08-14 10:00:38,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:00:38,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408649286] [2024-08-14 10:00:38,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:00:38,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:00:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:00:39,182 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 10:00:39,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:00:39,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408649286] [2024-08-14 10:00:39,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408649286] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 10:00:39,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279554274] [2024-08-14 10:00:39,184 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-08-14 10:00:39,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 10:00:39,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:00:39,187 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 10:00:39,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-08-14 10:00:39,395 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-08-14 10:00:39,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 10:00:39,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 25 conjunts are in the unsatisfiable core [2024-08-14 10:00:39,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 10:00:39,422 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 8 treesize of output 1 [2024-08-14 10:00:39,469 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-08-14 10:00:39,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-14 10:00:39,604 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-08-14 10:00:39,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 13 [2024-08-14 10:00:39,657 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-14 10:00:39,658 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 27 treesize of output 27 [2024-08-14 10:00:39,762 INFO L349 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2024-08-14 10:00:39,762 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 50 [2024-08-14 10:00:39,902 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-08-14 10:00:39,902 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 49 [2024-08-14 10:00:40,079 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2024-08-14 10:00:40,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2024-08-14 10:00:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 10:00:40,099 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 10:00:40,181 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) is different from false [2024-08-14 10:00:40,225 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_48) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (< c_~next_alloc_idx~0 65)) (or (< 64 c_~next_alloc_idx~0) (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))))) is different from false [2024-08-14 10:00:40,421 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 36 [2024-08-14 10:00:40,498 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 36 [2024-08-14 10:00:51,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:00:51,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-14 10:00:51,533 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-14 10:00:51,536 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 150 treesize of output 142 [2024-08-14 10:00:51,550 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-14 10:00:51,554 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 328 treesize of output 320 [2024-08-14 10:00:51,564 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 70 treesize of output 66 [2024-08-14 10:00:51,690 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 6 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 10:00:51,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279554274] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 10:00:51,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 10:00:51,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2024-08-14 10:00:51,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097985884] [2024-08-14 10:00:51,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 10:00:51,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-08-14 10:00:51,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:00:51,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-08-14 10:00:51,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=499, Unknown=10, NotChecked=94, Total=702 [2024-08-14 10:00:51,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:00:51,692 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:00:51,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.481481481481482) internal successors, (148), 26 states have internal predecessors, (148), 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-08-14 10:00:51,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:00:51,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:00:51,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-14 10:00:51,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-14 10:00:51,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-14 10:00:51,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-08-14 10:00:51,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:00:51,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-14 10:00:51,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-14 10:00:51,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-08-14 10:00:51,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:00:52,211 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~next_alloc_idx~0 3)) (.cse8 (< c_~next_alloc_idx~0 65)) (.cse6 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse5 (< 64 c_~next_alloc_idx~0)) (.cse2 (+ c_~next_alloc_idx~0 2)) (.cse3 (< c_~next_alloc_idx~0 63))) (and (not (= .cse0 0)) (or (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse1 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse1 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse1 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (< v_ArrVal_2707 .cse2))) (or .cse3 (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse4 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse4 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))))))) (or (not (= (+ c_~next_alloc_idx~0 1) 0)) (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 1))))) .cse5) (<= c_~next_alloc_idx~0 60) (<= 0 .cse0) (or (and (forall ((v_ArrVal_2707 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) (< v_ArrVal_2707 c_~next_alloc_idx~0))) (or .cse6 (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))))) .cse5) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_49 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_49))) (or (< 0 (select (select (store (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (not (= (+ (select (select .cse7 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (forall ((v_prenex_393 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_396 (Array Int Int)) (v_prenex_394 Int) (v_prenex_395 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_395 v_prenex_393) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_396) v_prenex_395) v_prenex_394)))) .cse8) (or .cse8 (and (or .cse6 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or .cse5 (and (or (< 62 c_~next_alloc_idx~0) (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse9 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select .cse9 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (< v_ArrVal_2707 .cse2))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse10 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< v_ArrVal_2707 .cse2) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse10) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select .cse10 0) 1) 0))))))) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse11 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse11 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse11 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0) 0) 1) 0))))) .cse3))))) is different from false [2024-08-14 10:00:52,224 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~next_alloc_idx~0 3)) (.cse3 (< 64 c_~next_alloc_idx~0)) (.cse6 (< c_~next_alloc_idx~0 65)) (.cse4 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0)))) (and (not (= .cse0 0)) (or (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse1 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse1 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse1 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (< v_ArrVal_2707 (+ c_~next_alloc_idx~0 2)))) (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse2 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse2 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse2 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))))))) (or (not (= (+ c_~next_alloc_idx~0 1) 0)) (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 1))))) .cse3) (<= c_~next_alloc_idx~0 60) (<= 0 .cse0) (or (and (forall ((v_ArrVal_2707 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) (< v_ArrVal_2707 c_~next_alloc_idx~0))) (or .cse4 (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))))) .cse3) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_49 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_49))) (or (< 0 (select (select (store (store .cse5 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (not (= (+ (select (select .cse5 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (forall ((v_prenex_393 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_396 (Array Int Int)) (v_prenex_394 Int) (v_prenex_395 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_395 v_prenex_393) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_396) v_prenex_395) v_prenex_394)))) .cse6) (or .cse6 (and (or .cse4 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))))) is different from false [2024-08-14 10:00:53,459 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~next_alloc_idx~0 3)) (.cse8 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse3 (< c_~next_alloc_idx~0 65)) (.cse0 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse5 (+ c_~next_alloc_idx~0 2)) (.cse6 (< c_~next_alloc_idx~0 63))) (and (or (forall ((v_ArrVal_2707 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_2704 Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2704) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))) .cse1) (<= 5 (select .cse0 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= .cse2 0)) (or .cse3 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0))))) (or (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse4 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse4 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (< v_ArrVal_2707 .cse5))) (or .cse6 (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse7 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse7 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))))))) (or (not (= (+ c_~next_alloc_idx~0 1) 0)) (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 1))))) .cse1) (or .cse1 (forall ((v_ArrVal_2707 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0)))) (<= c_~next_alloc_idx~0 60) (<= 0 .cse2) (or (and (forall ((v_ArrVal_2707 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) (< v_ArrVal_2707 c_~next_alloc_idx~0))) (or .cse8 (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))))) .cse1) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_49 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_49))) (or (< 0 (select (select (store (store .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (not (= (+ (select (select .cse9 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (forall ((v_prenex_393 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_396 (Array Int Int)) (v_prenex_394 Int) (v_prenex_395 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_395 v_prenex_393) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_396) v_prenex_395) v_prenex_394)))) .cse3) (or .cse3 (and (or .cse8 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_2704 Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2704) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) .cse3) (or (= (select .cse0 0) 3) (= |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| 0) (exists ((|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25| Int)) (= (select (select |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_25|) 0) 3))) (or .cse1 (and (or (< 62 c_~next_alloc_idx~0) (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse10 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store .cse10 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse10 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select .cse10 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (< v_ArrVal_2707 .cse5))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse11 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< v_ArrVal_2707 .cse5) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse11) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select .cse11 0) 1) 0))))))) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse12 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse12 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse12 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0) 0) 1) 0))))) .cse6))))) is different from false [2024-08-14 10:00:56,040 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse2 (+ c_~next_alloc_idx~0 3)) (.cse8 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse3 (< c_~next_alloc_idx~0 65)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse5 (+ c_~next_alloc_idx~0 2)) (.cse6 (< c_~next_alloc_idx~0 63))) (and (or (forall ((v_ArrVal_2707 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_2704 Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2704) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))) .cse1) (not (= .cse2 0)) (or .cse3 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0))))) (or (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse4 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse4 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (< v_ArrVal_2707 .cse5))) (or .cse6 (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse7 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse7 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))))))) (or (not (= (+ c_~next_alloc_idx~0 1) 0)) (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 1))))) .cse1) (or .cse1 (forall ((v_ArrVal_2707 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0)))) (<= c_~next_alloc_idx~0 60) (<= 0 .cse2) (or (and (forall ((v_ArrVal_2707 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) (< v_ArrVal_2707 c_~next_alloc_idx~0))) (or .cse8 (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))))) .cse1) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_49 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_49))) (or (< 0 (select (select (store (store .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (not (= (+ (select (select .cse9 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (forall ((v_prenex_393 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_396 (Array Int Int)) (v_prenex_394 Int) (v_prenex_395 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_395 v_prenex_393) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_396) v_prenex_395) v_prenex_394)))) .cse3) (or .cse3 (and (or .cse8 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_2704 Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2704) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) .cse3) (or .cse1 (and (or (< 62 c_~next_alloc_idx~0) (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse10 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store .cse10 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse10 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select .cse10 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (< v_ArrVal_2707 .cse5))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse11 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< v_ArrVal_2707 .cse5) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse11) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select .cse11 0) 1) 0))))))) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse12 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse12 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse12 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0) 0) 1) 0))))) .cse6))))) is different from false [2024-08-14 10:00:58,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-14 10:01:00,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-14 10:01:01,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-14 10:01:03,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-14 10:01:03,044 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (< 64 c_~next_alloc_idx~0)) (.cse5 (< c_~next_alloc_idx~0 65)) (.cse3 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0)))) (and (or (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse0 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse0 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse0 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse0 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (< v_ArrVal_2707 (+ c_~next_alloc_idx~0 2)))) (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse1 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse1 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))))))) (or (not (= (+ c_~next_alloc_idx~0 1) 0)) (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 1))))) .cse2) (or (and (forall ((v_ArrVal_2707 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) (< v_ArrVal_2707 c_~next_alloc_idx~0))) (or .cse3 (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))))) .cse2) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_49 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_49))) (or (< 0 (select (select (store (store .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (not (= (+ (select (select .cse4 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (forall ((v_prenex_393 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_396 (Array Int Int)) (v_prenex_394 Int) (v_prenex_395 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_395 v_prenex_393) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_396) v_prenex_395) v_prenex_394)))) .cse5) (or .cse5 (and (or .cse3 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))))) is different from false [2024-08-14 10:01:03,928 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~next_alloc_idx~0 3)) (.cse0 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse8 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse3 (< c_~next_alloc_idx~0 65)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse5 (+ c_~next_alloc_idx~0 2)) (.cse6 (< c_~next_alloc_idx~0 63))) (and (or (forall ((v_ArrVal_2707 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_2704 Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2704) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))) .cse1) (not (= .cse2 0)) (or .cse3 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0))))) (or (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse4 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse4 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (< v_ArrVal_2707 .cse5))) (or .cse6 (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse7 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse7 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse7 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))))))) (or (not (= (+ c_~next_alloc_idx~0 1) 0)) (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 1))))) .cse1) (or .cse1 (forall ((v_ArrVal_2707 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0)))) (<= c_~next_alloc_idx~0 60) (<= 0 .cse2) (or (and (forall ((v_ArrVal_2707 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) (< v_ArrVal_2707 c_~next_alloc_idx~0))) (or .cse8 (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))))) .cse1) (< 0 (select .cse0 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_49 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_49))) (or (< 0 (select (select (store (store .cse9 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (not (= (+ (select (select .cse9 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (forall ((v_prenex_393 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_396 (Array Int Int)) (v_prenex_394 Int) (v_prenex_395 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_395 v_prenex_393) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_396) v_prenex_395) v_prenex_394)))) .cse3) (or .cse3 (and (or .cse8 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_2704 Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2704) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) .cse3) (or .cse1 (and (or (< 62 c_~next_alloc_idx~0) (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse10 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store .cse10 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse10 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select (select .cse10 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (< v_ArrVal_2707 .cse5))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse11 (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0))) (or (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< v_ArrVal_2707 .cse5) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| .cse11) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (+ (select .cse11 0) 1) 0))))))) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse12 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse12 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse12 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (+ (select (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0) 0) 1) 0))))) .cse6))))) is different from false [2024-08-14 10:01:12,498 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-08-14 10:01:14,522 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-08-14 10:01:16,540 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-08-14 10:01:17,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:01:18,170 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse1 (< 64 c_~next_alloc_idx~0)) (.cse5 (not (= (+ (select (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0) 1) 0))) (.cse2 (< c_~next_alloc_idx~0 65))) (and (or (forall ((v_ArrVal_2707 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_2704 Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2704) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))) .cse1) (or .cse2 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0))))) (or (and (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse3 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse3 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse3 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select .cse3 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (< v_ArrVal_2707 (+ c_~next_alloc_idx~0 2)))) (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (let ((.cse4 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (or (not (= (+ (select (select .cse4 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))))))) (or (not (= (+ c_~next_alloc_idx~0 1) 0)) (forall ((v_ArrVal_2707 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) 0 (- 1))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 1))))) .cse1) (or .cse1 (forall ((v_ArrVal_2707 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0)))) (or (and (forall ((v_ArrVal_2707 Int)) (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) (< v_ArrVal_2707 c_~next_alloc_idx~0))) (or .cse5 (forall ((v_ArrVal_2707 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2707)) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2707 c_~next_alloc_idx~0))))) .cse1) (or (and (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (v_DerPreprocessor_49 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_49))) (or (< 0 (select (select (store (store .cse6 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (not (= (+ (select (select .cse6 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0))))) (forall ((v_prenex_393 (Array Int Int)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_prenex_396 (Array Int Int)) (v_prenex_394 Int) (v_prenex_395 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_395 v_prenex_393) |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_396) v_prenex_395) v_prenex_394)))) .cse2) (or .cse2 (and (or .cse5 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)) (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) (or (forall ((v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_2704 Int) (v_DerPreprocessor_47 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2704) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_48) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_47) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25|) 0) 1) 0)))) .cse2))) is different from false [2024-08-14 10:01:20,185 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-08-14 10:01:22,661 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-08-14 10:01:29,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-14 10:01:31,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-14 10:01:33,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-14 10:01:35,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-14 10:01:37,893 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 [0, 1] [2024-08-14 10:01:39,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-14 10:01:48,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:01:50,402 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-08-14 10:01:52,421 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-08-14 10:01:54,543 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-08-14 10:01:56,564 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-08-14 10:01:57,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:01:59,991 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-08-14 10:02:02,022 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-08-14 10:02:04,031 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-08-14 10:02:06,046 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-08-14 10:02:08,053 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-08-14 10:02:19,876 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-08-14 10:02:21,880 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-08-14 10:02:24,957 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-08-14 10:02:26,985 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-08-14 10:02:28,992 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-08-14 10:02:31,008 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-08-14 10:02:33,033 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-08-14 10:02:35,491 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-08-14 10:02:37,517 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-08-14 10:02:39,524 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-08-14 10:02:41,587 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-08-14 10:02:43,629 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-08-14 10:02:45,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:02:47,649 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-08-14 10:02:49,687 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-08-14 10:02:51,859 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-08-14 10:02:53,867 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-08-14 10:02:55,878 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-08-14 10:02:57,889 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-08-14 10:02:59,910 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-08-14 10:03:01,928 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-08-14 10:03:03,932 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-08-14 10:03:05,952 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-08-14 10:03:07,977 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-08-14 10:03:10,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:03:12,398 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-08-14 10:03:14,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:03:17,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-14 10:03:22,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-14 10:03:25,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-14 10:03:27,530 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 [0, 1] [2024-08-14 10:03:29,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-14 10:03:30,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-14 10:03:33,093 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 [0, 1] [2024-08-14 10:03:34,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-14 10:03:36,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-14 10:03:38,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-14 10:03:40,960 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 [0, 1] [2024-08-14 10:03:43,002 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 [0, 1] [2024-08-14 10:03:45,011 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 [0, 1] [2024-08-14 10:03:53,215 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-08-14 10:03:55,218 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-08-14 10:03:57,232 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-08-14 10:03:59,270 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-08-14 10:04:01,304 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-08-14 10:04:03,314 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-08-14 10:04:05,415 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-08-14 10:04:07,444 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-08-14 10:04:09,449 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-08-14 10:04:11,804 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 [0, 1] [2024-08-14 10:04:14,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-14 10:04:16,046 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 [0, 1] [2024-08-14 10:04:18,298 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 [0, 1] [2024-08-14 10:04:20,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-14 10:04:22,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-14 10:04:24,714 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-08-14 10:04:26,725 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-08-14 10:04:28,758 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-08-14 10:04:30,777 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-08-14 10:04:32,782 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-08-14 10:04:34,795 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-08-14 10:04:37,016 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-08-14 10:04:39,070 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-08-14 10:04:41,917 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-08-14 10:04:43,920 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-08-14 10:04:45,922 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-08-14 10:04:47,926 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-08-14 10:04:49,964 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-08-14 10:04:51,976 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-08-14 10:04:53,989 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-08-14 10:04:56,014 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-08-14 10:05:01,597 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-08-14 10:05:03,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:05:06,208 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-08-14 10:05:09,456 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-08-14 10:05:11,812 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-08-14 10:05:14,839 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-08-14 10:05:17,129 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-08-14 10:05:19,206 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-08-14 10:05:20,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:05:20,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:05:20,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-14 10:05:20,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-14 10:05:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-14 10:05:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-08-14 10:05:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:05:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 10:05:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-14 10:05:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-08-14 10:05:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-08-14 10:05:20,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2024-08-14 10:05:20,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,35 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 10:05:20,726 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 10:05:20,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:05:20,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1114844148, now seen corresponding path program 6 times [2024-08-14 10:05:20,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:05:20,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327126738] [2024-08-14 10:05:20,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:05:20,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:05:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:05:21,136 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 10:05:21,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:05:21,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327126738] [2024-08-14 10:05:21,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327126738] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 10:05:21,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179987485] [2024-08-14 10:05:21,137 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-08-14 10:05:21,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 10:05:21,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:05:21,139 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 10:05:21,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-08-14 10:05:21,338 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-08-14 10:05:21,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 10:05:21,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjunts are in the unsatisfiable core [2024-08-14 10:05:21,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 10:05:21,367 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 8 treesize of output 1 [2024-08-14 10:05:21,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-08-14 10:05:21,467 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2024-08-14 10:05:21,468 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 2 case distinctions, treesize of input 47 treesize of output 60 [2024-08-14 10:05:21,493 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 16 treesize of output 5 [2024-08-14 10:05:22,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:05:22,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 90 [2024-08-14 10:05:22,511 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 62 treesize of output 58 [2024-08-14 10:05:22,658 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-14 10:05:22,658 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-14 10:05:22,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179987485] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 10:05:22,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-14 10:05:22,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 22 [2024-08-14 10:05:22,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609677298] [2024-08-14 10:05:22,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 10:05:22,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-14 10:05:22,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:05:22,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-14 10:05:22,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2024-08-14 10:05:22,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:05:22,660 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:05:22,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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-08-14 10:05:22,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:05:22,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:05:22,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-14 10:05:22,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-14 10:05:22,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-14 10:05:22,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-08-14 10:05:22,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:05:22,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-14 10:05:22,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-14 10:05:22,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-08-14 10:05:22,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-08-14 10:05:22,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:05:30,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:05:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:05:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-14 10:05:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-14 10:05:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-14 10:05:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-08-14 10:05:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:05:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 10:05:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-14 10:05:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-08-14 10:05:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-08-14 10:05:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-14 10:05:30,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2024-08-14 10:05:30,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2024-08-14 10:05:30,751 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 10:05:30,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:05:30,751 INFO L85 PathProgramCache]: Analyzing trace with hash -72208018, now seen corresponding path program 7 times [2024-08-14 10:05:30,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:05:30,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904598389] [2024-08-14 10:05:30,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:05:30,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:05:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:05:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 10:05:31,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:05:31,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904598389] [2024-08-14 10:05:31,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904598389] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 10:05:31,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779637565] [2024-08-14 10:05:31,180 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-08-14 10:05:31,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 10:05:31,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:05:31,182 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 10:05:31,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-08-14 10:05:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:05:31,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 27 conjunts are in the unsatisfiable core [2024-08-14 10:05:31,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 10:05:31,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 11 treesize of output 7 [2024-08-14 10:05:31,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-14 10:05:31,579 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-08-14 10:05:31,579 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-08-14 10:05:31,673 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-08-14 10:05:31,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2024-08-14 10:05:31,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-08-14 10:05:31,801 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 0 case distinctions, treesize of input 19 treesize of output 12 [2024-08-14 10:05:31,844 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-14 10:05:31,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-14 10:05:31,895 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-08-14 10:05:31,935 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 15 treesize of output 7 [2024-08-14 10:05:31,967 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 10:05:31,967 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 10:05:32,488 WARN L854 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_2938 Int) (v_DerPreprocessor_54 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (let ((.cse0 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|))) (and (or (< c_~next_alloc_idx~0 63) (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_2938 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (v_ArrVal_2938 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))) (< 64 c_~next_alloc_idx~0))) is different from false [2024-08-14 10:05:33,614 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-14 10:05:33,614 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 48 treesize of output 44 [2024-08-14 10:05:33,642 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-14 10:05:33,642 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 94 treesize of output 88 [2024-08-14 10:05:33,683 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-14 10:05:33,683 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 48 treesize of output 44 [2024-08-14 10:05:33,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-14 10:05:33,710 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 18 treesize of output 16 [2024-08-14 10:05:34,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:05:34,838 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 4 case distinctions, treesize of input 38 treesize of output 52 [2024-08-14 10:05:34,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:05:34,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-08-14 10:05:35,020 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 168 treesize of output 156 [2024-08-14 10:05:35,026 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 5 treesize of output 3 [2024-08-14 10:05:35,069 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 139 treesize of output 131 [2024-08-14 10:05:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 6 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 10:05:35,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779637565] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 10:05:35,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 10:05:35,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 32 [2024-08-14 10:05:35,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726352009] [2024-08-14 10:05:35,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 10:05:35,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-08-14 10:05:35,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:05:35,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-08-14 10:05:35,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=791, Unknown=39, NotChecked=60, Total=1056 [2024-08-14 10:05:35,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:05:35,150 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:05:35,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.787878787878788) internal successors, (158), 32 states have internal predecessors, (158), 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-08-14 10:05:35,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:05:35,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:05:35,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-14 10:05:35,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-14 10:05:35,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-14 10:05:35,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-08-14 10:05:35,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:05:35,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-14 10:05:35,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-14 10:05:35,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-08-14 10:05:35,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-08-14 10:05:35,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-14 10:05:35,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:05:35,881 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (< c_~next_alloc_idx~0 65)) (.cse3 (+ c_~next_alloc_idx~0 2)) (.cse1 (< c_~next_alloc_idx~0 63)) (.cse0 (< 64 c_~next_alloc_idx~0))) (let ((.cse6 (or (and (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_56 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_56) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (< v_ArrVal_2937 .cse3))) (or (and (forall ((v_prenex_494 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_494) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int) (v_prenex_496 Int) (v_DerPreprocessor_56 (Array Int Int))) (or (= v_prenex_496 v_prenex_494) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_56) v_prenex_494 v_DerPreprocessor_54) v_prenex_496 v_prenex_492) v_prenex_494) v_prenex_495)))))) (forall ((v_prenex_494 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_494) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_494 v_DerPreprocessor_54) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_492) v_prenex_494) v_prenex_495)))))) .cse1)) .cse0)) (.cse2 (< 62 c_~next_alloc_idx~0)) (.cse7 (or .cse8 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_55 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_55) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|)))))) (and (or .cse0 (and (or .cse1 (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int) (v_prenex_496 Int) (v_prenex_493 Int) (v_prenex_494 Int) (v_DerPreprocessor_56 (Array Int Int))) (or (not (= (select (store (store |c_#valid| v_prenex_494 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_493) v_prenex_496) 0)) (not (= (select |c_#valid| v_prenex_494) 0)) (< 0 (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_56) v_prenex_494 v_DerPreprocessor_54) v_prenex_496 v_prenex_492) v_prenex_494) v_prenex_495))))) (or .cse2 (and (or (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_prenex_488 Int) (v_prenex_489 Int) (v_prenex_487 Int) (v_prenex_491 Int) (v_DerPreprocessor_56 (Array Int Int)) (v_prenex_490 Int)) (or (not (= (select (store (store |c_#valid| v_prenex_489 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_488) v_prenex_491) 0)) (not (= (select |c_#valid| v_prenex_489) 0)) (< v_prenex_487 .cse3) (< 0 (select (select (store (let ((.cse4 (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_56))) (store .cse4 v_prenex_489 (store (select .cse4 v_prenex_489) v_prenex_490 v_prenex_487))) v_prenex_491 v_DerPreprocessor_52) v_prenex_489) v_prenex_490)))) (< c_~next_alloc_idx~0 61)) (or (< 60 c_~next_alloc_idx~0) (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_56 (Array Int Int))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (let ((.cse5 (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_56))) (store .cse5 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| (store (select .cse5 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937))) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2937 .cse3)))))))) .cse6 (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)) (< 4 c_~top~0) (or (= |c_thr1Thread1of4ForFork0_push_#t~mem1#1| 0) (and .cse6 .cse7)) (or .cse8 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_2938 Int) (v_DerPreprocessor_54 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (let ((.cse9 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|))) (and (or .cse1 (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_2938 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse9 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse2 (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (v_ArrVal_2938 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse9 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))) .cse0) (or (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_55 (Array Int Int))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_55) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) .cse8) .cse7))) is different from false [2024-08-14 10:05:38,925 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (< c_~next_alloc_idx~0 65)) (.cse2 (+ c_~next_alloc_idx~0 2)) (.cse1 (< c_~next_alloc_idx~0 63)) (.cse0 (< 64 c_~next_alloc_idx~0))) (let ((.cse5 (or (and (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_56 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_56) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (< v_ArrVal_2937 .cse2))) (or (and (forall ((v_prenex_494 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_494) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int) (v_prenex_496 Int) (v_DerPreprocessor_56 (Array Int Int))) (or (= v_prenex_496 v_prenex_494) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_56) v_prenex_494 v_DerPreprocessor_54) v_prenex_496 v_prenex_492) v_prenex_494) v_prenex_495)))))) (forall ((v_prenex_494 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_494) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_494 v_DerPreprocessor_54) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_492) v_prenex_494) v_prenex_495)))))) .cse1)) .cse0)) (.cse6 (or .cse7 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_55 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_55) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|)))))) (and (or .cse0 (and (or .cse1 (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int) (v_prenex_496 Int) (v_prenex_493 Int) (v_prenex_494 Int) (v_DerPreprocessor_56 (Array Int Int))) (or (not (= (select (store (store |c_#valid| v_prenex_494 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_493) v_prenex_496) 0)) (not (= (select |c_#valid| v_prenex_494) 0)) (< 0 (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_56) v_prenex_494 v_DerPreprocessor_54) v_prenex_496 v_prenex_492) v_prenex_494) v_prenex_495))))) (or (< 62 c_~next_alloc_idx~0) (and (or (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_prenex_488 Int) (v_prenex_489 Int) (v_prenex_487 Int) (v_prenex_491 Int) (v_DerPreprocessor_56 (Array Int Int)) (v_prenex_490 Int)) (or (not (= (select (store (store |c_#valid| v_prenex_489 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_prenex_488) v_prenex_491) 0)) (not (= (select |c_#valid| v_prenex_489) 0)) (< v_prenex_487 .cse2) (< 0 (select (select (store (let ((.cse3 (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_56))) (store .cse3 v_prenex_489 (store (select .cse3 v_prenex_489) v_prenex_490 v_prenex_487))) v_prenex_491 v_DerPreprocessor_52) v_prenex_489) v_prenex_490)))) (< c_~next_alloc_idx~0 61)) (or (< 60 c_~next_alloc_idx~0) (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_56 (Array Int Int))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (let ((.cse4 (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_56))) (store .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| (store (select .cse4 |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937))) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2937 .cse2)))))))) .cse5 (< 4 c_~top~0) (or (= |c_thr1Thread1of4ForFork0_push_#t~mem1#1| 0) (and .cse5 .cse6)) (or (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_ArrVal_2938 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_55 (Array Int Int))) (or (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_55) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) .cse7) .cse6))) is different from false [2024-08-14 10:05:40,653 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (< c_~next_alloc_idx~0 65)) (.cse3 (< c_~next_alloc_idx~0 63)) (.cse5 (< 64 c_~next_alloc_idx~0))) (let ((.cse0 (or (and (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_56 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_56) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (< v_ArrVal_2937 (+ c_~next_alloc_idx~0 2)))) (or (and (forall ((v_prenex_494 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_494) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int) (v_prenex_496 Int) (v_DerPreprocessor_56 (Array Int Int))) (or (= v_prenex_496 v_prenex_494) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_56) v_prenex_494 v_DerPreprocessor_54) v_prenex_496 v_prenex_492) v_prenex_494) v_prenex_495)))))) (forall ((v_prenex_494 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_494) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_494 v_DerPreprocessor_54) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_492) v_prenex_494) v_prenex_495)))))) .cse3)) .cse5)) (.cse1 (or .cse2 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_55 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_55) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|)))))) (and .cse0 (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)) (< 0 c_~top~0) (or (= |c_thr1Thread1of4ForFork0_push_#t~mem1#1| 0) (and .cse0 .cse1)) (or .cse2 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_2938 Int) (v_DerPreprocessor_54 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (let ((.cse4 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|))) (and (or .cse3 (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_2938 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse4 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (v_ArrVal_2938 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse4 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))) .cse5) .cse1))) is different from false [2024-08-14 10:05:43,731 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (< c_~next_alloc_idx~0 65)) (.cse3 (< c_~next_alloc_idx~0 63)) (.cse5 (< 64 c_~next_alloc_idx~0))) (let ((.cse0 (or (and (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_56 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_56) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (< v_ArrVal_2937 (+ c_~next_alloc_idx~0 2)))) (or (and (forall ((v_prenex_494 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_494) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int) (v_prenex_496 Int) (v_DerPreprocessor_56 (Array Int Int))) (or (= v_prenex_496 v_prenex_494) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_56) v_prenex_494 v_DerPreprocessor_54) v_prenex_496 v_prenex_492) v_prenex_494) v_prenex_495)))))) (forall ((v_prenex_494 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_494) (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_prenex_492 (Array Int Int)) (v_prenex_495 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_494 v_DerPreprocessor_54) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_prenex_492) v_prenex_494) v_prenex_495)))))) .cse3)) .cse5)) (.cse1 (or .cse2 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int) (v_DerPreprocessor_55 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| Int)) (or (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| v_DerPreprocessor_55) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_29| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|)))))) (and .cse0 (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)) (or (= |c_thr1Thread1of4ForFork0_push_#t~mem1#1| 0) (and .cse0 .cse1)) (or .cse2 (forall ((v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_2938 Int) (v_DerPreprocessor_54 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_54) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (let ((.cse4 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|))) (and (or .cse3 (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_52 (Array Int Int)) (v_ArrVal_2938 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse4 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_52) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_2937 Int) (v_DerPreprocessor_53 (Array Int Int)) (v_ArrVal_2938 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2938) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27|) 0)) (< v_ArrVal_2937 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse4 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2937)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_27| v_DerPreprocessor_53) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))) .cse5) .cse1))) is different from false [2024-08-14 10:05:50,223 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-08-14 10:05:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:05:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:05:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-14 10:05:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-14 10:05:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-14 10:05:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-08-14 10:05:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:05:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 10:05:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-14 10:05:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-08-14 10:05:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-08-14 10:05:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-14 10:05:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-08-14 10:05:56,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2024-08-14 10:05:56,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-08-14 10:05:56,798 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 10:05:56,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:05:56,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1391017262, now seen corresponding path program 1 times [2024-08-14 10:05:56,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:05:56,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607903047] [2024-08-14 10:05:56,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:05:56,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:05:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:05:56,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 10:05:56,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:05:56,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607903047] [2024-08-14 10:05:56,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607903047] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 10:05:56,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183257560] [2024-08-14 10:05:56,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:05:56,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 10:05:56,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:05:56,866 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 10:05:56,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-08-14 10:05:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:05:57,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjunts are in the unsatisfiable core [2024-08-14 10:05:57,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 10:05:57,182 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-08-14 10:05:57,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 10:05:57,222 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 10:05:57,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:05:57,343 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 4 case distinctions, treesize of input 38 treesize of output 52 [2024-08-14 10:05:57,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:05:57,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-08-14 10:05:57,376 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 37 treesize of output 23 [2024-08-14 10:05:57,380 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 5 treesize of output 3 [2024-08-14 10:05:57,385 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 20 treesize of output 12 [2024-08-14 10:05:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-14 10:05:57,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183257560] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 10:05:57,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 10:05:57,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-08-14 10:05:57,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966072698] [2024-08-14 10:05:57,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 10:05:57,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-08-14 10:05:57,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:05:57,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-08-14 10:05:57,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-08-14 10:05:57,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:05:57,416 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:05:57,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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-08-14 10:05:57,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:05:57,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:05:57,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-14 10:05:57,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-14 10:05:57,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-14 10:05:57,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-08-14 10:05:57,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:05:57,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-14 10:05:57,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-14 10:05:57,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-08-14 10:05:57,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-08-14 10:05:57,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-14 10:05:57,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-08-14 10:05:57,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:05:59,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:05:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:05:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-14 10:05:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-14 10:05:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-14 10:05:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-08-14 10:05:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:05:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 10:05:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-14 10:05:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-08-14 10:05:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-08-14 10:05:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-14 10:05:59,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-08-14 10:05:59,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 10:05:59,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2024-08-14 10:05:59,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-08-14 10:05:59,587 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 10:05:59,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:05:59,587 INFO L85 PathProgramCache]: Analyzing trace with hash -230568318, now seen corresponding path program 1 times [2024-08-14 10:05:59,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:05:59,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399126050] [2024-08-14 10:05:59,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:05:59,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:05:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:05:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:05:59,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:05:59,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399126050] [2024-08-14 10:05:59,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399126050] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 10:05:59,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112788259] [2024-08-14 10:05:59,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:05:59,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 10:05:59,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:05:59,834 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 10:05:59,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-08-14 10:06:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:06:00,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-14 10:06:00,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 10:06:00,090 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 8 treesize of output 1 [2024-08-14 10:06:00,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-14 10:06:00,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-08-14 10:06:00,234 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-14 10:06:00,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-14 10:06:00,263 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-08-14 10:06:00,287 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 15 treesize of output 7 [2024-08-14 10:06:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:06:00,306 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 10:06:00,622 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 10 treesize of output 8 [2024-08-14 10:06:00,632 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 10 treesize of output 8 [2024-08-14 10:06:00,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:06:00,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-14 10:06:01,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:06:01,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-08-14 10:06:01,143 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-14 10:06:01,144 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 17 treesize of output 9 [2024-08-14 10:06:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:06:01,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112788259] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 10:06:01,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 10:06:01,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2024-08-14 10:06:01,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23143897] [2024-08-14 10:06:01,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 10:06:01,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-08-14 10:06:01,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:06:01,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-08-14 10:06:01,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=336, Unknown=5, NotChecked=0, Total=420 [2024-08-14 10:06:01,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:06:01,192 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:06:01,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.142857142857143) internal successors, (108), 20 states have internal predecessors, (108), 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-08-14 10:06:01,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:06:01,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:06:01,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-14 10:06:01,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-14 10:06:01,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-14 10:06:01,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-08-14 10:06:01,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:06:01,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-14 10:06:01,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-14 10:06:01,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-08-14 10:06:01,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-08-14 10:06:01,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-14 10:06:01,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-08-14 10:06:01,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 10:06:01,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:06:01,538 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|)) (.cse1 (< c_~next_alloc_idx~0 65))) (and (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)))) (< 64 c_~next_alloc_idx~0)) (<= 0 (+ c_~next_alloc_idx~0 1)) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)) (forall ((v_DerPreprocessor_57 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| (store (select |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|))) (<= 3 (select .cse0 |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (<= c_~next_alloc_idx~0 62) (< 0 c_~top~0) (forall ((v_DerPreprocessor_57 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))))) is different from false [2024-08-14 10:06:02,156 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|)) (.cse1 (< c_~next_alloc_idx~0 65))) (and (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)))) (< 64 c_~next_alloc_idx~0)) (<= 0 (+ c_~next_alloc_idx~0 1)) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)) (forall ((v_DerPreprocessor_57 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| (store (select |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|))) (<= 3 (select .cse0 |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (<= c_~next_alloc_idx~0 62) (< 0 c_~top~0) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))))) is different from false [2024-08-14 10:06:04,713 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 (+ c_~next_alloc_idx~0 1)) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| (store (select |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|))) (<= c_~next_alloc_idx~0 62) (or (< c_~next_alloc_idx~0 65) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (<= 3 c_~top~0)) is different from false [2024-08-14 10:06:04,964 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|)) (.cse1 (< c_~next_alloc_idx~0 65))) (and (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)))) (< 64 c_~next_alloc_idx~0)) (<= 0 (+ c_~next_alloc_idx~0 1)) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)) (forall ((v_DerPreprocessor_57 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| (store (select |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|))) (<= 3 (select .cse0 |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (<= c_~next_alloc_idx~0 62) (forall ((v_DerPreprocessor_57 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (<= 3 c_~top~0))) is different from false [2024-08-14 10:06:05,034 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|)) (.cse1 (< c_~next_alloc_idx~0 65))) (and (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)))) (< 64 c_~next_alloc_idx~0)) (<= 0 (+ c_~next_alloc_idx~0 1)) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)) (forall ((v_DerPreprocessor_57 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| (store (select |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|))) (<= 3 (select .cse0 |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (<= c_~next_alloc_idx~0 62) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (<= 3 c_~top~0))) is different from false [2024-08-14 10:06:08,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:06:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:06:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-14 10:06:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-14 10:06:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-14 10:06:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-08-14 10:06:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:06:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 10:06:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-14 10:06:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-08-14 10:06:08,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-08-14 10:06:08,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-14 10:06:08,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-08-14 10:06:08,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 10:06:08,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-08-14 10:06:08,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2024-08-14 10:06:08,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-08-14 10:06:08,288 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 10:06:08,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:06:08,288 INFO L85 PathProgramCache]: Analyzing trace with hash 415785329, now seen corresponding path program 2 times [2024-08-14 10:06:08,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:06:08,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394300939] [2024-08-14 10:06:08,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:06:08,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:06:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:06:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:06:08,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:06:08,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394300939] [2024-08-14 10:06:08,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394300939] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 10:06:08,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956833277] [2024-08-14 10:06:08,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-14 10:06:08,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 10:06:08,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:06:08,670 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 10:06:08,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-08-14 10:06:08,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-14 10:06:08,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 10:06:08,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 28 conjunts are in the unsatisfiable core [2024-08-14 10:06:08,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 10:06:08,884 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 8 treesize of output 1 [2024-08-14 10:06:08,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-14 10:06:08,932 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-08-14 10:06:09,129 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-08-14 10:06:09,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 16 [2024-08-14 10:06:09,167 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-08-14 10:06:09,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-08-14 10:06:09,396 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-14 10:06:09,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-14 10:06:09,458 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-08-14 10:06:09,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 32 [2024-08-14 10:06:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:06:09,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-14 10:06:09,615 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_60 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_60) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)))) is different from false [2024-08-14 10:06:10,547 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-14 10:06:10,547 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 94 treesize of output 92 [2024-08-14 10:06:10,596 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-14 10:06:10,596 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 94 treesize of output 1 [2024-08-14 10:06:10,612 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-14 10:06:10,612 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 94 treesize of output 88 [2024-08-14 10:06:11,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:06:11,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 33 treesize of output 49 [2024-08-14 10:06:11,237 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-08-14 10:06:11,237 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 1 case distinctions, treesize of input 316 treesize of output 316 [2024-08-14 10:06:11,331 INFO L349 Elim1Store]: treesize reduction 69, result has 50.0 percent of original size [2024-08-14 10:06:11,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 413 treesize of output 453 [2024-08-14 10:06:11,341 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 147 treesize of output 145 [2024-08-14 10:06:11,348 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 145 treesize of output 143 [2024-08-14 10:06:11,355 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 143 treesize of output 141 [2024-08-14 10:06:11,497 INFO L349 Elim1Store]: treesize reduction 108, result has 44.9 percent of original size [2024-08-14 10:06:11,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 186 treesize of output 255 [2024-08-14 10:06:11,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:06:11,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 205 treesize of output 273 [2024-08-14 10:06:11,605 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 126 treesize of output 124 [2024-08-14 10:06:11,620 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 124 treesize of output 122 [2024-08-14 10:06:11,636 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 122 treesize of output 120 [2024-08-14 10:06:11,913 INFO L349 Elim1Store]: treesize reduction 12, result has 71.4 percent of original size [2024-08-14 10:06:11,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 61 [2024-08-14 10:06:11,978 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-08-14 10:06:11,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 26 [2024-08-14 10:06:12,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:06:12,017 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 79 treesize of output 77 [2024-08-14 10:06:12,168 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:06:12,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956833277] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-14 10:06:12,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-14 10:06:12,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 32 [2024-08-14 10:06:12,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411725502] [2024-08-14 10:06:12,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-14 10:06:12,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-08-14 10:06:12,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 10:06:12,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-08-14 10:06:12,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=817, Unknown=7, NotChecked=60, Total=1056 [2024-08-14 10:06:12,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:06:12,170 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 10:06:12,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.363636363636363) internal successors, (144), 32 states have internal predecessors, (144), 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-08-14 10:06:12,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:06:12,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:06:12,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-14 10:06:12,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-14 10:06:12,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-14 10:06:12,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-08-14 10:06:12,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:06:12,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-14 10:06:12,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-14 10:06:12,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-08-14 10:06:12,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-08-14 10:06:12,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-14 10:06:12,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-08-14 10:06:12,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-14 10:06:12,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-08-14 10:06:12,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 10:06:16,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-14 10:06:39,240 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|)) (.cse1 (< c_~next_alloc_idx~0 65))) (and (or (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)))) (< 64 c_~next_alloc_idx~0)) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)) (forall ((v_DerPreprocessor_57 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| (store (select |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|))) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (< 0 (select .cse0 |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (or .cse1 (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (<= 3 c_~top~0))) is different from false [2024-08-14 10:06:41,768 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_ArrVal_3088 Int) (v_DerPreprocessor_57 (Array Int Int))) (or (< v_ArrVal_3088 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| (store (select |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_3088)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|)) (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|))) (or (< c_~next_alloc_idx~0 65) (forall ((|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31|) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_58) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_31| v_DerPreprocessor_57) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_33|) |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|))))) (<= 3 c_~top~0)) is different from false [2024-08-14 10:06:42,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:06:42,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 10:06:42,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-14 10:06:42,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-14 10:06:42,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-14 10:06:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-08-14 10:06:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 10:06:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-14 10:06:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-14 10:06:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-08-14 10:06:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-08-14 10:06:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-14 10:06:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-08-14 10:06:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-14 10:06:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-08-14 10:06:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-08-14 10:06:42,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2024-08-14 10:06:42,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,40 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 10:06:42,765 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 10:06:42,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 10:06:42,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1524754943, now seen corresponding path program 3 times [2024-08-14 10:06:42,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 10:06:42,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751292979] [2024-08-14 10:06:42,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 10:06:42,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 10:06:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 10:06:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 10:06:43,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 10:06:43,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751292979] [2024-08-14 10:06:43,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751292979] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-14 10:06:43,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630007861] [2024-08-14 10:06:43,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-14 10:06:43,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-14 10:06:43,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 10:06:43,185 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-14 10:06:43,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-08-14 10:06:43,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-08-14 10:06:43,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-14 10:06:43,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 35 conjunts are in the unsatisfiable core [2024-08-14 10:06:43,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-14 10:06:43,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-14 10:06:43,539 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-08-14 10:06:43,549 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 8 treesize of output 1 [2024-08-14 10:06:43,662 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-08-14 10:06:43,663 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 2 case distinctions, treesize of input 53 treesize of output 85 [2024-08-14 10:06:43,808 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-08-14 10:06:43,809 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 2 case distinctions, treesize of input 38 treesize of output 41 [2024-08-14 10:06:43,824 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-08-14 10:06:43,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:06:43,858 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 24 treesize of output 26 [2024-08-14 10:06:44,475 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-08-14 10:06:44,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 13 [2024-08-14 10:06:44,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-14 10:06:44,482 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 15 treesize of output 11 [2024-08-14 10:06:45,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:06:45,353 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 145 treesize of output 149 [2024-08-14 10:06:45,727 INFO L349 Elim1Store]: treesize reduction 72, result has 32.7 percent of original size [2024-08-14 10:06:45,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 241 treesize of output 237 [2024-08-14 10:06:45,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-14 10:06:45,742 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 141 treesize of output 146 [2024-08-14 10:06:46,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 5 [2024-08-14 10:06:46,753 INFO L349 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2024-08-14 10:06:46,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 175 treesize of output 179 [2024-08-14 10:06:47,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 32 treesize of output 14 [2024-08-14 10:06:47,951 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-08-14 10:06:47,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 47 treesize of output 30 [2024-08-14 10:06:47,988 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-08-14 10:06:47,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 47 treesize of output 30 [2024-08-14 10:06:49,868 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2024-08-14 10:06:49,869 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 69 [2024-08-14 10:06:49,904 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2024-08-14 10:06:49,904 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 69 [2024-08-14 10:06:49,935 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 64 treesize of output 45 [2024-08-14 10:06:49,944 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-14 10:06:49,945 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 36 treesize of output 28 [2024-08-14 10:06:49,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 45 [2024-08-14 10:06:49,980 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-08-14 10:06:50,002 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-08-14 10:06:50,003 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 2 case distinctions, treesize of input 43 treesize of output 34 [2024-08-14 10:06:50,013 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 9 [2024-08-14 10:06:50,087 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-14 10:06:50,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 50 [2024-08-14 10:06:50,092 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-08-14 10:06:50,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2024-08-14 10:06:50,165 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-08-14 10:06:50,417 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 64 treesize of output 45 [2024-08-14 10:06:50,423 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-08-14 10:06:50,435 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 64 treesize of output 45 [2024-08-14 10:06:50,443 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-14 10:06:50,444 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 36 treesize of output 24 [2024-08-14 10:06:50,511 INFO L349 Elim1Store]: treesize reduction 37, result has 2.6 percent of original size [2024-08-14 10:06:50,511 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 60 [2024-08-14 10:06:50,515 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-08-14 10:06:50,572 INFO L349 Elim1Store]: treesize reduction 29, result has 3.3 percent of original size [2024-08-14 10:06:50,573 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 2 case distinctions, treesize of input 72 treesize of output 44 [2024-08-14 10:06:50,579 INFO L349 Elim1Store]: treesize reduction 29, result has 3.3 percent of original size [2024-08-14 10:06:50,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 44 treesize of output 24 Killed by 15