./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-08-20_10-08-36.files/protection-local/26_stack_cas_longer-1.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da67795f 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/26_stack_cas_longer-1.i ./goblint.2024-08-20_10-08-36.files/protection-local/26_stack_cas_longer-1.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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.goblint-eval-da67795-m [2024-08-27 01:47:34,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-27 01:47:34,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-27 01:47:34,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-27 01:47:34,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-27 01:47:34,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-27 01:47:34,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-27 01:47:34,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-27 01:47:34,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-27 01:47:34,328 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-27 01:47:34,328 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-27 01:47:34,329 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-27 01:47:34,329 INFO L153 SettingsManager]: * Use SBE=true [2024-08-27 01:47:34,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-27 01:47:34,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-27 01:47:34,334 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-27 01:47:34,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-27 01:47:34,335 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-27 01:47:34,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-27 01:47:34,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-27 01:47:34,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-27 01:47:34,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-27 01:47:34,336 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-27 01:47:34,337 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-27 01:47:34,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-27 01:47:34,337 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-27 01:47:34,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-27 01:47:34,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-27 01:47:34,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-27 01:47:34,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-27 01:47:34,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-27 01:47:34,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-27 01:47:34,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-27 01:47:34,339 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-27 01:47:34,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-27 01:47:34,339 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-27 01:47:34,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-27 01:47:34,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-27 01:47:34,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-27 01:47:34,343 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-27 01:47:34,343 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-27 01:47:34,343 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-27 01:47:34,343 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-08-27 01:47:34,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-27 01:47:34,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-27 01:47:34,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-27 01:47:34,623 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-27 01:47:34,623 INFO L274 PluginConnector]: CDTParser initialized [2024-08-27 01:47:34,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i [2024-08-27 01:47:36,089 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-27 01:47:36,311 INFO L384 CDTParser]: Found 1 translation units. [2024-08-27 01:47:36,311 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i [2024-08-27 01:47:36,329 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6fdce0c2f/a5dcd24861254a028f2c0e9e67b5c490/FLAGe6fa30de1 [2024-08-27 01:47:36,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6fdce0c2f/a5dcd24861254a028f2c0e9e67b5c490 [2024-08-27 01:47:36,348 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-27 01:47:36,349 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-27 01:47:36,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-20_10-08-36.files/protection-local/26_stack_cas_longer-1.yml/witness.yml [2024-08-27 01:47:36,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-27 01:47:36,412 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-27 01:47:36,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-27 01:47:36,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-27 01:47:36,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-27 01:47:36,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 01:47:36" (1/2) ... [2024-08-27 01:47:36,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709f8f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:47:36, skipping insertion in model container [2024-08-27 01:47:36,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 01:47:36" (1/2) ... [2024-08-27 01:47:36,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@41a9919b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:47:36, skipping insertion in model container [2024-08-27 01:47:36,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 01:47:36" (2/2) ... [2024-08-27 01:47:36,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709f8f23 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:47:36, skipping insertion in model container [2024-08-27 01:47:36,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 01:47:36" (2/2) ... [2024-08-27 01:47:36,425 INFO L85 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-27 01:47:36,448 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-08-27 01:47:36,449 INFO L1541 ArrayList]: Location invariant before [L751-L751] (m == 0 || m == 1) && (m2 == 0 || m2 == 1) [2024-08-27 01:47:36,494 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-27 01:47:36,886 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-27 01:47:36,897 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-08-27 01:47:36,963 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-27 01:47:37,000 INFO L206 MainTranslator]: Completed translation [2024-08-27 01:47:37,000 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:47:37 WrapperNode [2024-08-27 01:47:37,001 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-27 01:47:37,001 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-27 01:47:37,002 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-27 01:47:37,002 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-27 01:47:37,009 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 27.08 01:47:37" (1/1) ... [2024-08-27 01:47:37,025 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 27.08 01:47:37" (1/1) ... [2024-08-27 01:47:37,049 INFO L138 Inliner]: procedures = 179, calls = 51, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 200 [2024-08-27 01:47:37,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-27 01:47:37,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-27 01:47:37,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-27 01:47:37,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-27 01:47:37,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:47:37" (1/1) ... [2024-08-27 01:47:37,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:47:37" (1/1) ... [2024-08-27 01:47:37,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:47:37" (1/1) ... [2024-08-27 01:47:37,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:47:37" (1/1) ... [2024-08-27 01:47:37,072 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:47:37" (1/1) ... [2024-08-27 01:47:37,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:47:37" (1/1) ... [2024-08-27 01:47:37,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:47:37" (1/1) ... [2024-08-27 01:47:37,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:47:37" (1/1) ... [2024-08-27 01:47:37,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-27 01:47:37,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-27 01:47:37,084 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-27 01:47:37,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-27 01:47:37,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:47:37" (1/1) ... [2024-08-27 01:47:37,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-27 01:47:37,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:37,120 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-27 01:47:37,123 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-27 01:47:37,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-08-27 01:47:37,164 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-08-27 01:47:37,164 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-08-27 01:47:37,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-08-27 01:47:37,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-08-27 01:47:37,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-27 01:47:37,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-27 01:47:37,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-27 01:47:37,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-27 01:47:37,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-08-27 01:47:37,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-27 01:47:37,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-27 01:47:37,167 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-08-27 01:47:37,286 INFO L242 CfgBuilder]: Building ICFG [2024-08-27 01:47:37,289 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-27 01:47:37,646 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-08-27 01:47:37,647 INFO L291 CfgBuilder]: Performing block encoding [2024-08-27 01:47:37,871 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-27 01:47:37,871 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-08-27 01:47:37,871 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 01:47:37 BoogieIcfgContainer [2024-08-27 01:47:37,871 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-27 01:47:37,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-27 01:47:37,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-27 01:47:37,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-27 01:47:37,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 01:47:36" (1/4) ... [2024-08-27 01:47:37,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e2dd4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 01:47:37, skipping insertion in model container [2024-08-27 01:47:37,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 01:47:36" (2/4) ... [2024-08-27 01:47:37,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e2dd4e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.08 01:47:37, skipping insertion in model container [2024-08-27 01:47:37,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:47:37" (3/4) ... [2024-08-27 01:47:37,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40e2dd4e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.08 01:47:37, skipping insertion in model container [2024-08-27 01:47:37,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 01:47:37" (4/4) ... [2024-08-27 01:47:37,886 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longer-1.i [2024-08-27 01:47:37,916 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-27 01:47:37,916 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-27 01:47:37,917 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-27 01:47:37,980 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-27 01:47:38,025 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:47:38,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 01:47:38,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:38,027 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-27 01:47:38,029 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-27 01:47:38,063 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 01:47:38,073 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-08-27 01:47:38,079 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;@3aa48506, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:47:38,079 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-27 01:47:38,247 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:47:38,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:38,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1521780113, now seen corresponding path program 1 times [2024-08-27 01:47:38,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:38,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17487062] [2024-08-27 01:47:38,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:38,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:38,627 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-27 01:47:38,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:38,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17487062] [2024-08-27 01:47:38,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17487062] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:47:38,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:47:38,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 01:47:38,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176052029] [2024-08-27 01:47:38,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:47:38,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 01:47:38,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:38,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 01:47:38,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 01:47:38,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:38,668 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:38,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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-27 01:47:38,670 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:38,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:38,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-27 01:47:38,729 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:47:38,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:38,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1823734536, now seen corresponding path program 1 times [2024-08-27 01:47:38,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:38,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389213187] [2024-08-27 01:47:38,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:38,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:39,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:39,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:39,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389213187] [2024-08-27 01:47:39,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389213187] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:47:39,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862681430] [2024-08-27 01:47:39,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:39,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:39,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:39,133 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:47:39,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-08-27 01:47:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:39,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-27 01:47:39,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:47:39,466 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-27 01:47:39,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:39,542 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-27 01:47:39,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:39,572 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-27 01:47:39,660 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-27 01:47:39,660 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:47:39,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862681430] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:47:39,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-27 01:47:39,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2024-08-27 01:47:39,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849238856] [2024-08-27 01:47:39,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:47:39,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:47:39,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:39,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:47:39,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-08-27 01:47:39,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:39,665 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:39,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.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-27 01:47:39,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:39,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:39,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:39,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:39,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-08-27 01:47:39,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-08-27 01:47:39,961 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:47:39,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:39,963 INFO L85 PathProgramCache]: Analyzing trace with hash 925778014, now seen corresponding path program 1 times [2024-08-27 01:47:39,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:39,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552040881] [2024-08-27 01:47:39,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:39,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:47:40,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:40,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552040881] [2024-08-27 01:47:40,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552040881] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:47:40,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:47:40,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 01:47:40,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694830911] [2024-08-27 01:47:40,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:47:40,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:47:40,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:40,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:47:40,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:47:40,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:40,115 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:40,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-27 01:47:40,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:40,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:40,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:40,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:40,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:40,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:40,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-27 01:47:40,254 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:47:40,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:40,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1291862496, now seen corresponding path program 1 times [2024-08-27 01:47:40,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:40,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392534878] [2024-08-27 01:47:40,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:40,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:40,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:40,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392534878] [2024-08-27 01:47:40,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392534878] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:47:40,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853189777] [2024-08-27 01:47:40,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:40,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:40,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:40,369 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:47:40,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-08-27 01:47:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:40,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-27 01:47:40,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:47:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:40,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:47:40,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:40,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853189777] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:47:40,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:47:40,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-08-27 01:47:40,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179157828] [2024-08-27 01:47:40,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:47:40,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-27 01:47:40,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:40,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-27 01:47:40,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-08-27 01:47:40,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:40,621 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:40,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 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-27 01:47:40,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:40,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:40,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:40,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:40,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:40,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:40,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:40,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:40,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-08-27 01:47:40,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:40,905 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:47:40,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:40,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1650478471, now seen corresponding path program 1 times [2024-08-27 01:47:40,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:40,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45875047] [2024-08-27 01:47:40,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:40,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:41,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:41,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45875047] [2024-08-27 01:47:41,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45875047] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:47:41,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324594516] [2024-08-27 01:47:41,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:41,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:41,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:41,368 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-27 01:47:41,370 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-27 01:47:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:41,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 23 conjunts are in the unsatisfiable core [2024-08-27 01:47:41,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:47:41,557 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 01:47:41,558 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-27 01:47:41,700 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 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:47:41,704 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-27 01:47:41,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:41,780 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:47:41,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:47:41,953 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 19 treesize of output 20 [2024-08-27 01:47:41,960 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 33 treesize of output 25 [2024-08-27 01:47:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:42,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324594516] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:47:42,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:47:42,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2024-08-27 01:47:42,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272406853] [2024-08-27 01:47:42,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:47:42,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-08-27 01:47:42,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:42,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-08-27 01:47:42,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=467, Unknown=2, NotChecked=0, Total=552 [2024-08-27 01:47:42,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:42,165 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:42,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 23 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-27 01:47:42,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:42,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:42,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:42,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:42,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:42,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:42,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:42,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:42,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:42,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-27 01:47:42,621 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 1 remaining) [2024-08-27 01:47:42,638 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-27 01:47:42,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:42,829 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-08-27 01:47:42,834 INFO L308 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-08-27 01:47:42,837 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:47:42,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 01:47:42,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:42,841 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-27 01:47:42,843 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-27 01:47:42,846 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 01:47:42,849 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-27 01:47:42,850 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;@3aa48506, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:47:42,852 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-27 01:47:42,931 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:47:42,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:42,932 INFO L85 PathProgramCache]: Analyzing trace with hash -837336820, now seen corresponding path program 1 times [2024-08-27 01:47:42,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:42,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76646964] [2024-08-27 01:47:42,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:42,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:42,965 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-27 01:47:42,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:42,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76646964] [2024-08-27 01:47:42,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76646964] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:47:42,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:47:42,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 01:47:42,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216149665] [2024-08-27 01:47:42,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:47:42,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 01:47:42,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:42,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 01:47:42,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 01:47:42,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:42,967 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:42,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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-27 01:47:42,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:42,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:42,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-27 01:47:42,994 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:47:42,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:42,995 INFO L85 PathProgramCache]: Analyzing trace with hash -828712491, now seen corresponding path program 1 times [2024-08-27 01:47:42,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:42,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101403999] [2024-08-27 01:47:42,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:42,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 01:47:43,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-27 01:47:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 01:47:43,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-27 01:47:43,059 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-27 01:47:43,059 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-27 01:47:43,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-27 01:47:43,061 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-08-27 01:47:43,062 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-08-27 01:47:43,065 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-27 01:47:43,065 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-08-27 01:47:43,106 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-27 01:47:43,108 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:47:43,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 01:47:43,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:43,111 INFO L229 MonitoredProcess]: Starting monitored process 7 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-27 01:47:43,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-08-27 01:47:43,115 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 01:47:43,115 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-27 01:47:43,116 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;@3aa48506, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:47:43,116 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-27 01:47:43,406 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:47:43,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:43,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1218277817, now seen corresponding path program 1 times [2024-08-27 01:47:43,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:43,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211926741] [2024-08-27 01:47:43,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:43,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:43,473 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-27 01:47:43,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:43,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211926741] [2024-08-27 01:47:43,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211926741] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:47:43,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:47:43,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 01:47:43,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659844675] [2024-08-27 01:47:43,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:47:43,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 01:47:43,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:43,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 01:47:43,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 01:47:43,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:43,476 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:43,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 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-27 01:47:43,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:43,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:43,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-08-27 01:47:43,529 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:47:43,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:43,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1105059173, now seen corresponding path program 1 times [2024-08-27 01:47:43,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:43,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220804490] [2024-08-27 01:47:43,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:43,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:43,609 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-27 01:47:43,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:43,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220804490] [2024-08-27 01:47:43,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220804490] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:47:43,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011508727] [2024-08-27 01:47:43,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:43,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:43,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:43,616 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-27 01:47:43,618 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-27 01:47:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:43,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-27 01:47:43,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:47:43,799 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-27 01:47:43,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:47:43,847 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-27 01:47:43,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011508727] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:47:43,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:47:43,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-08-27 01:47:43,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098490986] [2024-08-27 01:47:43,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:47:43,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-27 01:47:43,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:43,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-27 01:47:43,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-08-27 01:47:43,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:43,852 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:43,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 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-27 01:47:43,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:43,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:43,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:43,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:43,930 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-27 01:47:44,113 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,SelfDestructingSolverStorable8 [2024-08-27 01:47:44,114 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:47:44,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:44,114 INFO L85 PathProgramCache]: Analyzing trace with hash -904601861, now seen corresponding path program 1 times [2024-08-27 01:47:44,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:44,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992815749] [2024-08-27 01:47:44,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:44,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:44,225 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-27 01:47:44,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:44,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992815749] [2024-08-27 01:47:44,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992815749] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:47:44,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:47:44,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 01:47:44,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117299566] [2024-08-27 01:47:44,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:47:44,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-27 01:47:44,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:44,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-27 01:47:44,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-27 01:47:44,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:44,227 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:44,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:47:44,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:44,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:44,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:44,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:44,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:44,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:44,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-08-27 01:47:44,289 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:47:44,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:44,289 INFO L85 PathProgramCache]: Analyzing trace with hash -999344735, now seen corresponding path program 1 times [2024-08-27 01:47:44,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:44,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789703971] [2024-08-27 01:47:44,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:44,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:44,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:44,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:44,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789703971] [2024-08-27 01:47:44,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789703971] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:47:44,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598018154] [2024-08-27 01:47:44,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:44,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:44,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:44,611 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-27 01:47:44,612 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-27 01:47:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:44,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 29 conjunts are in the unsatisfiable core [2024-08-27 01:47:44,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:47:44,876 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-27 01:47:44,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:44,971 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-27 01:47:45,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:45,006 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-27 01:47:45,050 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-27 01:47:45,050 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:47:45,157 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~state~0 0))) (and (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array Int Int)) (|~#m2~0.offset| Int)) (= (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_4))) (store .cse1 |c_~#m2~0.base| (store (select .cse1 |c_~#m2~0.base|) |~#m2~0.offset| 0))) |c_~#m~0.base|) |c_~#m~0.offset|) 0))) (or (forall ((|~#m2~0.offset| Int)) (= 0 (select (select (store |c_#memory_int| |c_~#m2~0.base| (store (select |c_#memory_int| |c_~#m2~0.base|) |~#m2~0.offset| 0)) |c_~#m~0.base|) |c_~#m~0.offset|))) .cse0))) is different from false [2024-08-27 01:47:45,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:47:45,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2024-08-27 01:47:45,192 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~state~0 0))) (and (or (forall ((v_arrayElimArr_3 (Array Int Int)) (|~#m2~0.offset| Int)) (or (not (= (select v_arrayElimArr_3 |~#m2~0.offset|) 0)) (= (select (select (store |c_#memory_int| |c_~#m2~0.base| v_arrayElimArr_3) |c_~#m~0.base|) |c_~#m~0.offset|) 0))) .cse0) (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_354 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_4) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_354) |c_~#top~0.base| v_DerPreprocessor_4) |c_~#m2~0.base|) |~#m2~0.offset| 0)) |c_~#m~0.base|) |c_~#m~0.offset|)))))) is different from false [2024-08-27 01:47:45,251 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread1of2ForFork0_push_~newTop~0#1| 0) (let ((.cse0 (= c_~state~0 0))) (and (or (forall ((v_arrayElimArr_3 (Array Int Int)) (|~#m2~0.offset| Int)) (or (not (= (select v_arrayElimArr_3 |~#m2~0.offset|) 0)) (= (select (select (store |c_#memory_int| |c_~#m2~0.base| v_arrayElimArr_3) |c_~#m~0.base|) |c_~#m~0.offset|) 0))) .cse0) (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_354 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_4) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_354) |c_~#top~0.base| v_DerPreprocessor_4) |c_~#m2~0.base|) |~#m2~0.offset| 0)) |c_~#m~0.base|) |c_~#m~0.offset|))))))) is different from false [2024-08-27 01:47:45,272 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread1of2ForFork0_index_malloc_~curr_alloc_idx~0#1| 0) (let ((.cse0 (= c_~state~0 0))) (and (or (forall ((v_arrayElimArr_3 (Array Int Int)) (|~#m2~0.offset| Int)) (or (not (= (select v_arrayElimArr_3 |~#m2~0.offset|) 0)) (= (select (select (store |c_#memory_int| |c_~#m2~0.base| v_arrayElimArr_3) |c_~#m~0.base|) |c_~#m~0.offset|) 0))) .cse0) (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_354 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_4) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_354) |c_~#top~0.base| v_DerPreprocessor_4) |c_~#m2~0.base|) |~#m2~0.offset| 0)) |c_~#m~0.base|) |c_~#m~0.offset|))))))) is different from false [2024-08-27 01:47:45,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:47:45,314 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 40 treesize of output 33 [2024-08-27 01:47:45,318 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 206 treesize of output 194 [2024-08-27 01:47:45,324 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 94 treesize of output 88 [2024-08-27 01:47:45,329 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 76 treesize of output 72 [2024-08-27 01:47:45,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:47:45,374 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-27 01:47:45,379 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 30 treesize of output 22 [2024-08-27 01:47:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-08-27 01:47:45,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598018154] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:47:45,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:47:45,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 22 [2024-08-27 01:47:45,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368802] [2024-08-27 01:47:45,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:47:45,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-08-27 01:47:45,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:45,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-08-27 01:47:45,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=257, Unknown=4, NotChecked=148, Total=506 [2024-08-27 01:47:45,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:45,552 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:45,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.652173913043478) internal successors, (84), 22 states have internal predecessors, (84), 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-27 01:47:45,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:45,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:45,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:45,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:46,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:46,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:46,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:46,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-27 01:47:46,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-08-27 01:47:46,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:46,260 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:47:46,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:46,261 INFO L85 PathProgramCache]: Analyzing trace with hash -323185154, now seen corresponding path program 1 times [2024-08-27 01:47:46,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:46,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629344430] [2024-08-27 01:47:46,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:46,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 01:47:46,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:46,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629344430] [2024-08-27 01:47:46,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629344430] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:47:46,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:47:46,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 01:47:46,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154536399] [2024-08-27 01:47:46,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:47:46,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:47:46,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:46,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:47:46,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:47:46,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:46,379 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:46,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-27 01:47:46,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:46,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:46,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:46,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-27 01:47:46,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-27 01:47:46,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:46,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-08-27 01:47:46,583 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:47:46,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:46,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1323347906, now seen corresponding path program 1 times [2024-08-27 01:47:46,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:46,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057960354] [2024-08-27 01:47:46,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:46,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:46,994 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-27 01:47:46,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:46,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057960354] [2024-08-27 01:47:46,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057960354] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:47:46,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073364798] [2024-08-27 01:47:46,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:46,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:46,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:46,997 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-27 01:47:46,998 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-27 01:47:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:47,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 23 conjunts are in the unsatisfiable core [2024-08-27 01:47:47,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:47:47,199 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 01:47:47,199 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-27 01:47:47,391 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 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:47:47,397 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-27 01:47:47,480 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-27 01:47:47,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:47:47,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:47:47,601 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 19 treesize of output 20 [2024-08-27 01:47:47,604 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 33 treesize of output 25 [2024-08-27 01:47:47,788 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-27 01:47:47,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073364798] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:47:47,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:47:47,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2024-08-27 01:47:47,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7952578] [2024-08-27 01:47:47,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:47:47,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-08-27 01:47:47,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:47,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-08-27 01:47:47,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=472, Unknown=2, NotChecked=0, Total=552 [2024-08-27 01:47:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:47,791 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:47,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.041666666666667) internal successors, (97), 23 states have internal predecessors, (97), 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-27 01:47:47,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:47,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:47,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:47,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-27 01:47:47,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:47,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:48,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:48,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:48,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:48,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-27 01:47:48,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:48,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:47:48,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-08-27 01:47:48,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:48,485 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:47:48,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:48,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1233754093, now seen corresponding path program 1 times [2024-08-27 01:47:48,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:48,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847147521] [2024-08-27 01:47:48,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:48,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 01:47:48,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-27 01:47:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 01:47:48,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-27 01:47:48,548 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-27 01:47:48,548 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-27 01:47:48,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-08-27 01:47:48,549 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-08-27 01:47:48,550 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-08-27 01:47:48,550 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-27 01:47:48,550 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-08-27 01:47:48,592 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-27 01:47:48,594 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:47:48,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 01:47:48,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:48,597 INFO L229 MonitoredProcess]: Starting monitored process 11 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-27 01:47:48,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2024-08-27 01:47:48,600 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 01:47:48,600 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-08-27 01:47:48,601 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;@3aa48506, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:47:48,601 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-27 01:47:48,974 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:47:48,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:48,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1653505405, now seen corresponding path program 1 times [2024-08-27 01:47:48,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:48,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140582727] [2024-08-27 01:47:48,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:48,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:49,045 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-27 01:47:49,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:49,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140582727] [2024-08-27 01:47:49,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140582727] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:47:49,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:47:49,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 01:47:49,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335062913] [2024-08-27 01:47:49,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:47:49,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 01:47:49,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:49,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 01:47:49,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 01:47:49,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:49,048 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:49,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 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-27 01:47:49,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:49,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:49,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-08-27 01:47:49,120 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:47:49,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:49,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1329674543, now seen corresponding path program 1 times [2024-08-27 01:47:49,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:49,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814335951] [2024-08-27 01:47:49,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:49,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:49,199 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-27 01:47:49,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:49,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814335951] [2024-08-27 01:47:49,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814335951] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:47:49,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720013535] [2024-08-27 01:47:49,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:49,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:49,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:49,202 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-27 01:47:49,204 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-27 01:47:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:49,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-27 01:47:49,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:47:49,425 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-27 01:47:49,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:47:49,466 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-27 01:47:49,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720013535] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:47:49,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:47:49,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-08-27 01:47:49,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174977206] [2024-08-27 01:47:49,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:47:49,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-27 01:47:49,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:49,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-27 01:47:49,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-08-27 01:47:49,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:49,468 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:49,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 states have internal predecessors, (98), 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-27 01:47:49,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:49,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:49,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:49,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:47:49,597 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-27 01:47:49,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:49,779 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:47:49,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:49,780 INFO L85 PathProgramCache]: Analyzing trace with hash -770286953, now seen corresponding path program 1 times [2024-08-27 01:47:49,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:49,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721089798] [2024-08-27 01:47:49,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:49,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:49,924 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-27 01:47:49,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:49,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721089798] [2024-08-27 01:47:49,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721089798] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:47:49,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:47:49,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 01:47:49,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639353681] [2024-08-27 01:47:49,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:47:49,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-27 01:47:49,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:49,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-27 01:47:49,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-27 01:47:49,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:49,926 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:49,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-27 01:47:49,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:49,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:47:49,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:50,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:50,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:47:50,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:50,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-08-27 01:47:50,158 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:47:50,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:50,158 INFO L85 PathProgramCache]: Analyzing trace with hash 222230507, now seen corresponding path program 1 times [2024-08-27 01:47:50,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:50,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803079123] [2024-08-27 01:47:50,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:50,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:50,301 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-27 01:47:50,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:50,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803079123] [2024-08-27 01:47:50,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803079123] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:47:50,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:47:50,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 01:47:50,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489141370] [2024-08-27 01:47:50,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:47:50,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:47:50,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:50,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:47:50,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:47:50,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:50,304 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:50,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-27 01:47:50,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:50,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:47:50,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:50,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:50,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:50,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:47:50,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:50,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:50,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-08-27 01:47:50,516 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:47:50,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:50,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1791435089, now seen corresponding path program 1 times [2024-08-27 01:47:50,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:50,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554549651] [2024-08-27 01:47:50,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:50,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:51,116 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 01:47:51,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:51,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554549651] [2024-08-27 01:47:51,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554549651] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:47:51,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867732085] [2024-08-27 01:47:51,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:51,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:51,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:51,119 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-27 01:47:51,120 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-27 01:47:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:51,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 57 conjunts are in the unsatisfiable core [2024-08-27 01:47:51,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:47:51,414 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-27 01:47:51,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:51,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:47:51,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:51,555 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-27 01:47:51,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:51,629 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-27 01:47:51,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:51,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:47:51,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:51,902 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-27 01:47:52,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:52,081 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:47:52,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2024-08-27 01:47:52,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:52,187 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:47:52,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-08-27 01:47:52,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:52,301 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:47:52,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-08-27 01:47:52,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:52,452 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-08-27 01:47:52,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 45 [2024-08-27 01:47:52,915 INFO L349 Elim1Store]: treesize reduction 160, result has 30.1 percent of original size [2024-08-27 01:47:52,916 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 14 case distinctions, treesize of input 70 treesize of output 117 [2024-08-27 01:47:52,990 INFO L349 Elim1Store]: treesize reduction 68, result has 39.3 percent of original size [2024-08-27 01:47:52,991 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 84 treesize of output 109 [2024-08-27 01:47:53,742 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:53,743 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:47:53,910 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (Array Int Int)) (|~#m2~0.offset| Int)) (not (= 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#m2~0.base| (store (select |c_#memory_int| |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|)))) is different from false [2024-08-27 01:47:53,924 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (Array Int Int)) (|~#m2~0.offset| Int)) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#m2~0.base| (store (select |c_#memory_int| |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-08-27 01:47:53,934 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int)) (not (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815))) (store .cse1 |c_~#m2~0.base| (store (select .cse1 |c_~#m2~0.base|) |~#m2~0.offset| 0))))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-08-27 01:47:53,942 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int)) (not (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815))) (store .cse1 |c_~#m2~0.base| (store (select .cse1 |c_~#m2~0.base|) |~#m2~0.offset| 0))))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-08-27 01:47:53,986 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~state~0 0))) (and (or (not .cse0) (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_DerPreprocessor_9 (Array Int Int))) (not (= (select (select (store (let ((.cse2 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815))) (let ((.cse1 (store (select .cse2 |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse1) |c_~#top~0.base| (store (select (store .cse2 |c_~#m2~0.base| .cse1) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0)))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (or .cse0 (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int)) (not (= (select (select (store (let ((.cse3 (let ((.cse4 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815))) (store .cse4 |c_~#m2~0.base| (store (select .cse4 |c_~#m2~0.base|) |~#m2~0.offset| 0))))) (store .cse3 |c_~#top~0.base| (store (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) is different from false [2024-08-27 01:47:54,276 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~state~0 0))) (and (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)))) .cse1) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse2 (store (select (store (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse2) |c_~#top~0.base| (store (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse2) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)))) (not .cse1)))) is different from false [2024-08-27 01:47:55,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:47:55,252 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 1 case distinctions, treesize of input 12 treesize of output 8 [2024-08-27 01:47:55,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:47:55,283 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 520 treesize of output 534 [2024-08-27 01:47:55,302 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 343 treesize of output 339 [2024-08-27 01:47:55,313 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 339 treesize of output 337 [2024-08-27 01:47:55,324 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 337 treesize of output 329 [2024-08-27 01:47:55,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 329 treesize of output 327 [2024-08-27 01:47:55,342 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 327 treesize of output 319 [2024-08-27 01:47:55,400 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 319 treesize of output 317 [2024-08-27 01:47:55,413 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 317 treesize of output 313 [2024-08-27 01:47:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:55,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867732085] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:47:55,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:47:55,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 20] total 48 [2024-08-27 01:47:55,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386622947] [2024-08-27 01:47:55,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:47:55,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-08-27 01:47:55,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:55,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-08-27 01:47:55,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1559, Unknown=22, NotChecked=522, Total=2352 [2024-08-27 01:47:55,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:55,759 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:55,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.36734693877551) internal successors, (165), 48 states have internal predecessors, (165), 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-27 01:47:55,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:55,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:47:55,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:55,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:55,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:56,342 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_~state~0 0))) (let ((.cse7 (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse22 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse22 |c_~#top~0.base| (store (select .cse22 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0))))) (.cse14 (not (= c_~state~0 1))) (.cse5 (not .cse3))) (let ((.cse6 (or .cse5 (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (let ((.cse21 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_10))) (or (not (= (select (select (store (let ((.cse20 (store (select (store (store .cse21 |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse20) |c_~#top~0.base| (store (select (store (store .cse21 |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse20) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store .cse21 |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0))))))) (.cse16 (or .cse7 .cse14))) (let ((.cse1 (and .cse6 .cse16)) (.cse0 (= |c_thr1Thread1of3ForFork0_index_malloc_~curr_alloc_idx~0#1| 0))) (and (or .cse0 .cse1) (or (= |c_thr1Thread1of3ForFork0_push_~newTop~0#1| 0) .cse1) (= |c_~#top~0.offset| 0) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int)) (not (= (select (select (store (let ((.cse2 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse2 |c_~#top~0.base| (store (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse3) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)) (not (= (select (select (store (let ((.cse4 (store (select (store (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse4) |c_~#top~0.base| (store (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse4) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) .cse5) (forall ((v_DerPreprocessor_7 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse6 (or (and (or .cse7 .cse3) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse8 (store (select (store (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse8) |c_~#top~0.base| (store (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse8) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)))) .cse5)) (not |c_thr1Thread2of3ForFork0_#t~switch18#1|)) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_DerPreprocessor_9 (Array Int Int))) (not (= (select (select (store (let ((.cse9 (store (select (store (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse9) |c_~#top~0.base| (store (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse9) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse5) (or (= c_~next_alloc_idx~0 0) (let ((.cse12 (+ c_~next_alloc_idx~0 2))) (and (or .cse5 (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_808 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_808) |c_~#top~0.base| v_DerPreprocessor_10) |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)) (not (= (select (select (store (let ((.cse11 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_10))) (let ((.cse10 (store (select (store (store .cse11 |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse10) |c_~#top~0.base| (store (select (store (store .cse11 |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse10) |c_~#top~0.base|) |c_~#top~0.offset| .cse12)))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_808 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_808) |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)) (not (= (select (select (store (let ((.cse13 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse13 |c_~#top~0.base| (store (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset| .cse12))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) .cse14)))) (not (= |c_thr1Thread2of3ForFork0_push_~newTop~0#1| 0)) (or .cse3 (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse15 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse15 |c_~#top~0.base| (store (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0))))) .cse16 (or .cse0 (and (or (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_808 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse18 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_10))) (let ((.cse17 (store (select (store (store .cse18 |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse17) |c_~#top~0.base| (store (select (store (store .cse18 |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse17) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0)))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_808) |c_~#top~0.base| v_DerPreprocessor_10) |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)))) .cse5) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_808 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse19 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse19 |c_~#top~0.base| (store (select .cse19 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_808) |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)))) .cse14))) (or (= |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (not (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|)))))))) is different from false [2024-08-27 01:47:56,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:56,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:47:56,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:56,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:56,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:47:56,686 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-27 01:47:56,869 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-27 01:47:56,869 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:47:56,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:56,870 INFO L85 PathProgramCache]: Analyzing trace with hash 801107341, now seen corresponding path program 2 times [2024-08-27 01:47:56,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:56,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3049477] [2024-08-27 01:47:56,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:56,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:57,257 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-27 01:47:57,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:57,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3049477] [2024-08-27 01:47:57,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3049477] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:47:57,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781950085] [2024-08-27 01:47:57,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 01:47:57,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:57,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:57,260 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-27 01:47:57,261 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-27 01:47:57,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-27 01:47:57,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 01:47:57,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-27 01:47:57,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:47:57,548 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-27 01:47:57,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:57,575 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-27 01:47:57,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:57,586 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-27 01:47:57,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:57,595 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-27 01:47:57,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:57,605 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-27 01:47:57,662 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-27 01:47:57,663 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:47:57,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781950085] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:47:57,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-27 01:47:57,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-08-27 01:47:57,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984335807] [2024-08-27 01:47:57,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:47:57,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:47:57,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:57,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:47:57,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-08-27 01:47:57,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:57,664 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:57,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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-27 01:47:57,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:57,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:47:57,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:57,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:57,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:47:57,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:57,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:57,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:47:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:47:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:57,884 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-27 01:47:58,071 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-27 01:47:58,072 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:47:58,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:58,072 INFO L85 PathProgramCache]: Analyzing trace with hash -765518316, now seen corresponding path program 2 times [2024-08-27 01:47:58,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:58,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540540798] [2024-08-27 01:47:58,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:58,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:58,647 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-27 01:47:58,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:58,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540540798] [2024-08-27 01:47:58,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540540798] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:47:58,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350131278] [2024-08-27 01:47:58,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 01:47:58,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:58,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:58,650 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-27 01:47:58,652 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-27 01:47:58,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-08-27 01:47:58,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 01:47:58,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 21 conjunts are in the unsatisfiable core [2024-08-27 01:47:58,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:47:59,139 INFO L349 Elim1Store]: treesize reduction 96, result has 35.6 percent of original size [2024-08-27 01:47:59,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 67 treesize of output 120 [2024-08-27 01:47:59,152 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 8 treesize of output 7 [2024-08-27 01:47:59,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:59,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-08-27 01:47:59,221 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-08-27 01:47:59,222 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 20 treesize of output 26 [2024-08-27 01:47:59,282 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-08-27 01:47:59,282 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 20 treesize of output 26 [2024-08-27 01:47:59,345 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 46 treesize of output 38 [2024-08-27 01:47:59,356 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-27 01:47:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-08-27 01:47:59,733 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:47:59,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350131278] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:47:59,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-27 01:47:59,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2024-08-27 01:47:59,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824751087] [2024-08-27 01:47:59,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:47:59,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:47:59,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:59,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:47:59,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=69, Unknown=1, NotChecked=0, Total=90 [2024-08-27 01:47:59,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:59,734 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:59,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-27 01:47:59,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:59,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:47:59,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:59,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:59,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:47:59,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:59,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:00,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:00,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:00,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:00,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:00,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:00,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:00,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-08-27 01:48:00,261 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-27 01:48:00,261 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:00,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:00,262 INFO L85 PathProgramCache]: Analyzing trace with hash 882666815, now seen corresponding path program 1 times [2024-08-27 01:48:00,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:00,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209509348] [2024-08-27 01:48:00,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:00,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:00,413 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-08-27 01:48:00,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:00,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209509348] [2024-08-27 01:48:00,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209509348] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:48:00,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:48:00,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 01:48:00,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055574870] [2024-08-27 01:48:00,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:48:00,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:48:00,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:00,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:48:00,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:48:00,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:00,415 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:00,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-27 01:48:00,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:00,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:00,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:00,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:00,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:00,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:00,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:00,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:00,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:00,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:00,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:00,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:00,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:00,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:00,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:00,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:00,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-08-27 01:48:00,725 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:00,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:00,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1259604423, now seen corresponding path program 1 times [2024-08-27 01:48:00,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:00,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824499581] [2024-08-27 01:48:00,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:00,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 01:48:00,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:00,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824499581] [2024-08-27 01:48:00,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824499581] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:00,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957412139] [2024-08-27 01:48:00,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:00,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:00,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:00,896 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-27 01:48:00,898 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-27 01:48:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:01,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 6 conjunts are in the unsatisfiable core [2024-08-27 01:48:01,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 01:48:01,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:48:01,415 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 01:48:01,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957412139] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:48:01,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:48:01,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-08-27 01:48:01,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268548416] [2024-08-27 01:48:01,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:48:01,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-27 01:48:01,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:01,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-27 01:48:01,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-08-27 01:48:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:01,418 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:01,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.846153846153847) internal successors, (167), 12 states have internal predecessors, (167), 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-27 01:48:01,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:01,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:01,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:01,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:01,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:01,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:01,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:01,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:01,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:01,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:01,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:48:01,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-08-27 01:48:01,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:01,736 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:01,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:01,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1176978261, now seen corresponding path program 1 times [2024-08-27 01:48:01,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:01,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556546900] [2024-08-27 01:48:01,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:01,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-08-27 01:48:02,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:02,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556546900] [2024-08-27 01:48:02,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556546900] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:02,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168758055] [2024-08-27 01:48:02,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:02,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:02,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:02,212 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-27 01:48:02,213 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-27 01:48:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:02,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 54 conjunts are in the unsatisfiable core [2024-08-27 01:48:02,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:02,533 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-27 01:48:02,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:02,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:02,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:02,616 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-27 01:48:02,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:02,665 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-27 01:48:02,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:02,788 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-27 01:48:02,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:02,844 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-27 01:48:02,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:02,938 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-27 01:48:03,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:03,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:03,075 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 01:48:03,076 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 17 treesize of output 13 [2024-08-27 01:48:03,291 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 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:48:03,294 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-27 01:48:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:48:03,377 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:48:03,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:03,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-08-27 01:48:03,475 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 33 treesize of output 25 [2024-08-27 01:48:03,477 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 6 treesize of output 4 [2024-08-27 01:48:04,176 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (not (= c_~next_alloc_idx~0 0)))) (and (or (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0)))) (forall ((v_DerPreprocessor_16 (Array Int Int)) (v_prenex_124 (Array Int Int))) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_prenex_124) |c_~#top~0.base|) 0) 1) 0)))) (not (= c_~state~0 0))) (or (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0)))) (forall ((v_ArrVal_1347 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1347) |c_~#top~0.base|) 0) 1) 0)))) (not (= c_~state~0 1))))) (= |c_thr1Thread1of3ForFork0_push_~newTop~0#1| 0)) is different from false [2024-08-27 01:48:04,206 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (not (= c_~next_alloc_idx~0 0)))) (and (or (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0)))) (forall ((v_DerPreprocessor_16 (Array Int Int)) (v_prenex_124 (Array Int Int))) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_prenex_124) |c_~#top~0.base|) 0) 1) 0)))) (not (= c_~state~0 0))) (or (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0)))) (forall ((v_ArrVal_1347 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1347) |c_~#top~0.base|) 0) 1) 0)))) (not (= c_~state~0 1))))) (= |c_thr1Thread1of3ForFork0_index_malloc_~curr_alloc_idx~0#1| 0)) is different from false [2024-08-27 01:48:04,228 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread1of3ForFork0_index_malloc_~curr_alloc_idx~0#1| 0) (let ((.cse0 (not (= c_~next_alloc_idx~0 0)))) (and (or (not (= c_~state~0 0)) (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0)))) (forall ((v_DerPreprocessor_16 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_prenex_124 (Array Int Int))) (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_prenex_124) |c_~#top~0.base|) 0) 1) 0))))) (or (and (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (not (= 0 (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#m2~0.base| v_ArrVal_1347) |c_~#top~0.base|) 0) 1)))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0))) .cse0)) (not (= c_~state~0 1)))))) is different from false [2024-08-27 01:48:04,261 WARN L854 $PredicateComparison]: unable to prove that (or (= c_~next_alloc_idx~0 0) (let ((.cse0 (not (= (+ c_~next_alloc_idx~0 2) 0)))) (and (or (not (= c_~state~0 1)) (and (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (not (= 0 (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#m2~0.base| v_ArrVal_1347) |c_~#top~0.base|) 0) 1)))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0))) .cse0))) (or (not (= c_~state~0 0)) (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0)))) (forall ((v_DerPreprocessor_16 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_prenex_124 (Array Int Int))) (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_prenex_124) |c_~#top~0.base|) 0) 1) 0)))))))) is different from false [2024-08-27 01:48:04,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:04,464 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 1 case distinctions, treesize of input 12 treesize of output 8 [2024-08-27 01:48:04,502 INFO L349 Elim1Store]: treesize reduction 22, result has 60.0 percent of original size [2024-08-27 01:48:04,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 558 treesize of output 566 [2024-08-27 01:48:04,514 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 303 treesize of output 301 [2024-08-27 01:48:04,520 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 301 treesize of output 293 [2024-08-27 01:48:04,530 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 293 treesize of output 289 [2024-08-27 01:48:04,541 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 289 treesize of output 287 [2024-08-27 01:48:04,552 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 287 treesize of output 285 [2024-08-27 01:48:04,563 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 285 treesize of output 281 [2024-08-27 01:48:04,573 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 281 treesize of output 279 [2024-08-27 01:48:04,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 279 treesize of output 277 [2024-08-27 01:48:04,589 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 277 treesize of output 273 [2024-08-27 01:48:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 11 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2024-08-27 01:48:04,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168758055] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:48:04,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:48:04,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 37 [2024-08-27 01:48:04,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846054146] [2024-08-27 01:48:04,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:48:04,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-08-27 01:48:04,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:04,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-08-27 01:48:04,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=973, Unknown=20, NotChecked=268, Total=1406 [2024-08-27 01:48:04,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:04,772 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:04,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.2894736842105265) internal successors, (201), 37 states have internal predecessors, (201), 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-27 01:48:04,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:04,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:04,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:04,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:04,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:04,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:04,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:04,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:04,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:48:04,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:05,750 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (= c_~state~0 0))) (let ((.cse5 (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse20 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse20 |c_~#top~0.base| (store (select .cse20 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0))))) (.cse12 (not (= c_~state~0 1))) (.cse3 (not .cse6))) (let ((.cse4 (or .cse3 (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (let ((.cse19 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_10))) (or (not (= (select (select (store (let ((.cse18 (store (select (store (store .cse19 |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse18) |c_~#top~0.base| (store (select (store (store .cse19 |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse18) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store .cse19 |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0))))))) (.cse14 (or .cse5 .cse12))) (let ((.cse1 (and .cse4 .cse14)) (.cse0 (= |c_thr1Thread1of3ForFork0_index_malloc_~curr_alloc_idx~0#1| 0))) (and (or .cse0 .cse1) (or (= |c_thr1Thread1of3ForFork0_push_~newTop~0#1| 0) .cse1) (= |c_~#top~0.offset| 0) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)) (not (= (select (select (store (let ((.cse2 (store (select (store (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse2) |c_~#top~0.base| (store (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse2) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) .cse3) .cse4 (or (and (or .cse5 .cse6) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse7 (store (select (store (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse7) |c_~#top~0.base| (store (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse7) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)))) .cse3)) (not |c_thr1Thread2of3ForFork0_#t~switch18#1|)) (or (= c_~next_alloc_idx~0 0) (let ((.cse10 (+ c_~next_alloc_idx~0 2))) (and (or .cse3 (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_808 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_808) |c_~#top~0.base| v_DerPreprocessor_10) |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)) (not (= (select (select (store (let ((.cse9 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_10))) (let ((.cse8 (store (select (store (store .cse9 |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse8) |c_~#top~0.base| (store (select (store (store .cse9 |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse8) |c_~#top~0.base|) |c_~#top~0.offset| .cse10)))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_808 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_808) |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)) (not (= (select (select (store (let ((.cse11 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse11 |c_~#top~0.base| (store (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset| .cse10))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) .cse12)))) (or .cse6 (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse13 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse13 |c_~#top~0.base| (store (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0))))) .cse14 (or .cse0 (and (or (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_808 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse16 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_10))) (let ((.cse15 (store (select (store (store .cse16 |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse15) |c_~#top~0.base| (store (select (store (store .cse16 |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse15) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0)))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_808) |c_~#top~0.base| v_DerPreprocessor_10) |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)))) .cse3) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_808 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse17 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse17 |c_~#top~0.base| (store (select .cse17 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_808) |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)))) .cse12)))))))) is different from false [2024-08-27 01:48:06,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:06,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:06,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:06,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:06,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-27 01:48:06,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:06,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:06,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:06,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:48:06,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:06,681 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-27 01:48:06,866 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,SelfDestructingSolverStorable23 [2024-08-27 01:48:06,867 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:06,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:06,867 INFO L85 PathProgramCache]: Analyzing trace with hash 425971427, now seen corresponding path program 1 times [2024-08-27 01:48:06,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:06,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675036703] [2024-08-27 01:48:06,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:06,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-08-27 01:48:06,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:06,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675036703] [2024-08-27 01:48:06,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675036703] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:48:06,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:48:06,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 01:48:06,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053622369] [2024-08-27 01:48:06,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:48:06,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:48:06,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:06,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:48:06,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:48:06,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:06,996 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:06,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-27 01:48:06,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:06,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:06,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:06,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:06,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-27 01:48:06,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:06,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:06,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:06,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:48:06,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:06,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:07,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:07,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:07,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:07,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:07,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:07,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:07,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:07,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:07,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:48:07,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:07,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:07,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-08-27 01:48:07,579 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:07,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:07,579 INFO L85 PathProgramCache]: Analyzing trace with hash 701199428, now seen corresponding path program 1 times [2024-08-27 01:48:07,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:07,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851268334] [2024-08-27 01:48:07,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:07,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:08,705 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:48:08,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:08,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851268334] [2024-08-27 01:48:08,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851268334] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:08,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38995002] [2024-08-27 01:48:08,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:08,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:08,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:08,708 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-27 01:48:08,711 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-27 01:48:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:08,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 30 conjunts are in the unsatisfiable core [2024-08-27 01:48:08,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:09,148 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 01:48:09,148 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 17 treesize of output 13 [2024-08-27 01:48:09,311 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 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:48:09,313 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-27 01:48:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:48:09,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:48:09,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:09,464 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 19 treesize of output 20 [2024-08-27 01:48:09,466 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 33 treesize of output 25 [2024-08-27 01:48:09,468 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 6 treesize of output 4 [2024-08-27 01:48:09,625 INFO L349 Elim1Store]: treesize reduction 11, result has 60.7 percent of original size [2024-08-27 01:48:09,626 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 35 treesize of output 39 [2024-08-27 01:48:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:48:09,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38995002] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:48:09,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:48:09,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 37 [2024-08-27 01:48:09,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028077288] [2024-08-27 01:48:09,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:48:09,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-08-27 01:48:09,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:09,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-08-27 01:48:09,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1271, Unknown=2, NotChecked=0, Total=1406 [2024-08-27 01:48:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:09,750 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:09,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.684210526315789) internal successors, (216), 37 states have internal predecessors, (216), 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-27 01:48:09,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:09,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:09,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:09,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:09,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:09,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:09,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:09,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:09,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:48:09,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:09,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:09,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:12,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:12,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:12,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:12,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:12,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:12,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:12,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:12,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:12,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:48:12,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:12,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:12,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-08-27 01:48:12,362 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-27 01:48:12,549 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,SelfDestructingSolverStorable25 [2024-08-27 01:48:12,549 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:12,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:12,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1378747720, now seen corresponding path program 1 times [2024-08-27 01:48:12,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:12,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106572476] [2024-08-27 01:48:12,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:12,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:13,280 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 01:48:13,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:13,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106572476] [2024-08-27 01:48:13,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106572476] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:13,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192936989] [2024-08-27 01:48:13,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:13,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:13,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:13,283 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-27 01:48:13,285 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-27 01:48:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:13,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 23 conjunts are in the unsatisfiable core [2024-08-27 01:48:13,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:13,593 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 01:48:13,594 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-27 01:48:13,724 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 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:48:13,727 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-27 01:48:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:48:13,774 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:48:13,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:13,856 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 19 treesize of output 20 [2024-08-27 01:48:13,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-08-27 01:48:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:48:13,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192936989] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:48:13,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:48:13,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2024-08-27 01:48:13,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248100622] [2024-08-27 01:48:13,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:48:13,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-08-27 01:48:13,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:14,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-08-27 01:48:14,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=523, Unknown=2, NotChecked=0, Total=600 [2024-08-27 01:48:14,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:14,001 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:14,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.96) internal successors, (174), 24 states have internal predecessors, (174), 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-27 01:48:14,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:14,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:14,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:14,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:14,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:14,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:14,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:14,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:14,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:48:14,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:14,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:14,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-08-27 01:48:14,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:17,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:17,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:17,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:17,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:17,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:17,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:17,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:17,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:17,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:48:17,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:17,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:17,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-08-27 01:48:17,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-08-27 01:48:17,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-08-27 01:48:17,354 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,SelfDestructingSolverStorable26 [2024-08-27 01:48:17,354 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:17,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:17,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1085853016, now seen corresponding path program 1 times [2024-08-27 01:48:17,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:17,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787620379] [2024-08-27 01:48:17,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:17,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:17,940 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-27 01:48:17,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:17,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787620379] [2024-08-27 01:48:17,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787620379] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:17,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928173134] [2024-08-27 01:48:17,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:17,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:17,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:17,943 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-27 01:48:17,949 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-27 01:48:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:18,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 40 conjunts are in the unsatisfiable core [2024-08-27 01:48:18,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:18,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:18,698 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:18,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2024-08-27 01:48:18,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:18,774 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:18,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-08-27 01:48:18,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:18,861 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:18,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-08-27 01:48:18,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:18,895 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:18,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-08-27 01:48:18,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:18,943 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:18,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-08-27 01:48:18,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:18,979 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:18,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-08-27 01:48:19,086 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-08-27 01:48:19,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 35 [2024-08-27 01:48:19,098 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-08-27 01:48:19,098 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 29 treesize of output 26 [2024-08-27 01:48:19,101 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-27 01:48:19,163 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:48:19,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:48:19,278 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1853 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1853))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_push_~newTop~0#1|))) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-08-27 01:48:19,307 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1853 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1853))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_index_malloc_~curr_alloc_idx~0#1|))) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-08-27 01:48:19,313 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1853 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1853))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-08-27 01:48:19,361 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-08-27 01:48:19,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 68 [2024-08-27 01:48:19,364 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 50 treesize of output 46 [2024-08-27 01:48:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2024-08-27 01:48:19,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928173134] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:48:19,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:48:19,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 13] total 35 [2024-08-27 01:48:19,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057530526] [2024-08-27 01:48:19,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:48:19,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-08-27 01:48:19,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:19,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-08-27 01:48:19,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=926, Unknown=8, NotChecked=192, Total=1260 [2024-08-27 01:48:19,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:19,554 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:19,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.388888888888889) internal successors, (266), 35 states have internal predecessors, (266), 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-27 01:48:19,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:19,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:19,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:19,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:19,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:19,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:19,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:19,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:19,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:48:19,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:19,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:19,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-08-27 01:48:19,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-08-27 01:48:19,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:23,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:23,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-27 01:48:23,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:23,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:23,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-08-27 01:48:23,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:48:23,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-08-27 01:48:23,212 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-27 01:48:23,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-08-27 01:48:23,399 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:23,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:23,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1994314252, now seen corresponding path program 1 times [2024-08-27 01:48:23,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:23,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834718635] [2024-08-27 01:48:23,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:23,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-08-27 01:48:23,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:23,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834718635] [2024-08-27 01:48:23,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834718635] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:48:23,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:48:23,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-27 01:48:23,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114240411] [2024-08-27 01:48:23,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:48:23,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 01:48:23,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:23,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 01:48:23,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 01:48:23,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:23,627 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:23,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-27 01:48:23,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:23,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:23,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:23,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:23,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:23,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:23,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:23,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:23,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-27 01:48:23,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:23,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:23,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2024-08-27 01:48:23,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:48:23,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-08-27 01:48:23,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2024-08-27 01:48:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:48:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-08-27 01:48:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:24,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-08-27 01:48:24,899 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:24,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:24,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1384830022, now seen corresponding path program 1 times [2024-08-27 01:48:24,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:24,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794376071] [2024-08-27 01:48:24,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:24,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-08-27 01:48:26,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:26,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794376071] [2024-08-27 01:48:26,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794376071] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:26,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826698721] [2024-08-27 01:48:26,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:26,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:26,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:26,433 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-27 01:48:26,434 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-27 01:48:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:26,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 29 conjunts are in the unsatisfiable core [2024-08-27 01:48:26,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:26,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:26,992 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-27 01:48:27,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:27,010 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-27 01:48:27,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:27,055 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-27 01:48:27,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:27,072 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-27 01:48:27,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:27,129 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:27,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2024-08-27 01:48:27,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:27,181 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:27,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-08-27 01:48:27,188 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 01:48:27,188 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 17 treesize of output 17 [2024-08-27 01:48:27,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 16 treesize of output 16 [2024-08-27 01:48:27,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-08-27 01:48:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 48 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-27 01:48:27,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:48:27,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:27,556 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 19 treesize of output 20 [2024-08-27 01:48:27,558 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 33 treesize of output 25 [2024-08-27 01:48:27,561 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 6 treesize of output 4 [2024-08-27 01:48:27,657 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2187 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2187) |c_~#top~0.base|) 0) 1) 0))) is different from false [2024-08-27 01:48:27,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:27,680 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 37 treesize of output 37 [2024-08-27 01:48:27,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 24 treesize of output 22 [2024-08-27 01:48:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 32 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2024-08-27 01:48:27,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826698721] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:48:27,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:48:27,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 34 [2024-08-27 01:48:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592733644] [2024-08-27 01:48:27,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:48:27,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-08-27 01:48:27,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:27,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-08-27 01:48:27,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=992, Unknown=3, NotChecked=64, Total=1190 [2024-08-27 01:48:27,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:27,844 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:27,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.142857142857142) internal successors, (285), 34 states have internal predecessors, (285), 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-27 01:48:27,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:27,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:27,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:27,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:27,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:27,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:27,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:27,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:27,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:27,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:27,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:27,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2024-08-27 01:48:27,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:48:27,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-08-27 01:48:27,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:27,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:31,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:31,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:31,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:31,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:31,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-08-27 01:48:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:48:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-08-27 01:48:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:48:31,069 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-27 01:48:31,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:31,256 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:31,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2018876800, now seen corresponding path program 2 times [2024-08-27 01:48:31,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:31,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282221583] [2024-08-27 01:48:31,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:31,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-27 01:48:31,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:31,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282221583] [2024-08-27 01:48:31,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282221583] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:31,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999364908] [2024-08-27 01:48:31,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 01:48:31,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:31,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:31,845 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-27 01:48:31,845 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-27 01:48:32,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-27 01:48:32,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 01:48:32,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 28 conjunts are in the unsatisfiable core [2024-08-27 01:48:32,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:32,419 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-08-27 01:48:32,420 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 1 case distinctions, treesize of input 27 treesize of output 19 [2024-08-27 01:48:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:48:32,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:48:32,673 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:48:32,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999364908] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:48:32,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:48:32,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 27 [2024-08-27 01:48:32,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505376437] [2024-08-27 01:48:32,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:48:32,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-08-27 01:48:32,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:32,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-08-27 01:48:32,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=644, Unknown=1, NotChecked=0, Total=756 [2024-08-27 01:48:32,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:32,675 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:32,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.25) internal successors, (231), 27 states have internal predecessors, (231), 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-27 01:48:32,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:32,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:32,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:32,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:32,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:32,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:32,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:32,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:32,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:32,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:32,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:32,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 122 states. [2024-08-27 01:48:32,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:48:32,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2024-08-27 01:48:32,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:32,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:48:32,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:36,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:36,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:36,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-08-27 01:48:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-08-27 01:48:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-08-27 01:48:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:48:36,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-27 01:48:36,114 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-27 01:48:36,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:36,301 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:36,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:36,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1087457335, now seen corresponding path program 1 times [2024-08-27 01:48:36,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:36,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954922825] [2024-08-27 01:48:36,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:36,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:36,748 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-08-27 01:48:36,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:36,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954922825] [2024-08-27 01:48:36,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954922825] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:36,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287422658] [2024-08-27 01:48:36,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:36,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:36,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:36,752 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:48:36,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-08-27 01:48:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:37,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 39 conjunts are in the unsatisfiable core [2024-08-27 01:48:37,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:37,360 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-08-27 01:48:37,361 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 1 case distinctions, treesize of input 27 treesize of output 19 [2024-08-27 01:48:37,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:37,413 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:37,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 29 [2024-08-27 01:48:37,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:37,488 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:37,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2024-08-27 01:48:37,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:37,711 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2024-08-27 01:48:37,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:37,715 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 24 treesize of output 17 [2024-08-27 01:48:37,789 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2024-08-27 01:48:37,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 77 [2024-08-27 01:48:37,805 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 8 treesize of output 7 [2024-08-27 01:48:37,820 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-08-27 01:48:37,820 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 19 treesize of output 27 [2024-08-27 01:48:37,853 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-27 01:48:37,854 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 32 treesize of output 15 [2024-08-27 01:48:37,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:37,863 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-27 01:48:38,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:38,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 145 [2024-08-27 01:48:38,068 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-27 01:48:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:48:38,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:48:40,235 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_30 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#top~0.base|))) (= (select .cse0 |c_~#top~0.offset|) (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#top~0.base|) |c_~#top~0.offset|)))) is different from false [2024-08-27 01:48:40,317 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_2535 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2535))) (or (let ((.cse0 (select .cse1 |c_~#top~0.base|))) (= (select .cse0 |c_~#top~0.offset|) (select (select (store (store .cse1 |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#top~0.base|) |c_~#top~0.offset|))) (= (select (select .cse1 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1)))) is different from false [2024-08-27 01:48:40,358 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse4 |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((v_DerPreprocessor_30 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2535 (Array Int Int))) (let ((.cse1 (store (let ((.cse3 (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (store .cse3 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse3 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) |c_~#m~0.base| v_ArrVal_2535))) (or (= (select (select .cse1 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (let ((.cse2 (select .cse1 |c_~#top~0.base|))) (= (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2535) |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#top~0.base|) |c_~#top~0.offset|) (select .cse2 |c_~#top~0.offset|))))))) (or .cse0 (forall ((v_DerPreprocessor_30 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_31 (Array Int Int)) (v_ArrVal_2535 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_31) |c_~#m~0.base| v_ArrVal_2535))) (or (= (select (select .cse5 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (let ((.cse6 (select .cse5 |c_~#top~0.base|))) (= (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2535) |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#top~0.base|) |c_~#top~0.offset|) (select .cse6 |c_~#top~0.offset|)))))))))) is different from false [2024-08-27 01:48:40,390 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-08-27 01:48:40,390 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 2 case distinctions, treesize of input 114 treesize of output 68 [2024-08-27 01:48:40,398 INFO L349 Elim1Store]: treesize reduction 3, result has 72.7 percent of original size [2024-08-27 01:48:40,399 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 105 treesize of output 93 [2024-08-27 01:48:40,404 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-27 01:48:40,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:40,409 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-27 01:48:40,470 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2024-08-27 01:48:40,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287422658] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:48:40,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:48:40,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17, 12] total 33 [2024-08-27 01:48:40,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476489278] [2024-08-27 01:48:40,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:48:40,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-08-27 01:48:40,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:40,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-08-27 01:48:40,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=813, Unknown=20, NotChecked=180, Total=1122 [2024-08-27 01:48:40,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:40,472 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:40,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.882352941176471) internal successors, (234), 33 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:40,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:40,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:40,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:40,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:40,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:40,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:40,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:40,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:40,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:40,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:40,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:40,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-08-27 01:48:40,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-08-27 01:48:40,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-08-27 01:48:40,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:40,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:48:40,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-27 01:48:40,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:45,543 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-27 01:48:49,745 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-27 01:48:53,787 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-27 01:49:00,026 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-27 01:49:02,057 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-27 01:49:04,067 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-27 01:49:06,077 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-27 01:49:08,086 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-27 01:49:10,091 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-27 01:49:12,406 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-27 01:49:16,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 [0] [2024-08-27 01:49:18,599 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-27 01:49:19,403 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (.cse3 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse2 (select .cse3 |c_~#top~0.offset|)) (.cse5 (select .cse6 0))) (let ((.cse4 (= .cse5 1)) (.cse0 (select .cse3 0)) (.cse1 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse2))) (and (= |c_~#m~0.offset| 0) (or (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|) (= .cse0 3)) (= |c_~#top~0.offset| 0) (= |c_thr1Thread2of3ForFork0_push_#t~mem13#1| 1) (<= |c_~#m~0.base| 3) (or (not .cse1) (forall ((v_DerPreprocessor_30 (Array Int Int))) (= .cse2 (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#top~0.base|) |c_~#top~0.offset|)))) (or (forall ((v_DerPreprocessor_29 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#top~0.base|) |c_~#top~0.offset|) .cse2)) .cse1) .cse4 (or (< |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| 4) .cse4) (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse0) .cse1 (= 3 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|) (= .cse5 |c_thr1Thread2of3ForFork0_push_#t~mem13#1|) (or (= |c_~#m~0.offset| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (not (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| |c_~#m~0.base|))) (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 0) (<= 4 |c_~#top~0.base|) (= (select .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1))))) is different from false [2024-08-27 01:49:21,424 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-27 01:49:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:49:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:49:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:49:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:49:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:49:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:49:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:49:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:49:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:49:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:49:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:49:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-08-27 01:49:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-08-27 01:49:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-08-27 01:49:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:49:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:49:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-27 01:49:33,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-08-27 01:49:33,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-08-27 01:49:34,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-08-27 01:49:34,162 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:49:34,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:49:34,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1402148267, now seen corresponding path program 1 times [2024-08-27 01:49:34,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:49:34,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118799395] [2024-08-27 01:49:34,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:49:34,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:49:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:49:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-27 01:49:34,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:49:34,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118799395] [2024-08-27 01:49:34,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118799395] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:49:34,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953335072] [2024-08-27 01:49:34,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:49:34,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:49:34,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:49:34,494 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-27 01:49:34,496 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-27 01:49:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:49:34,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 19 conjunts are in the unsatisfiable core [2024-08-27 01:49:34,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:49:34,779 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-27 01:49:34,804 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 01:49:34,804 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-27 01:49:34,852 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-08-27 01:49:34,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2024-08-27 01:49:34,856 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 8 treesize of output 7 [2024-08-27 01:49:34,860 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 8 treesize of output 7 [2024-08-27 01:49:34,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:49:34,882 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 0 case distinctions, treesize of input 31 treesize of output 14 [2024-08-27 01:49:34,935 INFO L349 Elim1Store]: treesize reduction 82, result has 30.5 percent of original size [2024-08-27 01:49:34,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 68 treesize of output 139 [2024-08-27 01:49:34,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:49:34,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-08-27 01:49:34,998 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 8 treesize of output 7 [2024-08-27 01:49:35,054 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-08-27 01:49:35,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 71 [2024-08-27 01:49:35,065 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-27 01:49:35,067 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-27 01:49:35,071 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-27 01:49:35,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:49:35,088 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-08-27 01:49:35,089 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 53 treesize of output 38 [2024-08-27 01:49:35,092 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-27 01:49:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 01:49:35,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:49:35,241 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_40 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| Int)) (or (= (select v_DerPreprocessor_40 |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_40) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1))) is different from false [2024-08-27 01:49:35,286 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|))) (and (or (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (or (= (select v_DerPreprocessor_40 |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_40) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1))) .cse0) (or (not .cse0) (forall ((v_DerPreprocessor_40 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_2681 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (or (= (select v_DerPreprocessor_40 |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_2681))) (store .cse1 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse1 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_40) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))) is different from false [2024-08-27 01:49:35,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:49:35,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-08-27 01:49:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2024-08-27 01:49:35,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953335072] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:49:35,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:49:35,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 22 [2024-08-27 01:49:35,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947104456] [2024-08-27 01:49:35,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:49:35,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-08-27 01:49:35,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:49:35,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-08-27 01:49:35,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=321, Unknown=2, NotChecked=74, Total=462 [2024-08-27 01:49:35,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:49:35,353 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:49:35,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 22 states have internal predecessors, (170), 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-27 01:49:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:49:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:49:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:49:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:49:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:49:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:49:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:49:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:49:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:49:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:49:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:49:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-08-27 01:49:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-08-27 01:49:35,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2024-08-27 01:49:35,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:49:35,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:49:35,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-27 01:49:35,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2024-08-27 01:49:35,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:49:38,068 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-27 01:49:40,195 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-27 01:49:42,323 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-27 01:49:42,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:49:42,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:49:42,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:49:42,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:49:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:49:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:49:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:49:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:49:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:49:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:49:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:49:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-08-27 01:49:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-08-27 01:49:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-08-27 01:49:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:49:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:49:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-27 01:49:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-08-27 01:49:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-08-27 01:49:42,970 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-27 01:49:43,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-08-27 01:49:43,157 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:49:43,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:49:43,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1345921391, now seen corresponding path program 1 times [2024-08-27 01:49:43,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:49:43,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557293318] [2024-08-27 01:49:43,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:49:43,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:49:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:49:45,856 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:49:45,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:49:45,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557293318] [2024-08-27 01:49:45,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557293318] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:49:45,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619048021] [2024-08-27 01:49:45,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:49:45,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:49:45,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:49:45,859 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:49:45,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-08-27 01:49:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:49:46,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 75 conjunts are in the unsatisfiable core [2024-08-27 01:49:46,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:49:46,304 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 01:49:46,304 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-27 01:49:46,713 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 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:49:46,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:49:46,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:49:46,957 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-27 01:49:47,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:49:47,038 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-27 01:49:47,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:49:47,189 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-27 01:49:47,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:49:47,278 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-27 01:49:47,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:49:47,534 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-08-27 01:49:47,534 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 32 treesize of output 40 [2024-08-27 01:49:47,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:49:47,699 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:49:47,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-08-27 01:49:48,020 INFO L349 Elim1Store]: treesize reduction 46, result has 37.0 percent of original size [2024-08-27 01:49:48,020 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 4 case distinctions, treesize of input 48 treesize of output 46 [2024-08-27 01:49:48,346 INFO L349 Elim1Store]: treesize reduction 126, result has 26.7 percent of original size [2024-08-27 01:49:48,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 115 treesize of output 153 [2024-08-27 01:49:48,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2024-08-27 01:49:48,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:49:48,642 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-27 01:49:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:49:48,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:49:49,001 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse4 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse5 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse4 |c_~#top~0.offset|)))) (and (or (let ((.cse2 (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (and (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse0 (store (select .cse2 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse1 (select (store .cse2 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse0) |c_~#top~0.base|))) (or (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse0) |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|))))))) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse3 (store .cse2 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse2 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1)))) (or (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|)) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse3 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))) (not .cse5)) (or .cse5 (and (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse6 (select .cse7 |c_~#top~0.base|))) (or (not (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select .cse6 |c_~#top~0.offset|))) (not (= (select (select (store (store .cse7 |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse8 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|)))))))))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-08-27 01:49:49,041 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0) (let ((.cse5 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse2 (select .cse5 |c_~#top~0.offset|))) (let ((.cse6 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse2))) (and (or (let ((.cse3 (store |c_#memory_int| |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (and (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse0 (store (select .cse3 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse1 (select (store .cse3 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse0) |c_~#top~0.base|))) (or (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse0) |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= .cse2 (select .cse1 |c_~#top~0.offset|))))))) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse4 (store .cse3 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse3 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1)))) (or (= .cse2 (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|)) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse4 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))) (not .cse6)) (or (and (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse8 (select .cse7 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse7 |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse2 (select .cse8 |c_~#top~0.offset|))))))) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse9 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse2 (select (select .cse9 |c_~#top~0.base|) |c_~#top~0.offset|)))))) .cse6)))))) is different from false [2024-08-27 01:49:49,218 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse9 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (select .cse9 |c_~#top~0.offset|))) (let ((.cse4 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse1))) (and (or (and (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse0 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse1 (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|))))) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse3 (select .cse2 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse2 |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse1 (select .cse3 |c_~#top~0.offset|)))))))) .cse4) (or (not .cse4) (let ((.cse7 (store |c_#memory_int| |c_~#top~0.base| (store .cse9 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (and (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse5 (store (select .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse6 (select (store .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base|))) (or (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= .cse1 (select .cse6 |c_~#top~0.offset|))))))) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse8 (store .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1)))) (or (= .cse1 (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|)) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse8 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))))))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-08-27 01:49:50,112 WARN L854 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse4 (select .cse3 |c_~#top~0.base|))) (let ((.cse0 (select .cse4 |c_~#top~0.offset|))) (or (not (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse0)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse1 (let ((.cse2 (store .cse3 |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (store .cse2 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse2 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse1 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (= .cse0 (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|)))))))))) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse10 (select .cse7 |c_~#top~0.base|))) (let ((.cse5 (select .cse10 |c_~#top~0.offset|))) (or (not (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse5)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse9 (store .cse7 |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse8 (store (select .cse9 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse6 (select (store .cse9 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#top~0.base|))) (or (not (= .cse5 (select .cse6 |c_~#top~0.offset|))) (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| c_~next_alloc_idx~0)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))))))) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse11 (select (select .cse14 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse11) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse12 (store .cse14 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse13 (select .cse12 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse12 |c_~#top~0.base| (store .cse13 |c_~#top~0.offset| c_~next_alloc_idx~0)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse11 (select .cse13 |c_~#top~0.offset|))))))))))) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse15 (select (select .cse17 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse16 (store .cse17 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (= .cse15 (select (select .cse16 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select (store .cse16 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse15)))))) (forall ((|~#m~0.offset| Int)) (not (= (select (select |c_#memory_int| |c_~#m~0.base|) |~#m~0.offset|) 0))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-08-27 01:49:54,019 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse22 (= c_~state~0 0))) (and (or (and (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse4 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse3 (store .cse4 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse2 (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse0 (store .cse3 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse1 (select .cse0 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse0 |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse1 |c_~#top~0.offset|) .cse2)))))) (= (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|) .cse2))))) (not (= (+ (select (select .cse4 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)))) (not (= (select (select .cse4 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse8 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse7 (store .cse8 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse6 (select (select .cse7 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse5 (store .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse5 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse5 |c_~#top~0.base|) |c_~#top~0.offset|) .cse6)))) (= (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|) .cse6))))) (not (= (+ (select (select .cse8 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)))) (not (= (select (select .cse8 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse9 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse9 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse13 (store .cse9 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse14 (select .cse13 |c_~#top~0.base|))) (let ((.cse10 (select .cse14 |c_~#top~0.offset|))) (or (not (= (select (select .cse9 |c_~#top~0.base|) |c_~#top~0.offset|) .cse10)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse11 (let ((.cse12 (store .cse13 |c_~#top~0.base| (store .cse14 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (store .cse12 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse12 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse11 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (= (select (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset|) .cse10))))))))))) (not (= (select (select .cse9 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse15 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse15 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse17 (store .cse15 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse21 (select .cse17 |c_~#top~0.base|))) (let ((.cse16 (select .cse21 |c_~#top~0.offset|))) (or (not (= (select (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset|) .cse16)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse20 (store .cse17 |c_~#top~0.base| (store .cse21 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse18 (store (select .cse20 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse19 (select (store .cse20 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse18) |c_~#top~0.base|))) (or (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse17 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse18) |c_~#top~0.base| (store .cse19 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= (select .cse19 |c_~#top~0.offset|) .cse16)))))))))))))) (not (= (select (select .cse15 |c_~#m~0.base|) |~#m~0.offset|) 0)))))) .cse22) (or (and (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_prenex_225 Int) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224))) (let ((.cse27 (select (store .cse23 |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse24 (select .cse27 |c_~#top~0.offset|)) (.cse25 (let ((.cse26 (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse27 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (store .cse26 v_prenex_225 (store (select .cse26 v_prenex_225) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (not (= (select (select .cse23 |c_~#m~0.base|) v_prenex_229) 0)) (not (= (+ (select (select .cse23 v_prenex_226) 0) 1) 0)) (not (= .cse24 (select (select .cse23 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select (store .cse25 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse24 (select (select .cse25 |c_~#top~0.base|) |c_~#top~0.offset|))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse28 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847))) (let ((.cse31 (store .cse28 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse30 (select (select .cse31 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse29 (store .cse31 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (+ 1 (select (select .cse28 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0)) 0)) (= (select (select .cse29 |c_~#top~0.base|) |c_~#top~0.offset|) .cse30) (not (= (select (select .cse28 |c_~#m~0.base|) |~#m~0.offset|) 0)) (= (select (select .cse28 |c_~#top~0.base|) |c_~#top~0.offset|) .cse30) (not (= (select (select (store .cse29 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))) (forall ((v_prenex_218 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse33 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (let ((.cse35 (store .cse33 |c_~#m~0.base| v_prenex_221))) (let ((.cse32 (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse34 (select (store .cse35 v_prenex_219 v_prenex_222) |c_~#top~0.base|))) (or (= .cse32 (select (select .cse33 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (+ (select (select .cse33 v_prenex_220) 0) 1) 0)) (not (= (select (select (store (store (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse34 |c_~#top~0.offset| c_~next_alloc_idx~0)) v_prenex_220 v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse32 (select .cse34 |c_~#top~0.offset|))) (not (= (select (select .cse33 |c_~#m~0.base|) v_prenex_223) 0))))))) (forall ((v_prenex_235 Int) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230))) (let ((.cse39 (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse42 (select (store .cse36 |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse41 (store .cse39 |c_~#top~0.base| (store .cse42 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse40 (store (select .cse41 v_prenex_231) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse37 (select .cse42 |c_~#top~0.offset|)) (.cse38 (select (store .cse41 v_prenex_231 .cse40) |c_~#top~0.base|))) (or (not (= (select (select .cse36 |c_~#m~0.base|) v_prenex_235) 0)) (not (= .cse37 (select (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= .cse37 (select .cse38 |c_~#top~0.offset|))) (not (= (+ (select (select .cse36 v_prenex_232) 0) 1) 0)) (not (= (select (select (store (store (store .cse39 v_prenex_231 .cse40) |c_~#top~0.base| (store .cse38 |c_~#top~0.offset| c_~next_alloc_idx~0)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))))) (not .cse22)))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-08-27 01:49:55,251 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= c_~state~0 0))) (and (or (not .cse0) (and (forall ((v_prenex_235 Int) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230))) (let ((.cse4 (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse7 (select (store .cse1 |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse6 (store .cse4 |c_~#top~0.base| (store .cse7 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (let ((.cse5 (store (select .cse6 v_prenex_231) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse2 (select .cse7 |c_~#top~0.offset|)) (.cse3 (select (store .cse6 v_prenex_231 .cse5) |c_~#top~0.base|))) (or (not (= (select (select .cse1 |c_~#m~0.base|) v_prenex_235) 0)) (not (= .cse2 (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= .cse2 (select .cse3 |c_~#top~0.offset|))) (not (= (+ (select (select .cse1 v_prenex_232) 0) 1) 0)) (not (= (select (select (store (store (store .cse4 v_prenex_231 .cse5) |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| c_~next_alloc_idx~0)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))) (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_prenex_225 Int) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224))) (let ((.cse12 (select (store .cse8 |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse9 (select .cse12 |c_~#top~0.offset|)) (.cse10 (let ((.cse11 (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse12 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (store .cse11 v_prenex_225 (store (select .cse11 v_prenex_225) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (not (= (select (select .cse8 |c_~#m~0.base|) v_prenex_229) 0)) (not (= (+ (select (select .cse8 v_prenex_226) 0) 1) 0)) (not (= .cse9 (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|))) (= .cse9 (select (select .cse10 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select (store .cse10 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847))) (let ((.cse16 (store .cse13 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse15 (select (select .cse16 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse14 (store .cse16 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (+ 1 (select (select .cse13 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0)) 0)) (= (select (select .cse14 |c_~#top~0.base|) |c_~#top~0.offset|) .cse15) (not (= (select (select .cse13 |c_~#m~0.base|) |~#m~0.offset|) 0)) (= (select (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset|) .cse15) (not (= (select (select (store .cse14 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))) (forall ((v_prenex_218 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (let ((.cse20 (store .cse18 |c_~#m~0.base| v_prenex_221))) (let ((.cse17 (select (select .cse20 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse19 (select (store .cse20 v_prenex_219 v_prenex_222) |c_~#top~0.base|))) (or (= .cse17 (select (select .cse18 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (+ (select (select .cse18 v_prenex_220) 0) 1) 0)) (not (= (select (select (store (store (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse19 |c_~#top~0.offset| c_~next_alloc_idx~0)) v_prenex_220 v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse17 (select .cse19 |c_~#top~0.offset|))) (not (= (select (select .cse18 |c_~#m~0.base|) v_prenex_223) 0))))))))) (or (and (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse25 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse24 (store .cse25 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse23 (select (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse21 (store .cse24 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse22 (select .cse21 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse21 |c_~#top~0.base| (store .cse22 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse22 |c_~#top~0.offset|) .cse23)))))) (= (select (select .cse25 |c_~#top~0.base|) |c_~#top~0.offset|) .cse23))))) (not (= (+ (select (select .cse25 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)))) (not (= (select (select .cse25 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse26 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse30 (store .cse26 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse31 (select .cse30 |c_~#top~0.base|))) (let ((.cse27 (select .cse31 |c_~#top~0.offset|))) (or (not (= (select (select .cse26 |c_~#top~0.base|) |c_~#top~0.offset|) .cse27)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse28 (let ((.cse29 (store .cse30 |c_~#top~0.base| (store .cse31 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (store .cse29 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse29 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse28 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (= (select (select .cse28 |c_~#top~0.base|) |c_~#top~0.offset|) .cse27))))))))) (not (= (+ (select (select .cse26 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)))) (not (= (select (select .cse26 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse35 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse34 (store .cse35 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse33 (select (select .cse34 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse32 (store .cse34 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse32 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse32 |c_~#top~0.base|) |c_~#top~0.offset|) .cse33)))) (= (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|) .cse33))))) (not (= (+ (select (select .cse35 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)))) (not (= (select (select .cse35 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse36 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse36 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse36 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse39 (store .cse36 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse42 (select .cse39 |c_~#top~0.base|))) (let ((.cse37 (select .cse42 |c_~#top~0.offset|))) (or (not (= (select (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset|) .cse37)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse41 (store .cse39 |c_~#top~0.base| (store .cse42 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (let ((.cse40 (store (select .cse41 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse38 (select (store .cse41 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base|))) (or (not (= (select .cse38 |c_~#top~0.offset|) .cse37)) (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse39 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base| (store .cse38 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))))))))))))) .cse0))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-08-27 01:49:55,468 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse20 (= c_~state~0 0))) (and (or (and (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_225 Int) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse2 (let ((.cse4 (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (store .cse4 v_prenex_225 (store (select .cse4 v_prenex_225) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1)))) (.cse1 (select .cse3 |c_~#top~0.offset|)) (.cse0 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224))) (or (not (= (+ (select (select .cse0 v_prenex_226) 0) 1) 0)) (= .cse1 (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select (store .cse2 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse1 (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select .cse0 |c_~#m~0.base|) v_prenex_229) 0)))))) (forall ((v_prenex_235 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse11 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse10 (store .cse8 |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (let ((.cse9 (store (select .cse10 v_prenex_231) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse5 (select .cse11 |c_~#top~0.offset|)) (.cse7 (select (store .cse10 v_prenex_231 .cse9) |c_~#top~0.base|)) (.cse6 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230))) (or (not (= .cse5 (select (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= .cse5 (select .cse7 |c_~#top~0.offset|))) (not (= (select (select (store (store (store .cse8 v_prenex_231 .cse9) |c_~#top~0.base| (store .cse7 |c_~#top~0.offset| c_~next_alloc_idx~0)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse6 |c_~#m~0.base|) v_prenex_235) 0)) (not (= (+ (select (select .cse6 v_prenex_232) 0) 1) 0)))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2844 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse13 (select (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse12 (store .cse15 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46)) (.cse14 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847))) (or (= (select (select .cse12 |c_~#top~0.base|) |c_~#top~0.offset|) .cse13) (= (select (select .cse14 |c_~#top~0.base|) |c_~#top~0.offset|) .cse13) (not (= (+ 1 (select (select .cse14 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0)) 0)) (not (= (select (select (store .cse12 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse14 |c_~#m~0.base|) |~#m~0.offset|) 0)))))) (forall ((v_prenex_218 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221))) (let ((.cse16 (select (store .cse19 v_prenex_219 v_prenex_222) |c_~#top~0.base|)) (.cse18 (select (select .cse19 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse17 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (or (not (= (select (select (store (store (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse16 |c_~#top~0.offset| c_~next_alloc_idx~0)) v_prenex_220 v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse17 |c_~#m~0.base|) v_prenex_223) 0)) (not (= (+ (select (select .cse17 v_prenex_220) 0) 1) 0)) (not (= .cse18 (select .cse16 |c_~#top~0.offset|))) (= .cse18 (select (select .cse17 |c_~#top~0.base|) |c_~#top~0.offset|))))))) (not .cse20)) (or (and (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse21 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse21 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse21 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse22 (select (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse21 |c_~#top~0.base|) |c_~#top~0.offset|) .cse22) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse23 (store .cse24 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse23 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse23 |c_~#top~0.base|) |c_~#top~0.offset|) .cse22))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse25 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse25 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse25 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse30 (select .cse29 |c_~#top~0.base|))) (let ((.cse26 (select .cse30 |c_~#top~0.offset|))) (or (not (= (select (select .cse25 |c_~#top~0.base|) |c_~#top~0.offset|) .cse26)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse27 (let ((.cse28 (store .cse29 |c_~#top~0.base| (store .cse30 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (store .cse28 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse28 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse27 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (= (select (select .cse27 |c_~#top~0.base|) |c_~#top~0.offset|) .cse26)))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse31 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse31 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse31 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse35 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse32 (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse31 |c_~#top~0.base|) |c_~#top~0.offset|) .cse32) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse33 (store .cse35 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse34 (select .cse33 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse33 |c_~#top~0.base| (store .cse34 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse34 |c_~#top~0.offset|) .cse32))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse36 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse36 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse36 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse42 (select .cse39 |c_~#top~0.base|))) (let ((.cse37 (select .cse42 |c_~#top~0.offset|))) (or (not (= (select (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset|) .cse37)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse41 (store .cse39 |c_~#top~0.base| (store .cse42 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (let ((.cse40 (store (select .cse41 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse38 (select (store .cse41 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base|))) (or (not (= (select .cse38 |c_~#top~0.offset|) .cse37)) (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse39 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base| (store .cse38 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))))))))))))) .cse20))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-08-27 01:49:55,766 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= c_~state~0 0)) (.cse6 (+ c_~next_alloc_idx~0 2))) (and (or .cse0 (and (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse1 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse1 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse1 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse8 (select .cse4 |c_~#top~0.base|))) (let ((.cse2 (select .cse8 |c_~#top~0.offset|))) (or (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) .cse2)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse7 (store .cse4 |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse5 (store (select .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse3 (select (store .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base|))) (or (not (= (select .cse3 |c_~#top~0.offset|) .cse2)) (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse4 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| .cse6)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse9 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse9 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse9 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse14 (select .cse13 |c_~#top~0.base|))) (let ((.cse10 (select .cse14 |c_~#top~0.offset|))) (or (not (= (select (select .cse9 |c_~#top~0.base|) |c_~#top~0.offset|) .cse10)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse11 (let ((.cse12 (store .cse13 |c_~#top~0.base| (store .cse14 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse12 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse12 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (= (select (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset|) .cse10) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse11 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse15 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse15 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse15 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse16 (select (select .cse19 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset|) .cse16) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse17 (store .cse19 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse18 (select .cse17 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse17 |c_~#top~0.base| (store .cse18 |c_~#top~0.offset| .cse6)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse18 |c_~#top~0.offset|) .cse16))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse20 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse20 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse20 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse21 (select (select .cse23 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse20 |c_~#top~0.base|) |c_~#top~0.offset|) .cse21) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse22 (store .cse23 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse22 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse22 |c_~#top~0.base|) |c_~#top~0.offset|) .cse21))))))))))))))) (or (not .cse0) (and (forall ((v_prenex_218 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221))) (let ((.cse26 (select (store .cse27 v_prenex_219 v_prenex_222) |c_~#top~0.base|)) (.cse25 (select (select .cse27 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse24 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (or (not (= (select (select .cse24 |c_~#m~0.base|) v_prenex_223) 0)) (not (= (+ (select (select .cse24 v_prenex_220) 0) 1) 0)) (not (= .cse25 (select .cse26 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse26 |c_~#top~0.offset| .cse6)) v_prenex_220 v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse25 (select (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset|)))))) (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_225 Int) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse31 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse29 (let ((.cse32 (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse31 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse32 v_prenex_225 (store (select .cse32 v_prenex_225) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1)))) (.cse30 (select .cse31 |c_~#top~0.offset|)) (.cse28 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224))) (or (not (= (+ (select (select .cse28 v_prenex_226) 0) 1) 0)) (not (= (select (select (store .cse29 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse30 (select (select .cse29 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= .cse30 (select (select .cse28 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select .cse28 |c_~#m~0.base|) v_prenex_229) 0)))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2844 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse36 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse34 (select (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse33 (store .cse36 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46)) (.cse35 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847))) (or (= (select (select .cse33 |c_~#top~0.base|) |c_~#top~0.offset|) .cse34) (= (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|) .cse34) (not (= (+ 1 (select (select .cse35 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0)) 0)) (not (= (select (select (store .cse33 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse35 |c_~#m~0.base|) |~#m~0.offset|) 0)))))) (forall ((v_prenex_235 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse43 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse42 (store .cse37 |c_~#top~0.base| (store .cse43 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse38 (store (select .cse42 v_prenex_231) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse40 (select .cse43 |c_~#top~0.offset|)) (.cse39 (select (store .cse42 v_prenex_231 .cse38) |c_~#top~0.base|)) (.cse41 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230))) (or (not (= (select (select (store (store (store .cse37 v_prenex_231 .cse38) |c_~#top~0.base| (store .cse39 |c_~#top~0.offset| .cse6)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse40 (select (select .cse41 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select .cse41 |c_~#m~0.base|) v_prenex_235) 0)) (not (= .cse40 (select .cse39 |c_~#top~0.offset|))) (not (= (+ (select (select .cse41 v_prenex_232) 0) 1) 0)))))))))))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-08-27 01:49:56,238 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse4 (+ c_~next_alloc_idx~0 2)) (.cse0 (= c_~state~0 0))) (and (or (not .cse0) (and (forall ((v_prenex_218 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221))) (let ((.cse3 (select (store .cse5 v_prenex_219 v_prenex_222) |c_~#top~0.base|)) (.cse2 (select (select .cse5 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse1 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (or (not (= (select (select .cse1 |c_~#m~0.base|) v_prenex_223) 0)) (not (= (+ (select (select .cse1 v_prenex_220) 0) 1) 0)) (not (= .cse2 (select .cse3 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| .cse4)) v_prenex_220 v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse2 (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|)))))) (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_225 Int) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse7 (select .cse10 |c_~#top~0.offset|)) (.cse6 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224)) (.cse8 (let ((.cse9 (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse9 v_prenex_225 (store (select .cse9 v_prenex_225) 0 1))))) (or (not (= (+ (select (select .cse6 v_prenex_226) 0) 1) 0)) (= .cse7 (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= .cse7 (select (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select .cse6 |c_~#m~0.base|) v_prenex_229) 0)) (not (= (select (select (store .cse8 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) (forall ((v_prenex_235 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse17 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse16 (store .cse14 |c_~#top~0.base| (store .cse17 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse15 (store (select .cse16 v_prenex_231) 0 1))) (let ((.cse11 (select .cse17 |c_~#top~0.offset|)) (.cse13 (select (store .cse16 v_prenex_231 .cse15) |c_~#top~0.base|)) (.cse12 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230))) (or (not (= .cse11 (select (select .cse12 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= .cse11 (select .cse13 |c_~#top~0.offset|))) (not (= (select (select (store (store (store .cse14 v_prenex_231 .cse15) |c_~#top~0.base| (store .cse13 |c_~#top~0.offset| .cse4)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse12 |c_~#m~0.base|) v_prenex_235) 0)) (not (= (+ (select (select .cse12 v_prenex_232) 0) 1) 0)))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2844 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse19 (select (select .cse21 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse18 (store .cse21 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46)) (.cse20 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847))) (or (= (select (select .cse18 |c_~#top~0.base|) |c_~#top~0.offset|) .cse19) (= (select (select .cse20 |c_~#top~0.base|) |c_~#top~0.offset|) .cse19) (not (= (+ 1 (select (select .cse20 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0)) 0)) (not (= (select (select (store .cse18 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse20 |c_~#m~0.base|) |~#m~0.offset|) 0)))))))) (or (and (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse22 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse22 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse22 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse27 (select .cse26 |c_~#top~0.base|))) (let ((.cse23 (select .cse27 |c_~#top~0.offset|))) (or (not (= (select (select .cse22 |c_~#top~0.base|) |c_~#top~0.offset|) .cse23)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse24 (let ((.cse25 (store .cse26 |c_~#top~0.base| (store .cse27 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse25 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse25 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) 0 1))))) (or (= .cse23 (select (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset|)) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse24 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse28 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse28 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse28 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse29 (select (select .cse32 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse28 |c_~#top~0.base|) |c_~#top~0.offset|) .cse29) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse30 (store .cse32 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse31 (select .cse30 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse30 |c_~#top~0.base| (store .cse31 |c_~#top~0.offset| .cse4)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse31 |c_~#top~0.offset|) .cse29))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse33 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse33 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse33 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse34 (select (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse33 |c_~#top~0.base|) |c_~#top~0.offset|) .cse34) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse35 (store .cse36 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse35 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|) .cse34))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse37 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse37 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse43 (select .cse39 |c_~#top~0.base|))) (let ((.cse38 (select .cse43 |c_~#top~0.offset|))) (or (not (= (select (select .cse37 |c_~#top~0.base|) |c_~#top~0.offset|) .cse38)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse42 (store .cse39 |c_~#top~0.base| (store .cse43 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse40 (store (select .cse42 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) 0 1))) (let ((.cse41 (select (store .cse42 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base|))) (or (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse39 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base| (store .cse41 |c_~#top~0.offset| .cse4)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= .cse38 (select .cse41 |c_~#top~0.offset|))))))))))))))) (not (= (select (select .cse37 |c_~#m~0.base|) |~#m~0.offset|) 0)))))) .cse0))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-08-27 01:49:56,453 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~next_alloc_idx~0 2)) (.cse0 (= c_~state~0 0))) (and (or (not .cse0) (and (forall ((v_prenex_218 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221))) (let ((.cse3 (select (store .cse5 v_prenex_219 v_prenex_222) |c_~#top~0.base|)) (.cse2 (select (select .cse5 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse1 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (or (not (= (select (select .cse1 |c_~#m~0.base|) v_prenex_223) 0)) (not (= (+ (select (select .cse1 v_prenex_220) 0) 1) 0)) (not (= .cse2 (select .cse3 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| .cse4)) v_prenex_220 v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse2 (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|)))))) (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_225 Int) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse7 (select .cse10 |c_~#top~0.offset|)) (.cse6 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224)) (.cse8 (let ((.cse9 (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse9 v_prenex_225 (store (select .cse9 v_prenex_225) 0 1))))) (or (not (= (+ (select (select .cse6 v_prenex_226) 0) 1) 0)) (= .cse7 (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= .cse7 (select (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select .cse6 |c_~#m~0.base|) v_prenex_229) 0)) (not (= (select (select (store .cse8 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) (forall ((v_prenex_235 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse17 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse16 (store .cse14 |c_~#top~0.base| (store .cse17 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse15 (store (select .cse16 v_prenex_231) 0 1))) (let ((.cse11 (select .cse17 |c_~#top~0.offset|)) (.cse13 (select (store .cse16 v_prenex_231 .cse15) |c_~#top~0.base|)) (.cse12 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230))) (or (not (= .cse11 (select (select .cse12 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= .cse11 (select .cse13 |c_~#top~0.offset|))) (not (= (select (select (store (store (store .cse14 v_prenex_231 .cse15) |c_~#top~0.base| (store .cse13 |c_~#top~0.offset| .cse4)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse12 |c_~#m~0.base|) v_prenex_235) 0)) (not (= (+ (select (select .cse12 v_prenex_232) 0) 1) 0)))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2844 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse19 (select (select .cse21 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse18 (store .cse21 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46)) (.cse20 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847))) (or (= (select (select .cse18 |c_~#top~0.base|) |c_~#top~0.offset|) .cse19) (= (select (select .cse20 |c_~#top~0.base|) |c_~#top~0.offset|) .cse19) (not (= (+ 1 (select (select .cse20 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0)) 0)) (not (= (select (select (store .cse18 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse20 |c_~#m~0.base|) |~#m~0.offset|) 0)))))))) (or (and (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse22 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse22 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse22 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse27 (select .cse26 |c_~#top~0.base|))) (let ((.cse23 (select .cse27 |c_~#top~0.offset|))) (or (not (= (select (select .cse22 |c_~#top~0.base|) |c_~#top~0.offset|) .cse23)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse24 (let ((.cse25 (store .cse26 |c_~#top~0.base| (store .cse27 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse25 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse25 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) 0 1))))) (or (= .cse23 (select (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset|)) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse24 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse28 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse28 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse28 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse29 (select (select .cse32 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse28 |c_~#top~0.base|) |c_~#top~0.offset|) .cse29) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse30 (store .cse32 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse31 (select .cse30 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse30 |c_~#top~0.base| (store .cse31 |c_~#top~0.offset| .cse4)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse31 |c_~#top~0.offset|) .cse29))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse33 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse33 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse33 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse34 (select (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse33 |c_~#top~0.base|) |c_~#top~0.offset|) .cse34) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse35 (store .cse36 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse35 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|) .cse34))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse37 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse37 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse43 (select .cse39 |c_~#top~0.base|))) (let ((.cse38 (select .cse43 |c_~#top~0.offset|))) (or (not (= (select (select .cse37 |c_~#top~0.base|) |c_~#top~0.offset|) .cse38)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse42 (store .cse39 |c_~#top~0.base| (store .cse43 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse40 (store (select .cse42 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) 0 1))) (let ((.cse41 (select (store .cse42 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base|))) (or (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse39 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base| (store .cse41 |c_~#top~0.offset| .cse4)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= .cse38 (select .cse41 |c_~#top~0.offset|))))))))))))))) (not (= (select (select .cse37 |c_~#m~0.base|) |~#m~0.offset|) 0)))))) .cse0))) is different from false [2024-08-27 01:49:57,379 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse52 (select |c_#memory_int| |c_~#top~0.base|)) (.cse53 (= c_~state~0 0))) (let ((.cse1 (not .cse53)) (.cse7 (+ c_~next_alloc_idx~0 2)) (.cse0 (= |c_thr1Thread1of3ForFork0_push_~oldTop~0#1| (select .cse52 |c_~#top~0.offset|)))) (and (or (not .cse0) (and (or .cse1 (and (forall ((v_prenex_235 Int) (v_prenex_370 (Array Int Int)) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_prenex_369 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse5 (store (store .cse8 |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse10 (select (store (store (store .cse8 |c_~#top~0.base| v_prenex_370) |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse9 (store .cse5 |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse6 (store (select .cse9 v_prenex_231) 0 1))) (let ((.cse2 (select .cse10 |c_~#top~0.offset|)) (.cse3 (select (store .cse9 v_prenex_231 .cse6) |c_~#top~0.base|)) (.cse4 (store (store (store .cse8 |c_~#m~0.base| v_prenex_369) |c_~#top~0.base| v_prenex_370) |c_~#m2~0.base| v_prenex_230))) (or (not (= .cse2 (select .cse3 |c_~#top~0.offset|))) (not (= .cse2 (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select (store (store (store .cse5 v_prenex_231 .cse6) |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| .cse7)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse4 |c_~#m~0.base|) v_prenex_235) 0)) (not (= (+ (select (select .cse4 v_prenex_232) 0) 1) 0))))))))) (forall ((v_prenex_378 Int) (v_prenex_376 Int) (v_prenex_377 Int) (v_prenex_371 (Array Int Int)) (v_prenex_373 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_375 (Array Int Int)) (v_prenex_365 (Array Int Int)) (v_prenex_366 (Array Int Int)) (v_prenex_379 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse15 (store (store (store .cse14 |c_~#top~0.base| v_prenex_366) |c_~#m2~0.base| v_prenex_371) |c_~#m~0.base| v_prenex_379))) (let ((.cse12 (select (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse11 (store .cse15 v_prenex_378 v_prenex_375)) (.cse13 (store (store (store .cse14 |c_~#m~0.base| v_prenex_365) |c_~#top~0.base| v_prenex_366) |c_~#m2~0.base| v_prenex_371))) (or (not (= (select (select (store .cse11 v_prenex_377 v_prenex_373) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse12 (select (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset|)) (= .cse12 (select (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select .cse13 |c_~#m~0.base|) v_prenex_376) 0)) (not (= (+ 1 (select (select .cse13 v_prenex_377) 0)) 0))))))) (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_prenex_225 Int) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_224 (Array Int Int)) (v_prenex_367 (Array Int Int)) (v_prenex_368 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int)) (let ((.cse20 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse19 (select (store (store (store .cse20 |c_~#top~0.base| v_prenex_368) |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse16 (let ((.cse21 (store (store (store .cse20 |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse19 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse21 v_prenex_225 (store (select .cse21 v_prenex_225) 0 1)))) (.cse17 (store (store (store .cse20 |c_~#m~0.base| v_prenex_367) |c_~#top~0.base| v_prenex_368) |c_~#m2~0.base| v_prenex_224)) (.cse18 (select .cse19 |c_~#top~0.offset|))) (or (not (= (select (select (store .cse16 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse17 |c_~#m~0.base|) v_prenex_229) 0)) (not (= (+ (select (select .cse17 v_prenex_226) 0) 1) 0)) (= (select (select .cse16 |c_~#top~0.base|) |c_~#top~0.offset|) .cse18) (not (= (select (select .cse17 |c_~#top~0.base|) |c_~#top~0.offset|) .cse18))))))) (forall ((v_prenex_218 (Array Int Int)) (v_prenex_223 Int) (v_prenex_372 (Array Int Int)) (v_prenex_220 Int) (v_prenex_374 (Array Int Int)) (v_prenex_221 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse26 (store (store (store .cse24 |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221))) (let ((.cse22 (store (store (store .cse24 |c_~#m~0.base| v_prenex_372) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218)) (.cse23 (select (select .cse26 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse25 (select (store .cse26 v_prenex_219 v_prenex_222) |c_~#top~0.base|))) (or (not (= 0 (select (select .cse22 |c_~#m~0.base|) v_prenex_223))) (= .cse23 (select (select .cse22 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select (store (store (store (store (store .cse24 |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse25 |c_~#top~0.offset| .cse7)) v_prenex_220 v_prenex_374) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select .cse22 v_prenex_220) 0) 1) 0)) (not (= .cse23 (select .cse25 |c_~#top~0.offset|)))))))))) (or (let ((.cse33 (store |c_#memory_int| |c_~#top~0.base| (store .cse52 |c_~#top~0.offset| |c_thr1Thread1of3ForFork0_push_~newTop~0#1|)))) (and (forall ((v_prenex_359 Int) (v_prenex_361 (Array Int Int)) (v_prenex_362 (Array Int Int)) (v_prenex_364 Int) (v_prenex_363 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_360 Int) (v_prenex_358 (Array Int Int))) (let ((.cse30 (store .cse33 |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse32 (select (store (store .cse30 |c_~#m2~0.base| v_prenex_358) |c_~#m~0.base| v_prenex_363) |c_~#top~0.base|))) (let ((.cse28 (select .cse32 |c_~#top~0.offset|)) (.cse29 (let ((.cse31 (store (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_~#m2~0.base| v_prenex_358) |c_~#m~0.base| v_prenex_363) |c_~#top~0.base| (store .cse32 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse31 v_prenex_359 (store (select .cse31 v_prenex_359) 0 1)))) (.cse27 (store (store .cse30 |c_~#m~0.base| v_prenex_361) |c_~#m2~0.base| v_prenex_358))) (or (not (= (+ (select (select .cse27 v_prenex_360) 0) 1) 0)) (not (= .cse28 (select (select .cse27 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select (store .cse29 v_prenex_360 v_prenex_362) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse28 (select (select .cse29 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select .cse27 |c_~#m~0.base|) v_prenex_364) 0))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2844 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse41 (store .cse33 |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse37 (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849)) (.cse40 (select (store (store .cse41 |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849) |c_~#top~0.base|))) (let ((.cse39 (store .cse37 |c_~#top~0.base| (store .cse40 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse38 (store (select .cse39 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) 0 1))) (let ((.cse34 (store (store .cse41 |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847)) (.cse35 (select .cse40 |c_~#top~0.offset|)) (.cse36 (select (store .cse39 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse38) |c_~#top~0.base|))) (or (not (= 0 (select (select .cse34 |c_~#m~0.base|) |~#m~0.offset|))) (not (= (+ (select (select .cse34 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (not (= .cse35 (select .cse36 |c_~#top~0.offset|))) (not (= (select (select .cse34 |c_~#top~0.base|) |c_~#top~0.offset|) .cse35)) (not (= (select (select (store (store (store .cse37 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse38) |c_~#top~0.base| (store .cse36 |c_~#top~0.offset| .cse7)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))) (forall ((v_prenex_357 Int) (v_prenex_352 Int) (v_prenex_353 Int) (v_prenex_351 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_354 (Array Int Int)) (v_prenex_355 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_prenex_356 (Array Int Int))) (let ((.cse45 (store .cse33 |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse46 (store (store .cse45 |c_~#m2~0.base| v_prenex_351) |c_~#m~0.base| v_prenex_355))) (let ((.cse42 (store .cse46 v_prenex_352 v_prenex_356)) (.cse44 (select (select .cse46 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse43 (store (store .cse45 |c_~#m~0.base| v_prenex_354) |c_~#m2~0.base| v_prenex_351))) (or (not (= (select (select (store .cse42 v_prenex_353 v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse43 |c_~#top~0.base|) |c_~#top~0.offset|) .cse44) (not (= 0 (select (select .cse43 |c_~#m~0.base|) v_prenex_357))) (= (select (select .cse42 |c_~#top~0.base|) |c_~#top~0.offset|) .cse44) (not (= (+ (select (select .cse43 v_prenex_353) 0) 1) 0))))))) (forall ((v_prenex_349 (Array Int Int)) (v_prenex_345 Int) (v_prenex_346 Int) (v_prenex_350 Int) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_344 (Array Int Int)) (v_prenex_347 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_prenex_348 (Array Int Int))) (let ((.cse51 (store .cse33 |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse50 (store (store .cse51 |c_~#m2~0.base| v_prenex_344) |c_~#m~0.base| v_prenex_349))) (let ((.cse49 (select (store .cse50 v_prenex_345 v_DerPreprocessor_46) |c_~#top~0.base|)) (.cse47 (store (store .cse51 |c_~#m~0.base| v_prenex_347) |c_~#m2~0.base| v_prenex_344)) (.cse48 (select (select .cse50 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (not (= (+ (select (select .cse47 v_prenex_346) 0) 1) 0)) (not (= .cse48 (select .cse49 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_~#m2~0.base| v_prenex_344) |c_~#m~0.base| v_prenex_349) v_prenex_345 v_DerPreprocessor_46) |c_~#top~0.base| (store .cse49 |c_~#top~0.offset| .cse7)) v_prenex_346 v_prenex_348) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse47 |c_~#m~0.base|) v_prenex_350) 0)) (= (select (select .cse47 |c_~#top~0.base|) |c_~#top~0.offset|) .cse48)))))))) .cse53))) (or (and (or (and (forall ((v_prenex_339 (Array Int Int)) (v_prenex_329 (Array Int Int)) (v_prenex_341 Int) (v_prenex_342 Int) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_330 (Array Int Int)) (v_prenex_340 Int) (v_prenex_343 (Array Int Int)) (v_prenex_335 (Array Int Int)) (v_prenex_337 (Array Int Int))) (let ((.cse58 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse57 (store (store (store .cse58 |c_~#top~0.base| v_prenex_330) |c_~#m2~0.base| v_prenex_335) |c_~#m~0.base| v_prenex_343))) (let ((.cse55 (select (select .cse57 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse54 (store (store (store .cse58 |c_~#m~0.base| v_prenex_329) |c_~#top~0.base| v_prenex_330) |c_~#m2~0.base| v_prenex_335)) (.cse56 (store .cse57 v_prenex_342 v_prenex_339))) (or (not (= (+ (select (select .cse54 v_prenex_341) 0) 1) 0)) (= .cse55 (select (select .cse56 |c_~#top~0.base|) |c_~#top~0.offset|)) (= .cse55 (select (select .cse54 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select .cse54 |c_~#m~0.base|) v_prenex_340) 0)) (not (= (select (select (store .cse56 v_prenex_341 v_prenex_337) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))) (forall ((v_prenex_235 Int) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_prenex_333 (Array Int Int)) (v_prenex_334 (Array Int Int))) (let ((.cse64 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse61 (store (store .cse64 |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse65 (select (store (store (store .cse64 |c_~#top~0.base| v_prenex_334) |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse66 (store .cse61 |c_~#top~0.base| (store .cse65 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse62 (store (select .cse66 v_prenex_231) 0 1))) (let ((.cse63 (select (store .cse66 v_prenex_231 .cse62) |c_~#top~0.base|)) (.cse60 (select .cse65 |c_~#top~0.offset|)) (.cse59 (store (store (store .cse64 |c_~#m~0.base| v_prenex_333) |c_~#top~0.base| v_prenex_334) |c_~#m2~0.base| v_prenex_230))) (or (not (= (select (select .cse59 |c_~#top~0.base|) |c_~#top~0.offset|) .cse60)) (not (= (select (select .cse59 |c_~#m~0.base|) v_prenex_235) 0)) (not (= (select (select (store (store (store .cse61 v_prenex_231 .cse62) |c_~#top~0.base| (store .cse63 |c_~#top~0.offset| .cse7)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse63 |c_~#top~0.offset|) .cse60)) (not (= (+ (select (select .cse59 v_prenex_232) 0) 1) 0))))))))) (forall ((v_prenex_338 (Array Int Int)) (v_prenex_218 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_prenex_336 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse70 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse71 (store (store (store .cse70 |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221))) (let ((.cse67 (select (select .cse71 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse69 (select (store .cse71 v_prenex_219 v_prenex_222) |c_~#top~0.base|)) (.cse68 (store (store (store .cse70 |c_~#m~0.base| v_prenex_336) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (or (= .cse67 (select (select .cse68 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select .cse69 |c_~#top~0.offset|) .cse67)) (not (= (select (select (store (store (store (store (store .cse70 |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse69 |c_~#top~0.offset| .cse7)) v_prenex_220 v_prenex_338) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse68 |c_~#m~0.base|) v_prenex_223) 0)) (not (= (+ (select (select .cse68 v_prenex_220) 0) 1) 0))))))) (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_prenex_225 Int) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_331 (Array Int Int)) (v_prenex_332 (Array Int Int)) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int)) (let ((.cse75 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse77 (select (store (store (store .cse75 |c_~#top~0.base| v_prenex_332) |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse73 (select .cse77 |c_~#top~0.offset|)) (.cse74 (let ((.cse76 (store (store (store .cse75 |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse77 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse76 v_prenex_225 (store (select .cse76 v_prenex_225) 0 1)))) (.cse72 (store (store (store .cse75 |c_~#m~0.base| v_prenex_331) |c_~#top~0.base| v_prenex_332) |c_~#m2~0.base| v_prenex_224))) (or (not (= (select (select .cse72 |c_~#top~0.base|) |c_~#top~0.offset|) .cse73)) (= (select (select .cse74 |c_~#top~0.base|) |c_~#top~0.offset|) .cse73) (not (= (select (select (store .cse74 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select .cse72 v_prenex_226) 0) 1) 0)) (not (= (select (select .cse72 |c_~#m~0.base|) v_prenex_229) 0)))))))) .cse1) (or .cse53 (and (forall ((v_prenex_318 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_321 Int) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_prenex_316 Int) (v_prenex_315 (Array Int Int)) (v_prenex_317 Int)) (let ((.cse82 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse81 (store (store .cse82 |c_~#m2~0.base| v_prenex_315) |c_~#m~0.base| v_prenex_319))) (let ((.cse79 (store .cse81 v_prenex_316 v_prenex_320)) (.cse78 (store (store .cse82 |c_~#m~0.base| v_prenex_318) |c_~#m2~0.base| v_prenex_315)) (.cse80 (select (select .cse81 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (not (= (select (select .cse78 |c_~#m~0.base|) v_prenex_321) 0)) (not (= (select (select (store .cse79 v_prenex_317 v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select .cse78 v_prenex_317) 0) 1) 0)) (= (select (select .cse79 |c_~#top~0.base|) |c_~#top~0.offset|) .cse80) (= (select (select .cse78 |c_~#top~0.base|) |c_~#top~0.offset|) .cse80)))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2844 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse90 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse85 (store (store .cse90 |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse89 (select .cse85 |c_~#top~0.base|))) (let ((.cse88 (store .cse85 |c_~#top~0.base| (store .cse89 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse86 (store (select .cse88 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) 0 1))) (let ((.cse83 (store (store .cse90 |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847)) (.cse84 (select .cse89 |c_~#top~0.offset|)) (.cse87 (select (store .cse88 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse86) |c_~#top~0.base|))) (or (not (= (select (select .cse83 |c_~#top~0.base|) |c_~#top~0.offset|) .cse84)) (not (= 0 (+ (select (select .cse83 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1))) (not (= (select (select .cse83 |c_~#m~0.base|) |~#m~0.offset|) 0)) (not (= (select (select (store (store (store .cse85 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse86) |c_~#top~0.base| (store .cse87 |c_~#top~0.offset| .cse7)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse84 (select .cse87 |c_~#top~0.offset|))))))))))) (forall ((v_prenex_327 (Array Int Int)) (v_prenex_323 Int) (v_prenex_324 Int) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_322 (Array Int Int)) (v_prenex_325 (Array Int Int)) (v_prenex_326 (Array Int Int)) (v_prenex_328 Int)) (let ((.cse97 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse95 (store (store .cse97 |c_~#m2~0.base| v_prenex_322) |c_~#m~0.base| v_prenex_327))) (let ((.cse96 (select .cse95 |c_~#top~0.base|))) (let ((.cse93 (select .cse96 |c_~#top~0.offset|)) (.cse91 (store (store .cse97 |c_~#m~0.base| v_prenex_325) |c_~#m2~0.base| v_prenex_322)) (.cse92 (let ((.cse94 (store .cse95 |c_~#top~0.base| (store .cse96 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse94 v_prenex_323 (store (select .cse94 v_prenex_323) 0 1))))) (or (not (= (+ (select (select .cse91 v_prenex_324) 0) 1) 0)) (= (select (select .cse92 |c_~#top~0.base|) |c_~#top~0.offset|) .cse93) (not (= .cse93 (select (select .cse91 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select .cse91 |c_~#m~0.base|) v_prenex_328) 0)) (not (= (select (select (store .cse92 v_prenex_324 v_prenex_326) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))) (forall ((v_prenex_314 Int) (v_prenex_308 (Array Int Int)) (v_prenex_310 Int) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_309 Int) (v_prenex_311 (Array Int Int)) (v_prenex_312 (Array Int Int)) (v_prenex_313 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse102 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse103 (store (store .cse102 |c_~#m2~0.base| v_prenex_308) |c_~#m~0.base| v_prenex_313))) (let ((.cse100 (store .cse103 v_prenex_309 v_DerPreprocessor_46))) (let ((.cse101 (select .cse100 |c_~#top~0.base|)) (.cse99 (select (select .cse103 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse98 (store (store .cse102 |c_~#m~0.base| v_prenex_311) |c_~#m2~0.base| v_prenex_308))) (or (not (= (+ (select (select .cse98 v_prenex_310) 0) 1) 0)) (= (select (select .cse98 |c_~#top~0.base|) |c_~#top~0.offset|) .cse99) (not (= (select (select (store (store .cse100 |c_~#top~0.base| (store .cse101 |c_~#top~0.offset| .cse7)) v_prenex_310 v_prenex_312) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse101 |c_~#top~0.offset|) .cse99)) (not (= (select (select .cse98 |c_~#m~0.base|) v_prenex_314) 0))))))))))) .cse0)))) is different from false [2024-08-27 01:49:58,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:49:58,025 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 333724 treesize of output 333012 [2024-08-27 01:49:58,283 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 3438 treesize of output 3338 [2024-08-27 01:49:58,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:49:58,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3686 treesize of output 3640 [2024-08-27 01:49:58,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:49:58,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3632 treesize of output 3596 [2024-08-27 01:49:58,432 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 2006 treesize of output 1878 [2024-08-27 01:49:58,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:49:58,485 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 303 treesize of output 305 [2024-08-27 01:49:58,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 248 [2024-08-27 01:49:58,777 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 90 treesize of output 88 [2024-08-27 01:50:02,746 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2024-08-27 01:50:02,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 8535 treesize of output 7243 [2024-08-27 01:50:02,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:02,804 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 5969 treesize of output 5869 [2024-08-27 01:50:02,874 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 2853 treesize of output 2653 [2024-08-27 01:50:02,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:02,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2937 treesize of output 2851 [2024-08-27 01:50:02,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:02,972 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 2805 treesize of output 2763 [2024-08-27 01:50:03,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:03,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 211 treesize of output 225 [2024-08-27 01:50:03,098 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 502 treesize of output 470 [2024-08-27 01:50:13,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:13,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 957 treesize of output 960 [2024-08-27 01:50:13,354 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 6 treesize of output 4 [2024-08-27 01:50:13,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:13,367 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 930 treesize of output 932 [2024-08-27 01:50:14,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:14,642 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 177 treesize of output 129 [2024-08-27 01:50:14,684 INFO L349 Elim1Store]: treesize reduction 3, result has 72.7 percent of original size [2024-08-27 01:50:14,685 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 146437 treesize of output 142209 [2024-08-27 01:50:14,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:50:14,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:14,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 212 treesize of output 210 [2024-08-27 01:50:14,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:50:14,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:14,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 202 treesize of output 196 [2024-08-27 01:50:14,779 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 120 treesize of output 118 [2024-08-27 01:50:14,791 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 107 treesize of output 91 [2024-08-27 01:50:14,805 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 168 treesize of output 152 [2024-08-27 01:50:14,815 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 110 treesize of output 102 [2024-08-27 01:50:15,025 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-27 01:50:15,030 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-27 01:50:15,030 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 169 treesize of output 1 [2024-08-27 01:50:15,035 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-27 01:50:15,066 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2024-08-27 01:50:15,066 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 7122 treesize of output 6210 [2024-08-27 01:50:15,127 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-27 01:50:15,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:15,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 6454 treesize of output 6282 [2024-08-27 01:50:15,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:15,338 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 2386 treesize of output 2344 [2024-08-27 01:50:15,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:15,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2390 treesize of output 2308 [2024-08-27 01:50:15,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:15,475 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 147 [2024-08-27 01:50:15,539 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 942 treesize of output 910 [2024-08-27 01:50:17,149 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 1327 treesize of output 1325 [2024-08-27 01:50:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-08-27 01:50:20,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619048021] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:50:20,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:50:20,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 26] total 77 [2024-08-27 01:50:20,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356213909] [2024-08-27 01:50:20,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:50:20,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2024-08-27 01:50:20,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:50:20,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2024-08-27 01:50:20,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=4138, Unknown=57, NotChecked=1540, Total=6006 [2024-08-27 01:50:20,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:50:20,992 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:50:20,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 3.0128205128205128) internal successors, (235), 77 states have internal predecessors, (235), 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-27 01:50:20,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:50:20,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:50:20,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:50:20,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:50:20,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:50:20,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:50:20,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:50:20,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:50:20,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:50:20,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:50:20,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:50:20,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-08-27 01:50:20,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-08-27 01:50:20,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2024-08-27 01:50:20,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:50:20,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:50:20,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-27 01:50:20,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-08-27 01:50:20,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-08-27 01:50:20,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:50:24,493 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-27 01:50:58,689 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-27 01:51:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:51:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:51:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:51:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:51:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:51:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:51:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:51:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:51:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:51:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:51:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:51:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-08-27 01:51:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-08-27 01:51:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-08-27 01:51:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:51:22,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:51:22,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-27 01:51:22,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-08-27 01:51:22,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-08-27 01:51:22,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-08-27 01:51:23,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-08-27 01:51:23,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:51:23,196 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:51:23,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:51:23,196 INFO L85 PathProgramCache]: Analyzing trace with hash 92829193, now seen corresponding path program 1 times [2024-08-27 01:51:23,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:51:23,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359478965] [2024-08-27 01:51:23,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:51:23,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:51:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:51:24,402 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 01:51:24,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:51:24,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359478965] [2024-08-27 01:51:24,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359478965] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:51:24,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915755649] [2024-08-27 01:51:24,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:51:24,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:51:24,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:51:24,404 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-27 01:51:24,405 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-27 01:51:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:51:24,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 53 conjunts are in the unsatisfiable core [2024-08-27 01:51:24,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:51:25,078 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-08-27 01:51:25,078 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 25 treesize of output 22 [2024-08-27 01:51:25,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-08-27 01:51:25,221 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 01:51:25,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-08-27 01:51:25,293 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-27 01:51:25,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:51:25,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:51:25,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:51:25,551 INFO L349 Elim1Store]: treesize reduction 36, result has 21.7 percent of original size [2024-08-27 01:51:25,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 42 [2024-08-27 01:51:25,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:51:25,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:51:25,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:51:25,664 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-08-27 01:51:25,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 40 [2024-08-27 01:51:25,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:51:25,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:51:25,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:51:25,977 INFO L349 Elim1Store]: treesize reduction 28, result has 39.1 percent of original size [2024-08-27 01:51:25,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 50 [2024-08-27 01:51:25,984 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-27 01:51:26,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:26,007 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 13 treesize of output 17 [2024-08-27 01:51:26,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:51:26,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:51:26,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:51:26,052 INFO L349 Elim1Store]: treesize reduction 61, result has 4.7 percent of original size [2024-08-27 01:51:26,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 36 [2024-08-27 01:51:26,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-27 01:51:26,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:51:26,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:51:26,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:51:26,391 INFO L349 Elim1Store]: treesize reduction 168, result has 21.5 percent of original size [2024-08-27 01:51:26,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 117 treesize of output 187 [2024-08-27 01:51:26,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 8 treesize of output 7 [2024-08-27 01:51:26,502 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 8 treesize of output 7 [2024-08-27 01:51:26,517 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 8 treesize of output 7 [2024-08-27 01:51:26,597 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-08-27 01:51:26,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 33 [2024-08-27 01:51:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:51:26,864 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:51:28,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:28,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 204 [2024-08-27 01:51:28,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:28,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 102 [2024-08-27 01:51:35,315 INFO L349 Elim1Store]: treesize reduction 195, result has 83.8 percent of original size [2024-08-27 01:51:35,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 14 new quantified variables, introduced 92 case distinctions, treesize of input 933 treesize of output 1651 [2024-08-27 01:51:36,096 INFO L349 Elim1Store]: treesize reduction 775, result has 15.0 percent of original size [2024-08-27 01:51:36,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 7743 treesize of output 7547 [2024-08-27 01:51:36,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:36,745 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 1248 treesize of output 1249 [2024-08-27 01:51:36,892 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 1240 treesize of output 1232 [2024-08-27 01:51:37,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:37,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1232 treesize of output 1247 [2024-08-27 01:51:37,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:37,240 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 1222 treesize of output 1213 [2024-08-27 01:51:37,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:37,415 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 1204 treesize of output 1205 [2024-08-27 01:51:37,595 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 1196 treesize of output 1192 [2024-08-27 01:51:37,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:37,773 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 1192 treesize of output 1191 [2024-08-27 01:51:37,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:37,955 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 1182 treesize of output 1185 [2024-08-27 01:51:38,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:38,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1176 treesize of output 1191 [2024-08-27 01:51:38,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:38,330 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 1166 treesize of output 1167 [2024-08-27 01:51:38,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:38,516 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 1158 treesize of output 1161 [2024-08-27 01:51:38,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:38,704 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 1152 treesize of output 1155 [2024-08-27 01:51:38,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:38,912 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 1146 treesize of output 1147 [2024-08-27 01:51:39,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:39,097 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 1138 treesize of output 1141 [2024-08-27 01:51:39,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:39,289 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 1132 treesize of output 1135 [2024-08-27 01:51:39,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:39,488 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 1126 treesize of output 1125 [2024-08-27 01:51:39,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:39,686 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 1116 treesize of output 1117 [2024-08-27 01:51:39,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:39,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1108 treesize of output 1123 [2024-08-27 01:51:40,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:40,130 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 1098 treesize of output 1097 [2024-08-27 01:51:40,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:51:40,340 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 1088 treesize of output 1089 [2024-08-27 01:53:36,273 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-08-27 01:53:36,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-08-27 01:53:36,274 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-08-27 01:53:36,289 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-27 01:53:36,474 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,SelfDestructingSolverStorable34 [2024-08-27 01:53:36,475 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:287) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:519) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:609) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2024-08-27 01:53:36,480 INFO L158 Benchmark]: Toolchain (without parser) took 360067.90ms. Allocated memory was 176.2MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 116.0MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-08-27 01:53:36,480 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 176.2MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-27 01:53:36,480 INFO L158 Benchmark]: Witness Parser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-27 01:53:36,481 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.15ms. Allocated memory is still 176.2MB. Free memory was 116.0MB in the beginning and 91.4MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-08-27 01:53:36,481 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.14ms. Allocated memory is still 176.2MB. Free memory was 91.4MB in the beginning and 88.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-08-27 01:53:36,481 INFO L158 Benchmark]: Boogie Preprocessor took 32.84ms. Allocated memory is still 176.2MB. Free memory was 88.7MB in the beginning and 87.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-27 01:53:36,481 INFO L158 Benchmark]: RCFGBuilder took 787.80ms. Allocated memory was 176.2MB in the beginning and 251.7MB in the end (delta: 75.5MB). Free memory was 87.1MB in the beginning and 184.1MB in the end (delta: -96.9MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2024-08-27 01:53:36,481 INFO L158 Benchmark]: TraceAbstraction took 358604.49ms. Allocated memory was 251.7MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 183.0MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-08-27 01:53:36,482 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 176.2MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.15ms. Allocated memory is still 176.2MB. Free memory was 116.0MB in the beginning and 91.4MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.14ms. Allocated memory is still 176.2MB. Free memory was 91.4MB in the beginning and 88.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.84ms. Allocated memory is still 176.2MB. Free memory was 88.7MB in the beginning and 87.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 787.80ms. Allocated memory was 176.2MB in the beginning and 251.7MB in the end (delta: 75.5MB). Free memory was 87.1MB in the beginning and 184.1MB in the end (delta: -96.9MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * TraceAbstraction took 358604.49ms. Allocated memory was 251.7MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 183.0MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 639, independent: 567, independent conditional: 173, independent unconditional: 394, dependent: 72, dependent conditional: 54, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 173, independent unconditional: 394, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 173, independent unconditional: 394, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 585, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 301, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 301, independent: 272, independent conditional: 0, independent unconditional: 272, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 29, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 164, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 585, independent: 284, independent conditional: 0, independent unconditional: 284, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 301, unknown conditional: 0, unknown unconditional: 301] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 283, Positive conditional cache size: 0, Positive unconditional cache size: 283, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 54 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 74, Number of trivial persistent sets: 62, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 412, independent: 394, independent conditional: 0, independent unconditional: 394, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 639, independent: 567, independent conditional: 173, independent unconditional: 394, dependent: 72, dependent conditional: 54, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 173, independent unconditional: 394, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 173, independent unconditional: 394, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 585, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 301, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 301, independent: 272, independent conditional: 0, independent unconditional: 272, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 29, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 164, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 585, independent: 284, independent conditional: 0, independent unconditional: 284, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 301, unknown conditional: 0, unknown unconditional: 301] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 283, Positive conditional cache size: 0, Positive unconditional cache size: 283, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 54 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 312, independent: 298, independent conditional: 44, independent unconditional: 254, dependent: 14, dependent conditional: 10, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 44, independent unconditional: 254, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 44, independent unconditional: 254, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 302, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 200, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 200, independent: 190, independent conditional: 0, independent unconditional: 190, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 302, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 200, unknown conditional: 0, unknown unconditional: 200] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 196, Positive conditional cache size: 0, Positive unconditional cache size: 196, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 10 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 20, Number of trivial persistent sets: 18, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 258, independent: 254, independent conditional: 0, independent unconditional: 254, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 312, independent: 298, independent conditional: 44, independent unconditional: 254, dependent: 14, dependent conditional: 10, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 44, independent unconditional: 254, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 44, independent unconditional: 254, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 302, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 200, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 200, independent: 190, independent conditional: 0, independent unconditional: 190, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 302, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 200, unknown conditional: 0, unknown unconditional: 200] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 196, Positive conditional cache size: 0, Positive unconditional cache size: 196, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 10 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2150, independent: 2035, independent conditional: 620, independent unconditional: 1415, dependent: 115, dependent conditional: 72, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2085, independent: 2035, independent conditional: 620, independent unconditional: 1415, dependent: 50, dependent conditional: 7, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2085, independent: 2035, independent conditional: 620, independent unconditional: 1415, dependent: 50, dependent conditional: 7, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2110, independent: 2035, independent conditional: 1, independent unconditional: 2034, dependent: 75, dependent conditional: 24, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2110, independent: 2035, independent conditional: 1, independent unconditional: 2034, dependent: 75, dependent conditional: 14, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2110, independent: 2035, independent conditional: 1, independent unconditional: 2034, dependent: 75, dependent conditional: 14, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1205, independent: 1154, independent conditional: 1, independent unconditional: 1153, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1205, independent: 1108, independent conditional: 0, independent unconditional: 1108, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 97, independent: 46, independent conditional: 1, independent unconditional: 45, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 46, independent conditional: 1, independent unconditional: 45, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 377, independent: 176, independent conditional: 9, independent unconditional: 168, dependent: 200, dependent conditional: 32, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2110, independent: 881, independent conditional: 0, independent unconditional: 881, dependent: 24, dependent conditional: 6, dependent unconditional: 18, unknown: 1205, unknown conditional: 9, unknown unconditional: 1196] , Statistics on independence cache: Total cache size (in pairs): 1205, Positive cache size: 1154, Positive conditional cache size: 1, Positive unconditional cache size: 1153, Negative cache size: 51, Negative conditional cache size: 8, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 5, Independence queries for same thread: 65 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.4s, Number of persistent set computation: 69, Number of trivial persistent sets: 57, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1458, independent: 1415, independent conditional: 0, independent unconditional: 1415, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2150, independent: 2035, independent conditional: 620, independent unconditional: 1415, dependent: 115, dependent conditional: 72, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2085, independent: 2035, independent conditional: 620, independent unconditional: 1415, dependent: 50, dependent conditional: 7, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2085, independent: 2035, independent conditional: 620, independent unconditional: 1415, dependent: 50, dependent conditional: 7, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2110, independent: 2035, independent conditional: 1, independent unconditional: 2034, dependent: 75, dependent conditional: 24, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2110, independent: 2035, independent conditional: 1, independent unconditional: 2034, dependent: 75, dependent conditional: 14, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2110, independent: 2035, independent conditional: 1, independent unconditional: 2034, dependent: 75, dependent conditional: 14, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1205, independent: 1154, independent conditional: 1, independent unconditional: 1153, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1205, independent: 1108, independent conditional: 0, independent unconditional: 1108, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 97, independent: 46, independent conditional: 1, independent unconditional: 45, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 46, independent conditional: 1, independent unconditional: 45, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 377, independent: 176, independent conditional: 9, independent unconditional: 168, dependent: 200, dependent conditional: 32, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2110, independent: 881, independent conditional: 0, independent unconditional: 881, dependent: 24, dependent conditional: 6, dependent unconditional: 18, unknown: 1205, unknown conditional: 9, unknown unconditional: 1196] , Statistics on independence cache: Total cache size (in pairs): 1205, Positive cache size: 1154, Positive conditional cache size: 1, Positive unconditional cache size: 1153, Negative cache size: 51, Negative conditional cache size: 8, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 5, Independence queries for same thread: 65 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-08-27 01:53:36,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Forceful destruction successful, exit code 0 [2024-08-27 01:53:36,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Forceful destruction successful, exit code 0 [2024-08-27 01:53:36,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2024-08-27 01:53:37,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/26_stack_cas_longer-1.i ./goblint.2024-08-20_10-08-36.files/protection-local/26_stack_cas_longer-1.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.goblint-eval-da67795-m [2024-08-27 01:53:39,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-27 01:53:39,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-08-27 01:53:39,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-27 01:53:39,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-27 01:53:39,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-27 01:53:39,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-27 01:53:39,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-27 01:53:39,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-27 01:53:39,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-27 01:53:39,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-27 01:53:39,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-27 01:53:39,583 INFO L153 SettingsManager]: * Use SBE=true [2024-08-27 01:53:39,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-27 01:53:39,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-27 01:53:39,587 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-27 01:53:39,587 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-27 01:53:39,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-27 01:53:39,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-27 01:53:39,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-27 01:53:39,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-27 01:53:39,589 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-27 01:53:39,589 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-27 01:53:39,589 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-27 01:53:39,589 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-27 01:53:39,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-27 01:53:39,590 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-27 01:53:39,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-27 01:53:39,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-27 01:53:39,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-27 01:53:39,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-27 01:53:39,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-27 01:53:39,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-27 01:53:39,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-27 01:53:39,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-27 01:53:39,593 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-27 01:53:39,594 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-27 01:53:39,594 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-27 01:53:39,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-27 01:53:39,595 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-27 01:53:39,596 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-27 01:53:39,596 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-27 01:53:39,596 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-27 01:53:39,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-27 01:53:39,597 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-08-27 01:53:39,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-27 01:53:39,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-27 01:53:39,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-27 01:53:39,946 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-27 01:53:39,947 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-27 01:53:39,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-20_10-08-36.files/protection-local/26_stack_cas_longer-1.yml/witness.yml [2024-08-27 01:53:40,010 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-27 01:53:40,012 INFO L274 PluginConnector]: CDTParser initialized [2024-08-27 01:53:40,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i [2024-08-27 01:53:41,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-27 01:53:41,872 INFO L384 CDTParser]: Found 1 translation units. [2024-08-27 01:53:41,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i [2024-08-27 01:53:41,893 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/95ed19d1e/bfc022c24232456b9d929e92ec1c48fc/FLAG5e73e4ab2 [2024-08-27 01:53:41,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/95ed19d1e/bfc022c24232456b9d929e92ec1c48fc [2024-08-27 01:53:41,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-27 01:53:41,911 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-27 01:53:41,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-27 01:53:41,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-27 01:53:41,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-27 01:53:41,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 01:53:40" (1/2) ... [2024-08-27 01:53:41,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c27a4e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:53:41, skipping insertion in model container [2024-08-27 01:53:41,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 01:53:40" (1/2) ... [2024-08-27 01:53:41,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@801624c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:53:41, skipping insertion in model container [2024-08-27 01:53:41,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 01:53:41" (2/2) ... [2024-08-27 01:53:41,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c27a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:53:41, skipping insertion in model container [2024-08-27 01:53:41,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 01:53:41" (2/2) ... [2024-08-27 01:53:41,924 INFO L85 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-27 01:53:41,951 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-08-27 01:53:41,951 INFO L1541 ArrayList]: Location invariant before [L751-L751] (m == 0 || m == 1) && (m2 == 0 || m2 == 1) [2024-08-27 01:53:42,002 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-27 01:53:42,389 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-27 01:53:42,403 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-08-27 01:53:42,498 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-27 01:53:42,538 INFO L206 MainTranslator]: Completed translation [2024-08-27 01:53:42,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:53:42 WrapperNode [2024-08-27 01:53:42,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-27 01:53:42,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-27 01:53:42,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-27 01:53:42,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-27 01:53:42,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:53:42" (1/1) ... [2024-08-27 01:53:42,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:53:42" (1/1) ... [2024-08-27 01:53:42,591 INFO L138 Inliner]: procedures = 183, calls = 51, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 197 [2024-08-27 01:53:42,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-27 01:53:42,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-27 01:53:42,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-27 01:53:42,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-27 01:53:42,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:53:42" (1/1) ... [2024-08-27 01:53:42,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:53:42" (1/1) ... [2024-08-27 01:53:42,607 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:53:42" (1/1) ... [2024-08-27 01:53:42,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:53:42" (1/1) ... [2024-08-27 01:53:42,622 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:53:42" (1/1) ... [2024-08-27 01:53:42,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:53:42" (1/1) ... [2024-08-27 01:53:42,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:53:42" (1/1) ... [2024-08-27 01:53:42,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:53:42" (1/1) ... [2024-08-27 01:53:42,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-27 01:53:42,638 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-27 01:53:42,638 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-27 01:53:42,641 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-27 01:53:42,643 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:53:42" (1/1) ... [2024-08-27 01:53:42,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-27 01:53:42,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:53:42,675 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-27 01:53:42,678 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-27 01:53:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-08-27 01:53:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-08-27 01:53:42,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-08-27 01:53:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-08-27 01:53:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-27 01:53:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-27 01:53:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-27 01:53:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-08-27 01:53:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-08-27 01:53:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-08-27 01:53:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-08-27 01:53:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-27 01:53:42,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-27 01:53:42,721 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-08-27 01:53:42,865 INFO L242 CfgBuilder]: Building ICFG [2024-08-27 01:53:42,867 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-27 01:53:43,228 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-08-27 01:53:43,228 INFO L291 CfgBuilder]: Performing block encoding [2024-08-27 01:53:43,538 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-27 01:53:43,538 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-08-27 01:53:43,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 01:53:43 BoogieIcfgContainer [2024-08-27 01:53:43,539 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-27 01:53:43,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-27 01:53:43,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-27 01:53:43,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-27 01:53:43,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 01:53:40" (1/4) ... [2024-08-27 01:53:43,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7a7dad and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.08 01:53:43, skipping insertion in model container [2024-08-27 01:53:43,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 01:53:41" (2/4) ... [2024-08-27 01:53:43,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7a7dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 01:53:43, skipping insertion in model container [2024-08-27 01:53:43,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:53:42" (3/4) ... [2024-08-27 01:53:43,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7a7dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 01:53:43, skipping insertion in model container [2024-08-27 01:53:43,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 01:53:43" (4/4) ... [2024-08-27 01:53:43,548 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longer-1.i [2024-08-27 01:53:43,567 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-27 01:53:43,567 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-27 01:53:43,567 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-27 01:53:43,633 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-27 01:53:43,675 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:53:43,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 01:53:43,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:53:43,678 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-27 01:53:43,680 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-27 01:53:43,716 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 01:53:43,727 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-08-27 01:53:43,732 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;@7438a71c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:53:43,733 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-27 01:53:43,893 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:53:43,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:53:43,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1114168855, now seen corresponding path program 1 times [2024-08-27 01:53:43,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:53:43,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044255682] [2024-08-27 01:53:43,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:53:43,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:43,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:53:43,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:53:43,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-08-27 01:53:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:53:44,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2024-08-27 01:53:44,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:53:44,130 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-27 01:53:44,130 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:53:44,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:53:44,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044255682] [2024-08-27 01:53:44,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044255682] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:53:44,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:53:44,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 01:53:44,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642027114] [2024-08-27 01:53:44,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:53:44,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 01:53:44,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:53:44,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 01:53:44,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 01:53:44,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:44,166 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:53:44,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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-27 01:53:44,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:44,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:44,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-08-27 01:53:44,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:44,424 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:53:44,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:53:44,425 INFO L85 PathProgramCache]: Analyzing trace with hash -148017800, now seen corresponding path program 1 times [2024-08-27 01:53:44,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:53:44,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485949496] [2024-08-27 01:53:44,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:53:44,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:44,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:53:44,430 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:53:44,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-08-27 01:53:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:53:44,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2024-08-27 01:53:44,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:53:44,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-27 01:53:44,735 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-27 01:53:44,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-08-27 01:53:44,878 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-27 01:53:44,879 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:53:44,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:53:44,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485949496] [2024-08-27 01:53:44,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485949496] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:53:44,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:53:44,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-27 01:53:44,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16340758] [2024-08-27 01:53:44,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:53:44,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:53:44,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:53:44,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:53:44,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:53:44,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:44,884 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:53:44,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.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-27 01:53:44,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:44,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:44,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:44,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:44,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-08-27 01:53:45,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:45,187 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:53:45,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:53:45,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1592448670, now seen corresponding path program 1 times [2024-08-27 01:53:45,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:53:45,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325925410] [2024-08-27 01:53:45,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:53:45,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:45,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:53:45,194 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:53:45,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-08-27 01:53:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:53:45,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2024-08-27 01:53:45,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:53:45,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-08-27 01:53:45,373 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 8 treesize of output 1 [2024-08-27 01:53:45,393 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-27 01:53:45,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:53:45,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-08-27 01:53:45,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:53:45,445 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:53:45,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:53:45,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325925410] [2024-08-27 01:53:45,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325925410] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:53:45,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:53:45,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 01:53:45,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787588504] [2024-08-27 01:53:45,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:53:45,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:53:45,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:53:45,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:53:45,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:53:45,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:45,448 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:53:45,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-27 01:53:45,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:45,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:45,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:45,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:45,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:45,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-08-27 01:53:45,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:45,835 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:53:45,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:53:45,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1754051290, now seen corresponding path program 1 times [2024-08-27 01:53:45,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:53:45,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288726277] [2024-08-27 01:53:45,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:53:45,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:45,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:53:45,839 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:53:45,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-08-27 01:53:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:53:45,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-27 01:53:45,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:53:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:53:46,042 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:53:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:53:46,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:53:46,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288726277] [2024-08-27 01:53:46,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288726277] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:53:46,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:53:46,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-08-27 01:53:46,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347141628] [2024-08-27 01:53:46,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:53:46,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-27 01:53:46,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:53:46,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-27 01:53:46,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-08-27 01:53:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:46,126 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:53:46,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 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-27 01:53:46,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:46,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:46,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:46,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:46,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:46,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:46,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:46,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:46,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-08-27 01:53:46,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:46,435 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:53:46,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:53:46,435 INFO L85 PathProgramCache]: Analyzing trace with hash -2130591545, now seen corresponding path program 1 times [2024-08-27 01:53:46,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:53:46,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337254015] [2024-08-27 01:53:46,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:53:46,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:46,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:53:46,439 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:53:46,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-08-27 01:53:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:53:46,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 12 conjunts are in the unsatisfiable core [2024-08-27 01:53:46,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:53:46,679 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 01:53:46,680 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 13 treesize of output 13 [2024-08-27 01:53:46,856 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 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:53:46,864 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-27 01:53:46,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:53:46,899 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:53:46,992 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))) (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~newTop~0#1|)) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_4) |c_~#top~0.base|) |c_~#top~0.offset|)))))))) is different from false [2024-08-27 01:53:47,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:53:47,034 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 19 treesize of output 20 [2024-08-27 01:53:47,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-08-27 01:53:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:53:47,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:53:47,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337254015] [2024-08-27 01:53:47,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337254015] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:53:47,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:53:47,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-08-27 01:53:47,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761936391] [2024-08-27 01:53:47,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:53:47,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-08-27 01:53:47,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:53:47,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-08-27 01:53:47,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2024-08-27 01:53:47,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:47,312 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:53:47,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:53:47,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:47,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:47,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:47,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:47,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:47,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:47,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:47,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:47,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:47,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:53:47,783 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 1 remaining) [2024-08-27 01:53:47,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-08-27 01:53:47,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:47,988 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-08-27 01:53:47,993 INFO L308 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-08-27 01:53:47,996 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:53:47,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 01:53:47,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:53:47,998 INFO L229 MonitoredProcess]: Starting monitored process 8 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-27 01:53:47,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2024-08-27 01:53:48,003 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 01:53:48,004 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-27 01:53:48,004 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;@7438a71c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:53:48,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-27 01:53:48,088 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:53:48,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:53:48,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1614565434, now seen corresponding path program 1 times [2024-08-27 01:53:48,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:53:48,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772887056] [2024-08-27 01:53:48,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:53:48,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:48,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:53:48,093 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:53:48,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-08-27 01:53:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:53:48,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2024-08-27 01:53:48,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:53:48,199 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-27 01:53:48,200 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:53:48,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:53:48,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772887056] [2024-08-27 01:53:48,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772887056] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:53:48,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:53:48,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 01:53:48,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508881240] [2024-08-27 01:53:48,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:53:48,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 01:53:48,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:53:48,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 01:53:48,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 01:53:48,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:48,202 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:53:48,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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-27 01:53:48,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:48,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:48,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-08-27 01:53:48,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:48,441 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:53:48,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:53:48,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1917162261, now seen corresponding path program 1 times [2024-08-27 01:53:48,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:53:48,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936340711] [2024-08-27 01:53:48,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:53:48,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:48,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:53:48,445 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:53:48,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-08-27 01:53:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 01:53:48,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-27 01:53:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 01:53:48,605 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-27 01:53:48,606 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-27 01:53:48,606 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-27 01:53:48,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-08-27 01:53:48,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:48,812 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-08-27 01:53:48,812 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-08-27 01:53:48,813 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-27 01:53:48,813 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-08-27 01:53:48,854 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-27 01:53:48,857 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:53:48,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 01:53:48,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:53:48,859 INFO L229 MonitoredProcess]: Starting monitored process 11 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-27 01:53:48,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2024-08-27 01:53:48,863 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 01:53:48,864 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-27 01:53:48,864 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;@7438a71c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:53:48,865 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-27 01:53:49,215 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:53:49,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:53:49,216 INFO L85 PathProgramCache]: Analyzing trace with hash -826269901, now seen corresponding path program 1 times [2024-08-27 01:53:49,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:53:49,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298649689] [2024-08-27 01:53:49,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:53:49,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:49,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:53:49,220 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:53:49,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-08-27 01:53:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:53:49,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjunts are in the unsatisfiable core [2024-08-27 01:53:49,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:53:49,356 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-27 01:53:49,356 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:53:49,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:53:49,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298649689] [2024-08-27 01:53:49,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298649689] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:53:49,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:53:49,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 01:53:49,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654752143] [2024-08-27 01:53:49,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:53:49,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 01:53:49,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:53:49,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 01:53:49,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 01:53:49,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:49,358 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:53:49,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 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-27 01:53:49,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:49,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:49,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-08-27 01:53:49,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:49,632 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:53:49,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:53:49,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1039106021, now seen corresponding path program 1 times [2024-08-27 01:53:49,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:53:49,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667769835] [2024-08-27 01:53:49,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:53:49,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:49,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:53:49,636 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:53:49,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-08-27 01:53:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:53:49,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjunts are in the unsatisfiable core [2024-08-27 01:53:49,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:53:49,760 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-27 01:53:49,802 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-27 01:53:49,802 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:53:49,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:53:49,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667769835] [2024-08-27 01:53:49,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667769835] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:53:49,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:53:49,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 01:53:49,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631951177] [2024-08-27 01:53:49,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:53:49,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-27 01:53:49,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:53:49,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-27 01:53:49,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-27 01:53:49,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:49,804 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:53:49,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:53:49,804 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:49,804 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:51,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:53:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:51,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:53:51,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-08-27 01:53:52,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:52,125 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:53:52,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:53:52,126 INFO L85 PathProgramCache]: Analyzing trace with hash -210511263, now seen corresponding path program 1 times [2024-08-27 01:53:52,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:53:52,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21077257] [2024-08-27 01:53:52,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:53:52,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:52,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:53:52,127 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:53:52,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-08-27 01:53:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:53:52,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2024-08-27 01:53:52,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:53:52,395 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-27 01:53:52,461 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-27 01:53:52,494 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-27 01:53:52,537 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-27 01:53:52,537 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:53:52,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:53:52,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2024-08-27 01:53:52,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:53:52,902 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-27 01:53:52,906 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 30 treesize of output 22 [2024-08-27 01:53:52,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:53:52,918 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 40 treesize of output 33 [2024-08-27 01:53:52,920 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-27 01:53:52,921 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 30 treesize of output 22 [2024-08-27 01:53:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:53:53,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:53:53,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21077257] [2024-08-27 01:53:53,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21077257] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:53:53,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:53:53,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-08-27 01:53:53,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413051380] [2024-08-27 01:53:53,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:53:53,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-27 01:53:53,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:53:53,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-27 01:53:53,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=105, Unknown=7, NotChecked=0, Total=156 [2024-08-27 01:53:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:53,061 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:53:53,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 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-27 01:53:53,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:53,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:53:53,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:55,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:53:55,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:55,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:53:55,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:53:55,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-08-27 01:53:55,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:55,672 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:53:55,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:53:55,672 INFO L85 PathProgramCache]: Analyzing trace with hash -240740414, now seen corresponding path program 1 times [2024-08-27 01:53:55,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:53:55,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330263262] [2024-08-27 01:53:55,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:53:55,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:55,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:53:55,676 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:53:55,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-08-27 01:53:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:53:55,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2024-08-27 01:53:55,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:53:55,833 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-08-27 01:53:55,833 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 36 treesize of output 64 [2024-08-27 01:53:55,841 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 8 treesize of output 7 [2024-08-27 01:53:55,852 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 8 treesize of output 7 [2024-08-27 01:53:55,888 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-27 01:53:55,891 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-27 01:53:55,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 01:53:55,910 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:53:55,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:53:55,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330263262] [2024-08-27 01:53:55,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330263262] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:53:55,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:53:55,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 01:53:55,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064811470] [2024-08-27 01:53:55,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:53:55,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:53:55,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:53:55,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:53:55,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:53:55,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:55,912 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:53:55,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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-27 01:53:55,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:55,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:53:55,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:53:55,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:56,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:56,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:53:56,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:53:56,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:56,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-08-27 01:53:56,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:56,429 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:53:56,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:53:56,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1541764542, now seen corresponding path program 1 times [2024-08-27 01:53:56,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:53:56,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896624946] [2024-08-27 01:53:56,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:53:56,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:56,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:53:56,431 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:53:56,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-08-27 01:53:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:53:56,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-27 01:53:56,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:53:56,612 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-27 01:53:56,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:53:56,675 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-27 01:53:56,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:53:56,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896624946] [2024-08-27 01:53:56,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896624946] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:53:56,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:53:56,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-08-27 01:53:56,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651232840] [2024-08-27 01:53:56,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:53:56,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-27 01:53:56,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:53:56,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-27 01:53:56,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-08-27 01:53:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:56,677 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:53:56,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:53:56,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:56,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:53:56,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:53:56,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:56,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:56,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:56,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:53:56,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:53:56,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:56,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:56,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-08-27 01:53:56,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:56,989 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:53:56,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:53:56,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2137440580, now seen corresponding path program 1 times [2024-08-27 01:53:56,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:53:56,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736357207] [2024-08-27 01:53:56,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:53:56,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:56,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:53:56,991 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:53:56,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-08-27 01:53:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:53:57,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjunts are in the unsatisfiable core [2024-08-27 01:53:57,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:53:57,228 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 01:53:57,229 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 13 treesize of output 13 [2024-08-27 01:53:57,390 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 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:53:57,393 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-27 01:53:57,453 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-27 01:53:57,454 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:53:57,549 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_thr1Thread1of2ForFork0_push_~oldTop~0#1| (select .cse0 |c_~#top~0.offset|)))) (and (or (forall ((v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |c_thr1Thread1of2ForFork0_push_~newTop~0#1|)) |c_thr1Thread1of2ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_10) |c_~#top~0.base|) |c_~#top~0.offset|)))) (not .cse1)) (or .cse1 (forall ((v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_9) |c_~#top~0.base|) |c_~#top~0.offset|)))))))) is different from false [2024-08-27 01:53:57,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:53:57,582 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 19 treesize of output 20 [2024-08-27 01:53:57,585 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 33 treesize of output 25 [2024-08-27 01:53:57,792 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-27 01:53:57,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:53:57,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736357207] [2024-08-27 01:53:57,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736357207] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:53:57,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:53:57,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-08-27 01:53:57,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43941638] [2024-08-27 01:53:57,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:53:57,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-08-27 01:53:57,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:53:57,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-08-27 01:53:57,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-08-27 01:53:57,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:57,795 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:53:57,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 17 states have internal predecessors, (74), 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-27 01:53:57,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:57,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:53:57,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:53:57,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:57,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:57,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:58,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:58,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:53:58,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:53:58,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:58,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:58,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:53:58,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-08-27 01:53:58,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:58,570 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:53:58,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:53:58,571 INFO L85 PathProgramCache]: Analyzing trace with hash 460945972, now seen corresponding path program 2 times [2024-08-27 01:53:58,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:53:58,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340308031] [2024-08-27 01:53:58,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 01:53:58,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:53:58,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:53:58,573 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:53:58,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-08-27 01:53:58,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-27 01:53:58,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 01:53:58,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjunts are in the unsatisfiable core [2024-08-27 01:53:58,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:53:58,808 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 01:53:58,808 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 13 treesize of output 13 [2024-08-27 01:53:58,981 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 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:53:58,985 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-27 01:53:59,045 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-27 01:53:59,072 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-27 01:53:59,092 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-27 01:53:59,092 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:53:59,206 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of2ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#m~0.base| v_ArrVal_363) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread1of2ForFork0_push_~newTop~0#1|)) |c_thr1Thread1of2ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#m~0.base| v_ArrVal_363) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))) (not .cse0))))) is different from false [2024-08-27 01:53:59,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:53:59,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-08-27 01:53:59,236 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 65 treesize of output 57 [2024-08-27 01:53:59,560 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-27 01:53:59,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:53:59,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340308031] [2024-08-27 01:53:59,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340308031] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:53:59,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:53:59,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-08-27 01:53:59,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936143534] [2024-08-27 01:53:59,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:53:59,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-08-27 01:53:59,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:53:59,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-08-27 01:53:59,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=166, Unknown=9, NotChecked=26, Total=240 [2024-08-27 01:53:59,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:53:59,563 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:53:59,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:53:59,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:53:59,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:53:59,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:53:59,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:59,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:53:59,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:53:59,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:01,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:54:01,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:01,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:01,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:01,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:01,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:01,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:54:01,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-27 01:54:01,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-08-27 01:54:01,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:01,854 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:54:01,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:01,855 INFO L85 PathProgramCache]: Analyzing trace with hash -956094227, now seen corresponding path program 1 times [2024-08-27 01:54:01,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:01,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671149632] [2024-08-27 01:54:01,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:01,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:01,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:01,856 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:01,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-08-27 01:54:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 01:54:01,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-27 01:54:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 01:54:02,111 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-27 01:54:02,111 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-27 01:54:02,111 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-27 01:54:02,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-08-27 01:54:02,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:02,317 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-08-27 01:54:02,317 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-08-27 01:54:02,317 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-27 01:54:02,317 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-08-27 01:54:02,355 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-27 01:54:02,358 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:54:02,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 01:54:02,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:54:02,359 INFO L229 MonitoredProcess]: Starting monitored process 20 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-27 01:54:02,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (20)] Waiting until timeout for monitored process [2024-08-27 01:54:02,364 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 01:54:02,365 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-08-27 01:54:02,365 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;@7438a71c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:54:02,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-27 01:54:02,987 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:02,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:02,987 INFO L85 PathProgramCache]: Analyzing trace with hash -2126375043, now seen corresponding path program 1 times [2024-08-27 01:54:02,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:02,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438431768] [2024-08-27 01:54:02,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:02,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:02,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:02,992 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:02,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-08-27 01:54:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:03,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2024-08-27 01:54:03,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:03,181 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-27 01:54:03,181 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:54:03,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:03,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438431768] [2024-08-27 01:54:03,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438431768] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:54:03,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:54:03,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 01:54:03,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964498684] [2024-08-27 01:54:03,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:54:03,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 01:54:03,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:03,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 01:54:03,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 01:54:03,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:03,183 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:03,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 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-27 01:54:03,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:03,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-08-27 01:54:03,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:03,496 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:03,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:03,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1980207569, now seen corresponding path program 1 times [2024-08-27 01:54:03,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:03,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196658310] [2024-08-27 01:54:03,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:03,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:03,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:03,498 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:03,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-08-27 01:54:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:03,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2024-08-27 01:54:03,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:03,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-27 01:54:03,668 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-27 01:54:03,668 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:54:03,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:03,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196658310] [2024-08-27 01:54:03,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196658310] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:54:03,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:54:03,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 01:54:03,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062066002] [2024-08-27 01:54:03,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:54:03,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-27 01:54:03,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:03,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-27 01:54:03,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-27 01:54:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:03,671 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:03,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-27 01:54:03,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:03,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:05,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:54:07,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:54:09,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:54:12,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:54:12,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:12,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:12,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-08-27 01:54:12,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:12,325 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:12,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:12,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1145783191, now seen corresponding path program 1 times [2024-08-27 01:54:12,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:12,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679681711] [2024-08-27 01:54:12,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:12,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:12,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:12,328 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:12,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-08-27 01:54:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:12,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-27 01:54:12,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-27 01:54:12,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:54:12,597 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-27 01:54:12,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:12,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679681711] [2024-08-27 01:54:12,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679681711] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:54:12,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:54:12,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-08-27 01:54:12,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028648534] [2024-08-27 01:54:12,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:54:12,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-27 01:54:12,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:12,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-27 01:54:12,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-08-27 01:54:12,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:12,599 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:12,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 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-27 01:54:12,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:12,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:12,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:12,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:12,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:12,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:12,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-08-27 01:54:12,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:12,947 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:12,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:12,947 INFO L85 PathProgramCache]: Analyzing trace with hash 455569771, now seen corresponding path program 1 times [2024-08-27 01:54:12,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:12,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521822223] [2024-08-27 01:54:12,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:12,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:12,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:12,949 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:12,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-08-27 01:54:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:13,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjunts are in the unsatisfiable core [2024-08-27 01:54:13,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:13,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-08-27 01:54:13,138 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 8 treesize of output 1 [2024-08-27 01:54:13,150 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-27 01:54:13,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:54:13,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-08-27 01:54:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-27 01:54:13,201 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:54:13,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:13,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521822223] [2024-08-27 01:54:13,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521822223] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:54:13,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:54:13,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 01:54:13,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811913394] [2024-08-27 01:54:13,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:54:13,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:54:13,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:13,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:54:13,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:54:13,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:13,202 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:13,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-27 01:54:13,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:13,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:13,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:13,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:13,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:13,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:13,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:13,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:13,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-08-27 01:54:13,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:13,683 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:13,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:13,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1522923375, now seen corresponding path program 1 times [2024-08-27 01:54:13,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:13,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963257043] [2024-08-27 01:54:13,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:13,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:13,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:13,685 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:13,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-08-27 01:54:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:13,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 15 conjunts are in the unsatisfiable core [2024-08-27 01:54:13,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:13,975 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-27 01:54:14,029 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-27 01:54:14,075 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-27 01:54:14,113 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-08-27 01:54:14,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:54:14,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:14,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2024-08-27 01:54:14,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:14,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2024-08-27 01:54:14,413 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 102 treesize of output 94 [2024-08-27 01:54:14,418 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 93 treesize of output 89 [2024-08-27 01:54:14,427 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 91 treesize of output 85 [2024-08-27 01:54:14,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:14,478 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-27 01:54:14,483 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 30 treesize of output 22 [2024-08-27 01:54:14,601 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-08-27 01:54:14,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:14,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963257043] [2024-08-27 01:54:14,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963257043] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:54:14,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:54:14,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-08-27 01:54:14,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581310492] [2024-08-27 01:54:14,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:54:14,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-27 01:54:14,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:14,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-27 01:54:14,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=107, Unknown=4, NotChecked=0, Total=156 [2024-08-27 01:54:14,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:14,603 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:14,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 12 states have internal predecessors, (86), 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-27 01:54:14,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:14,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:14,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:14,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:14,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:15,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:15,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-08-27 01:54:15,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:15,492 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:15,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:15,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1452080061, now seen corresponding path program 1 times [2024-08-27 01:54:15,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:15,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965378325] [2024-08-27 01:54:15,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:15,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:15,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:15,494 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:15,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-08-27 01:54:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:15,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 5 conjunts are in the unsatisfiable core [2024-08-27 01:54:15,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:15,725 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-08-27 01:54:15,725 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 36 treesize of output 64 [2024-08-27 01:54:15,735 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 8 treesize of output 7 [2024-08-27 01:54:15,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:54:15,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-08-27 01:54:15,774 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-08-27 01:54:15,779 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-27 01:54:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-27 01:54:15,797 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:54:15,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:15,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965378325] [2024-08-27 01:54:15,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965378325] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:54:15,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:54:15,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 01:54:15,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015405659] [2024-08-27 01:54:15,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:54:15,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:54:15,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:15,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:54:15,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:54:15,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:15,800 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:15,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-27 01:54:15,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:15,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:15,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:15,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:15,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:15,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:16,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:16,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:16,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:16,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:16,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:16,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:16,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-08-27 01:54:16,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:16,486 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:16,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:16,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1179436776, now seen corresponding path program 1 times [2024-08-27 01:54:16,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:16,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81807095] [2024-08-27 01:54:16,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:16,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:16,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:16,489 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:16,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-08-27 01:54:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:16,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 15 conjunts are in the unsatisfiable core [2024-08-27 01:54:16,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:16,766 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 01:54:16,766 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 13 treesize of output 13 [2024-08-27 01:54:16,889 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 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:54:16,891 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-27 01:54:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:54:16,952 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:54:17,045 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of3ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or (forall ((v_DerPreprocessor_19 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#top~0.base|) |c_~#top~0.offset|)))) .cse0) (or (forall ((v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread1of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_18) |c_~#top~0.base|) |c_~#top~0.offset|)))) (not .cse0))))) is different from false [2024-08-27 01:54:17,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:17,063 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 19 treesize of output 20 [2024-08-27 01:54:17,065 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 33 treesize of output 25 [2024-08-27 01:54:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:54:17,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:17,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81807095] [2024-08-27 01:54:17,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81807095] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:54:17,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:54:17,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-08-27 01:54:17,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809926656] [2024-08-27 01:54:17,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:54:17,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-08-27 01:54:17,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:17,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-08-27 01:54:17,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-08-27 01:54:17,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:17,249 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:17,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 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-27 01:54:17,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:17,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:17,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:17,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:17,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:17,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:17,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:18,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:18,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-08-27 01:54:18,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:18,202 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:18,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:18,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1258041184, now seen corresponding path program 2 times [2024-08-27 01:54:18,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:18,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76479440] [2024-08-27 01:54:18,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 01:54:18,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:18,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:18,205 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:18,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-08-27 01:54:18,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-27 01:54:18,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 01:54:18,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 10 conjunts are in the unsatisfiable core [2024-08-27 01:54:18,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:18,555 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-27 01:54:18,600 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-27 01:54:18,614 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-27 01:54:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-27 01:54:18,670 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:54:18,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:18,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76479440] [2024-08-27 01:54:18,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76479440] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:54:18,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:54:18,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 01:54:18,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884304234] [2024-08-27 01:54:18,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:54:18,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:54:18,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:18,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:54:18,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:54:18,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:18,673 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:18,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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-27 01:54:18,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:18,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:18,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:18,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:18,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:18,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:18,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:18,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:19,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:19,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:19,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:19,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:19,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:19,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:19,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:19,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:19,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2024-08-27 01:54:19,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:19,379 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:19,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:19,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1390433366, now seen corresponding path program 1 times [2024-08-27 01:54:19,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:19,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758745671] [2024-08-27 01:54:19,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:19,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:19,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:19,381 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:19,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-08-27 01:54:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:19,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjunts are in the unsatisfiable core [2024-08-27 01:54:19,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:19,760 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:19,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:54:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:19,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:19,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758745671] [2024-08-27 01:54:19,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758745671] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:54:19,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:54:19,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-08-27 01:54:19,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307553004] [2024-08-27 01:54:19,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:54:19,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-27 01:54:19,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:19,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-27 01:54:19,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-08-27 01:54:19,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:19,958 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:19,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.0) internal successors, (156), 11 states have internal predecessors, (156), 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-27 01:54:19,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:19,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:19,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:19,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:19,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:19,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:19,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:19,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:19,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:20,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:20,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:54:20,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2024-08-27 01:54:20,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:20,450 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:20,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:20,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1311039028, now seen corresponding path program 1 times [2024-08-27 01:54:20,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:20,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [638789039] [2024-08-27 01:54:20,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:20,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:20,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:20,452 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:20,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-08-27 01:54:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:20,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-27 01:54:20,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:20,943 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-08-27 01:54:20,944 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 1 case distinctions, treesize of input 27 treesize of output 19 [2024-08-27 01:54:21,072 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:21,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:54:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:21,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:21,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [638789039] [2024-08-27 01:54:21,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [638789039] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:54:21,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:54:21,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2024-08-27 01:54:21,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861808226] [2024-08-27 01:54:21,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:54:21,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-08-27 01:54:21,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:21,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-08-27 01:54:21,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=278, Unknown=3, NotChecked=0, Total=342 [2024-08-27 01:54:21,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:21,363 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:21,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.473684210526316) internal successors, (142), 18 states have internal predecessors, (142), 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-27 01:54:21,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:21,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:21,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:21,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:21,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:21,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:21,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:21,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:21,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:54:21,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:22,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:22,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:22,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:22,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:22,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:22,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:22,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:22,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:22,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:54:22,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-27 01:54:22,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2024-08-27 01:54:22,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:22,617 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:22,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:22,617 INFO L85 PathProgramCache]: Analyzing trace with hash 585131588, now seen corresponding path program 2 times [2024-08-27 01:54:22,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:22,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424786999] [2024-08-27 01:54:22,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 01:54:22,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:22,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:22,621 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:22,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2024-08-27 01:54:22,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-27 01:54:22,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 01:54:22,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-27 01:54:22,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:22,983 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 01:54:22,983 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 13 treesize of output 13 [2024-08-27 01:54:23,185 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 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:54:23,189 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-27 01:54:23,271 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-27 01:54:23,287 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-27 01:54:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-27 01:54:23,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:54:23,392 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1019) |c_~#top~0.base|) |c_~#top~0.offset|)))) is different from false [2024-08-27 01:54:23,427 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_thr1Thread1of3ForFork0_push_~oldTop~0#1| (select .cse0 |c_~#top~0.offset|)))) (and (or (forall ((v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |c_thr1Thread1of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_22) |c_~#m~0.base| v_ArrVal_1019) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))) (not .cse1)) (or .cse1 (forall ((v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_1019) |c_~#top~0.base|) |c_~#top~0.offset|)))))))) is different from false [2024-08-27 01:54:23,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:23,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-08-27 01:54:23,447 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 65 treesize of output 57 [2024-08-27 01:54:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-27 01:54:23,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:23,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424786999] [2024-08-27 01:54:23,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424786999] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:54:23,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:54:23,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-08-27 01:54:23,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543269079] [2024-08-27 01:54:23,713 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:54:23,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-08-27 01:54:23,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:23,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-08-27 01:54:23,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=255, Unknown=3, NotChecked=66, Total=380 [2024-08-27 01:54:23,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:23,714 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:23,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.7) internal successors, (114), 19 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:23,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:23,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:23,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:23,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:23,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:23,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:23,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:23,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:23,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:54:23,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-27 01:54:23,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:27,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:54:27,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:27,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:27,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:27,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:27,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:27,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:27,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:27,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:27,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:54:27,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-27 01:54:27,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:27,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2024-08-27 01:54:27,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:27,765 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:27,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:27,765 INFO L85 PathProgramCache]: Analyzing trace with hash 741122395, now seen corresponding path program 1 times [2024-08-27 01:54:27,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:27,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805902201] [2024-08-27 01:54:27,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:27,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:27,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:27,767 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:27,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2024-08-27 01:54:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:28,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 35 conjunts are in the unsatisfiable core [2024-08-27 01:54:28,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:28,548 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-08-27 01:54:28,548 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 18 treesize of output 17 [2024-08-27 01:54:28,696 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-08-27 01:54:28,696 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 22 treesize of output 21 [2024-08-27 01:54:28,905 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-08-27 01:54:28,905 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 22 treesize of output 21 [2024-08-27 01:54:29,060 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-08-27 01:54:29,060 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 25 treesize of output 24 [2024-08-27 01:54:29,340 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-08-27 01:54:29,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 38 [2024-08-27 01:54:29,358 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-08-27 01:54:29,358 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 32 treesize of output 29 [2024-08-27 01:54:29,420 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-27 01:54:29,437 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-27 01:54:29,459 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:29,459 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:54:29,483 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1101 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1101) |c_~#top~0.base|) |c_~#top~0.offset|)))) is different from false [2024-08-27 01:54:29,528 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse0 |c_~#top~0.offset|)))) (and (or (forall ((v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1101 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_23) |c_~#m~0.base| v_ArrVal_1101) |c_~#top~0.base|) |c_~#top~0.offset|)))) (not .cse1)) (or .cse1 (forall ((v_DerPreprocessor_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1101 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_24) |c_~#m~0.base| v_ArrVal_1101) |c_~#top~0.base|) |c_~#top~0.offset|)))))))) is different from false [2024-08-27 01:54:29,545 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1101 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_23) |c_~#m~0.base| v_ArrVal_1101) |c_~#top~0.base|) |c_~#top~0.offset|)))) is different from false [2024-08-27 01:54:30,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:30,435 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 752 treesize of output 747 [2024-08-27 01:54:30,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 419 treesize of output 415 [2024-08-27 01:54:30,481 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 415 treesize of output 407 [2024-08-27 01:54:30,489 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 407 treesize of output 403 [2024-08-27 01:54:30,500 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 403 treesize of output 401 [2024-08-27 01:54:30,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 401 treesize of output 393 [2024-08-27 01:54:30,521 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 393 treesize of output 389 [2024-08-27 01:54:30,530 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 389 treesize of output 387 [2024-08-27 01:54:30,540 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 387 treesize of output 385 [2024-08-27 01:54:30,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 385 treesize of output 383 [2024-08-27 01:54:30,561 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 383 treesize of output 379 [2024-08-27 01:54:30,572 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 379 treesize of output 377 [2024-08-27 01:54:30,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 377 treesize of output 373 [2024-08-27 01:54:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:31,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:31,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805902201] [2024-08-27 01:54:31,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805902201] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:54:31,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:54:31,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2024-08-27 01:54:31,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101744436] [2024-08-27 01:54:31,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:54:31,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-08-27 01:54:31,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:31,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-08-27 01:54:31,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=726, Unknown=18, NotChecked=174, Total=1056 [2024-08-27 01:54:31,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:31,503 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:31,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.181818181818182) internal successors, (138), 32 states have internal predecessors, (138), 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-27 01:54:31,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:31,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:31,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:31,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:31,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:31,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:31,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:31,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:31,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:54:31,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-27 01:54:31,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:31,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:54:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-27 01:54:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:33,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-27 01:54:33,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2024-08-27 01:54:33,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:33,297 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:33,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:33,298 INFO L85 PathProgramCache]: Analyzing trace with hash -877004733, now seen corresponding path program 1 times [2024-08-27 01:54:33,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:33,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207940713] [2024-08-27 01:54:33,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:33,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:33,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:33,299 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:33,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2024-08-27 01:54:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:33,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 24 conjunts are in the unsatisfiable core [2024-08-27 01:54:33,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:33,635 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-08-27 01:54:33,635 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 16 treesize of output 17 [2024-08-27 01:54:33,930 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-08-27 01:54:33,930 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 36 treesize of output 64 [2024-08-27 01:54:33,942 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 8 treesize of output 7 [2024-08-27 01:54:33,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:54:33,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-08-27 01:54:33,983 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-27 01:54:34,147 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-08-27 01:54:34,147 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 20 treesize of output 21 [2024-08-27 01:54:34,410 INFO L349 Elim1Store]: treesize reduction 4, result has 90.2 percent of original size [2024-08-27 01:54:34,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 107 [2024-08-27 01:54:34,425 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 69 treesize of output 65 [2024-08-27 01:54:34,634 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-27 01:54:34,797 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-08-27 01:54:34,802 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-27 01:54:34,860 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-27 01:54:34,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-08-27 01:54:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:34,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:54:35,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:35,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2024-08-27 01:54:35,085 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#m~0.offset| (_ BitVec 32)) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_27 |~#m~0.offset|) (_ bv0 32))) (= (_ bv0 32) (select (select (store |c_#memory_int| |c_~#m~0.base| v_arrayElimArr_27) |c_~#m2~0.base|) |c_~#m2~0.offset|)))) is different from false [2024-08-27 01:54:35,174 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m~0.offset| (_ BitVec 32)) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_27 |~#m~0.offset|) (_ bv0 32))) (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#m~0.base| v_arrayElimArr_27) |c_~#m2~0.base|) |c_~#m2~0.offset|))))) (or (forall ((|~#m~0.offset| (_ BitVec 32)) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1166 (_ BitVec 32))) (or (not (= (select v_arrayElimArr_27 |~#m~0.offset|) (_ bv0 32))) (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_1166)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_28) |c_~#m~0.base| v_arrayElimArr_27) |c_~#m2~0.base|) |c_~#m2~0.offset|)))) (not .cse0))))) is different from false [2024-08-27 01:54:35,374 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-08-27 01:54:35,374 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 2 case distinctions, treesize of input 37 treesize of output 40 [2024-08-27 01:54:35,377 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 132 treesize of output 120 [2024-08-27 01:54:35,382 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-27 01:54:35,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:35,391 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 31 treesize of output 33 [2024-08-27 01:54:36,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:36,082 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 318 treesize of output 311 [2024-08-27 01:54:36,091 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 146 treesize of output 138 [2024-08-27 01:54:36,165 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 12 treesize of output 10 [2024-08-27 01:54:36,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:36,197 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 318 treesize of output 311 [2024-08-27 01:54:36,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 138 [2024-08-27 01:54:36,275 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 12 treesize of output 10 [2024-08-27 01:54:36,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:36,301 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 238 treesize of output 233 [2024-08-27 01:54:36,306 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 146 treesize of output 138 [2024-08-27 01:54:36,370 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 12 treesize of output 10 [2024-08-27 01:54:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:57,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:57,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207940713] [2024-08-27 01:54:57,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207940713] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:54:57,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:54:57,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2024-08-27 01:54:57,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297492648] [2024-08-27 01:54:57,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:54:57,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-08-27 01:54:57,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:57,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-08-27 01:54:57,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=339, Unknown=17, NotChecked=78, Total=506 [2024-08-27 01:54:57,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:57,809 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:57,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 22 states have internal predecessors, (128), 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-27 01:54:57,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:57,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:57,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:57,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:57,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:57,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:57,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:57,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:57,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:54:57,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-27 01:54:57,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:57,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-27 01:54:57,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:55:04,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:55:04,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:55:04,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:04,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:04,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:55:04,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:55:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-27 01:55:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:55:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-27 01:55:04,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2024-08-27 01:55:04,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:55:04,275 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:55:04,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:55:04,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1897379409, now seen corresponding path program 1 times [2024-08-27 01:55:04,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:55:04,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629235150] [2024-08-27 01:55:04,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:55:04,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:55:04,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:55:04,277 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:55:04,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2024-08-27 01:55:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:55:04,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2024-08-27 01:55:04,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:55:04,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-08-27 01:55:04,521 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 8 treesize of output 1 [2024-08-27 01:55:04,533 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-27 01:55:04,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:55:04,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-08-27 01:55:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-08-27 01:55:04,570 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:55:04,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:55:04,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629235150] [2024-08-27 01:55:04,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629235150] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:55:04,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:55:04,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 01:55:04,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869199413] [2024-08-27 01:55:04,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:55:04,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:55:04,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:55:04,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:55:04,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:55:04,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:55:04,571 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:55:04,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-27 01:55:04,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:55:04,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:55:04,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:04,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:04,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:55:04,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:04,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:04,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:04,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:55:04,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-27 01:55:04,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:04,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:55:04,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-27 01:55:04,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:55:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:55:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:55:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:55:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:05,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:55:05,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-08-27 01:55:05,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:05,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:55:05,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-27 01:55:05,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:05,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2024-08-27 01:55:05,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:55:05,509 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:55:05,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:55:05,509 INFO L85 PathProgramCache]: Analyzing trace with hash -460996992, now seen corresponding path program 1 times [2024-08-27 01:55:05,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:55:05,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114002848] [2024-08-27 01:55:05,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:55:05,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:55:05,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:55:05,511 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:55:05,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2024-08-27 01:55:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:55:05,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-27 01:55:05,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:55:06,213 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-08-27 01:55:06,213 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 1 case distinctions, treesize of input 27 treesize of output 19 [2024-08-27 01:55:06,249 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:55:06,249 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:55:06,685 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:55:06,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:55:06,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114002848] [2024-08-27 01:55:06,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114002848] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:55:06,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:55:06,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2024-08-27 01:55:06,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962808405] [2024-08-27 01:55:06,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:55:06,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-08-27 01:55:06,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:55:06,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-08-27 01:55:06,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=338, Unknown=2, NotChecked=0, Total=420 [2024-08-27 01:55:06,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:55:06,688 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:55:06,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.761904761904762) internal successors, (163), 20 states have internal predecessors, (163), 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-27 01:55:06,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:55:06,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:55:06,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:06,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:06,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:55:06,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:06,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:06,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:06,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:55:06,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-08-27 01:55:06,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:06,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:55:06,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-27 01:55:06,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:06,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:55:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:55:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:55:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:55:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:55:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:55:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:55:09,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-08-27 01:55:09,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:09,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-27 01:55:09,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Ended with exit code 0 [2024-08-27 01:55:09,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:55:09,209 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:55:09,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:55:09,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1192799301, now seen corresponding path program 1 times [2024-08-27 01:55:09,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:55:09,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012615564] [2024-08-27 01:55:09,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:55:09,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:55:09,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:55:09,211 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:55:09,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2024-08-27 01:55:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:55:09,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 12 conjunts are in the unsatisfiable core [2024-08-27 01:55:09,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:55:09,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 01:55:09,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:55:09,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-08-27 01:55:09,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-08-27 01:55:09,671 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 36 treesize of output 17 [2024-08-27 01:55:09,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:55:09,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-08-27 01:55:09,736 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-08-27 01:55:09,737 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 23 treesize of output 20 [2024-08-27 01:55:09,767 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-27 01:55:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 01:55:09,793 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:55:09,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:55:09,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012615564] [2024-08-27 01:55:09,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012615564] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:55:09,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:55:09,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-08-27 01:55:09,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397317167] [2024-08-27 01:55:09,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:55:09,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-27 01:55:09,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:55:09,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-27 01:55:09,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-08-27 01:55:09,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:55:09,795 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:55:09,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 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-27 01:55:09,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:55:09,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:55:09,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:09,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:09,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:55:09,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:09,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:09,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:09,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:55:09,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:55:09,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:09,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:55:09,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-08-27 01:55:09,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:09,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-27 01:55:09,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:55:10,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:55:10,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:55:10,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:10,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:10,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:55:10,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:10,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:55:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:55:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:55:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-08-27 01:55:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:55:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-27 01:55:10,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Ended with exit code 0 [2024-08-27 01:55:10,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:55:10,975 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:55:10,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:55:10,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1349471029, now seen corresponding path program 1 times [2024-08-27 01:55:10,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:55:10,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657213780] [2024-08-27 01:55:10,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:55:10,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:55:10,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:55:10,977 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:55:10,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2024-08-27 01:55:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:55:11,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 27 conjunts are in the unsatisfiable core [2024-08-27 01:55:11,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:55:11,472 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 7 [2024-08-27 01:55:11,717 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 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:55:11,731 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-08-27 01:55:11,731 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-27 01:55:11,799 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 01:55:11,799 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 13 treesize of output 13 [2024-08-27 01:55:11,865 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:55:11,865 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 2 case distinctions, treesize of input 29 treesize of output 31 [2024-08-27 01:55:11,959 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:55:11,959 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 2 case distinctions, treesize of input 33 treesize of output 35 [2024-08-27 01:55:12,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2024-08-27 01:55:12,213 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 18 treesize of output 7 [2024-08-27 01:55:12,218 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 8 treesize of output 7 [2024-08-27 01:55:12,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:55:12,484 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-27 01:55:12,484 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 51 [2024-08-27 01:55:12,535 INFO L349 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2024-08-27 01:55:12,536 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 3 case distinctions, treesize of input 49 treesize of output 56 [2024-08-27 01:55:12,540 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2024-08-27 01:55:12,545 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 8 treesize of output 1 [2024-08-27 01:55:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:55:12,609 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:55:12,667 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_38) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)))) (or (forall ((v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_1487)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) (not .cse0))))) is different from false [2024-08-27 01:55:14,476 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-27 01:55:14,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:55:14,480 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 35 treesize of output 35 [2024-08-27 01:55:14,485 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 8 treesize of output 4 [2024-08-27 01:55:14,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:55:14,496 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 63 treesize of output 55 [2024-08-27 01:55:14,500 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 204 treesize of output 196 [2024-08-27 01:55:14,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:55:14,511 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 71 treesize of output 75 [2024-08-27 01:55:14,515 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-27 01:55:14,845 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-27 01:55:15,029 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-08-27 01:55:15,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:55:15,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657213780] [2024-08-27 01:55:15,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657213780] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:55:15,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:55:15,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2024-08-27 01:55:15,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479741502] [2024-08-27 01:55:15,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:55:15,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-08-27 01:55:15,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:55:15,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-08-27 01:55:15,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=687, Unknown=28, NotChecked=54, Total=870 [2024-08-27 01:55:15,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:55:15,031 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:55:15,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.866666666666666) internal successors, (146), 29 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:55:15,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:55:15,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:55:15,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:15,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:15,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:55:15,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:15,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:15,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:15,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:55:15,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:55:15,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:15,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:55:15,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-08-27 01:55:15,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:15,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:55:15,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-27 01:55:15,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:55:20,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:55:21,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:55:21,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:55:21,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:21,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:55:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:55:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:55:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:55:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-08-27 01:55:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:55:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-27 01:55:21,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-08-27 01:55:21,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2024-08-27 01:55:21,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:55:21,984 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:55:21,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:55:21,984 INFO L85 PathProgramCache]: Analyzing trace with hash 116354577, now seen corresponding path program 2 times [2024-08-27 01:55:21,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:55:21,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706459083] [2024-08-27 01:55:21,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 01:55:21,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:55:21,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:55:21,986 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:55:21,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2024-08-27 01:55:22,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-27 01:55:22,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 01:55:22,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 24 conjunts are in the unsatisfiable core [2024-08-27 01:55:22,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:55:22,382 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 7 [2024-08-27 01:55:22,594 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 01:55:22,594 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 13 treesize of output 13 [2024-08-27 01:55:22,657 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 18 treesize of output 7 [2024-08-27 01:55:22,665 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-27 01:55:22,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-08-27 01:55:22,679 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 8 treesize of output 1 [2024-08-27 01:55:22,752 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2024-08-27 01:55:22,752 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 3 case distinctions, treesize of input 53 treesize of output 51 [2024-08-27 01:55:22,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:55:22,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-08-27 01:55:22,768 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 8 treesize of output 7 [2024-08-27 01:55:22,813 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 16 treesize of output 11 [2024-08-27 01:55:22,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:55:22,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-27 01:55:22,994 INFO L349 Elim1Store]: treesize reduction 37, result has 28.8 percent of original size [2024-08-27 01:55:22,994 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 2 case distinctions, treesize of input 43 treesize of output 26 [2024-08-27 01:55:23,201 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 24 treesize of output 17 [2024-08-27 01:55:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 01:55:23,238 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:55:23,385 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (and (or (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse0) (or (not .cse0) (forall ((v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)))))) is different from false [2024-08-27 01:55:23,406 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (and (or (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse0) (or (not .cse0) (forall ((v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)))))) (= (_ bv1 32) |c_thr1Thread2of3ForFork0_push_#t~mem13#1|)) is different from false [2024-08-27 01:55:23,651 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse6 (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select .cse5 |c_~#top~0.offset|)))) (let ((.cse0 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (.cse1 (not .cse6))) (and (or .cse0 (and (or .cse1 (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse3 (store (select .cse4 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse2 (store .cse4 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse3))) (or (= (select (select .cse2 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)))))))) (or .cse6 (forall ((v_DerPreprocessor_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse7 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_55))) (or (= (_ bv1 32) (select (select .cse7 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (select (select (store (store .cse7 |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32)))))))) (or (not .cse0) (and (or (forall ((|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_52 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_52))) (or (= (_ bv1 32) (select (select .cse8 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (select (select (store .cse8 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32))))) .cse6) (or (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| v_DerPreprocessor_53)))) (store .cse10 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse10 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))))) (or (= (_ bv1 32) (select (select (store .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse9 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53))))) .cse1))))))) is different from false [2024-08-27 01:55:23,859 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (and (or (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_DerPreprocessor_53)))) (store .cse1 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse1 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))))) (or (= (_ bv1 32) (select (select (store .cse0 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse0 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53))))) (not .cse3)) (or .cse3 (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse6 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse5 (store (select .cse6 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse4 (store .cse6 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse5))) (or (= (select (select .cse4 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)))))))))) is different from false [2024-08-27 01:55:42,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:55:42,361 INFO L349 Elim1Store]: treesize reduction 49, result has 40.2 percent of original size [2024-08-27 01:55:42,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 21470 treesize of output 18804 [2024-08-27 01:55:42,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:55:42,429 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 179 [2024-08-27 01:55:42,447 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 173 treesize of output 169 [2024-08-27 01:55:42,459 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-27 01:55:42,504 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 9 treesize of output 1 [2024-08-27 01:55:42,591 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-08-27 01:55:42,592 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 51 [2024-08-27 01:55:42,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:55:42,638 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 39 treesize of output 43 [2024-08-27 01:55:42,672 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 144 treesize of output 142 [2024-08-27 01:55:42,747 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-27 01:55:42,853 INFO L349 Elim1Store]: treesize reduction 50, result has 39.0 percent of original size [2024-08-27 01:55:42,853 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 10927 treesize of output 10522 [2024-08-27 01:55:42,954 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-27 01:55:42,954 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 876 treesize of output 858 [2024-08-27 01:55:42,989 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 690 treesize of output 668 [2024-08-27 01:55:43,040 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-08-27 01:55:43,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 355 treesize of output 339 [2024-08-27 01:55:43,102 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 90 treesize of output 86 [2024-08-27 01:55:43,133 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 86 treesize of output 78 [2024-08-27 01:55:43,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 10 treesize of output 8 [2024-08-27 01:55:44,855 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-27 01:55:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 8 not checked. [2024-08-27 01:55:46,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:55:46,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706459083] [2024-08-27 01:55:46,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [706459083] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:55:46,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:55:46,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-08-27 01:55:46,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616452553] [2024-08-27 01:55:46,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:55:46,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-08-27 01:55:46,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:55:46,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-08-27 01:55:46,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=488, Unknown=31, NotChecked=196, Total=812 [2024-08-27 01:55:46,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:55:46,160 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:55:46,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.896551724137931) internal successors, (142), 28 states have internal predecessors, (142), 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-27 01:55:46,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:55:46,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:55:46,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:46,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:46,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:55:46,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:46,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:46,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:46,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:55:46,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:55:46,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:46,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:55:46,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-08-27 01:55:46,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:46,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:55:46,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-27 01:55:46,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-08-27 01:55:46,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:55:51,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:55:55,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:56:09,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:56:17,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:56:19,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:56:37,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:56:41,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:56:49,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:56:54,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:56:57,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:56:59,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:03,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:05,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:07,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:14,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:17,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:22,524 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse14 |c_~#top~0.offset|))) (.cse16 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (let ((.cse0 (not .cse16)) (.cse15 (not .cse1))) (and (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv0 32)) (= (_ bv4 32) |c_~#top~0.base|) (not (= (_ bv3 32) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (= (_ bv3 32) |c_~#m~0.base|) (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (_ bv0 32))) (or .cse0 (and (or .cse1 (forall ((v_DerPreprocessor_56 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| (_ BitVec 32))) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_56))) (let ((.cse7 (store .cse3 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse4 (store (select .cse7 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse6 (store .cse7 |c_~#top~0.base| .cse4))) (let ((.cse5 (store (select .cse6 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse2 (store .cse6 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| .cse5))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|))) (not (= (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (not (= (_ bv0 32) (select (select .cse3 |c_~#m~0.base|) |c_~#m~0.offset|))) (= (_ bv1 32) (select (select .cse2 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| .cse4) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| .cse5) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))))))))))) (or (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| (_ BitVec 32)) (v_ArrVal_1560 (_ BitVec 32))) (let ((.cse10 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse14 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32))))) (let ((.cse13 (store .cse10 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse8 (store (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse12 (store .cse13 |c_~#top~0.base| .cse8))) (let ((.cse9 (store (select .cse12 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse11 (store .cse12 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| .cse9))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|))) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| .cse8) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| .cse9) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (_ bv0 32) (select (select .cse10 |c_~#m~0.base|) |c_~#m~0.offset|))) (= (_ bv1 32) (select (select .cse11 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)))))))))) .cse15))) (= (bvadd (_ bv1 1) (select |c_#valid| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (_ bv0 1)) (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (or .cse16 (and (or .cse1 (forall ((v_DerPreprocessor_57 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| (_ BitVec 32))) (let ((.cse18 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_57))) (let ((.cse20 (let ((.cse21 (store .cse18 |c_~#m~0.base| v_ArrVal_1566))) (store .cse21 |c_~#top~0.base| (store (select .cse21 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54))))) (let ((.cse19 (store (select .cse20 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse17 (store .cse20 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| .cse19))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|))) (not (= (select (select .cse17 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (not (= (_ bv0 32) (select (select .cse18 |c_~#m~0.base|) |c_~#m~0.offset|))) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| .cse19) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse17 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))))))) (or (forall ((v_DerPreprocessor_58 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| (_ BitVec 32)) (v_ArrVal_1560 (_ BitVec 32))) (let ((.cse26 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse14 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse24 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_58) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse26))) (let ((.cse25 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse26) |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| (store (select (store .cse24 |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse22 (store (select .cse25 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse23 (store .cse25 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| .cse22))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|))) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| .cse22) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse23 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (= (_ bv1 32) (select (select .cse23 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse24 |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))))))))) .cse15))) (or .cse16 (and (or .cse1 (forall ((v_DerPreprocessor_57 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_57))) (let ((.cse30 (let ((.cse31 (store .cse29 |c_~#m~0.base| v_ArrVal_1566))) (store .cse31 |c_~#top~0.base| (store (select .cse31 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54))))) (let ((.cse27 (store (select .cse30 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse28 (store .cse30 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse27))) (or (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse27) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse28 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse28 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (not (= (_ bv0 32) (select (select .cse29 |c_~#m~0.base|) |c_~#m~0.offset|)))))))))) (or (forall ((v_DerPreprocessor_58 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1560 (_ BitVec 32))) (let ((.cse36 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse14 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse34 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_58) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse36))) (let ((.cse35 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse36) |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| (store (select (store .cse34 |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse33 (store (select .cse35 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse32 (store .cse35 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse33))) (or (not (= v_DerPreprocessor_54 (select (select .cse32 |c_~#top~0.base|) |c_~#top~0.offset|))) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse33) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse32 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse34 |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))))))))) .cse15))) (= (_ bv0 32) |c_~#m~0.offset|) (or .cse0 (and (or .cse1 (forall ((v_DerPreprocessor_56 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_56))) (let ((.cse42 (store .cse38 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse39 (store (select .cse42 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse41 (store .cse42 |c_~#top~0.base| .cse39))) (let ((.cse40 (store (select .cse41 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse37 (store .cse41 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse40))) (or (not (= (select (select .cse37 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (not (= (_ bv0 32) (select (select .cse38 |c_~#m~0.base|) |c_~#m~0.offset|))) (= (_ bv1 32) (select (select .cse37 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| .cse39) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse40) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))))))))))) (or (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1560 (_ BitVec 32))) (let ((.cse46 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse14 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32))))) (let ((.cse48 (store .cse46 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse44 (store (select .cse48 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse47 (store .cse48 |c_~#top~0.base| .cse44))) (let ((.cse45 (store (select .cse47 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse43 (store .cse47 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse45))) (or (= (_ bv1 32) (select (select .cse43 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| .cse44) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse45) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (_ bv0 32) (select (select .cse46 |c_~#m~0.base|) |c_~#m~0.offset|))) (not (= (select (select .cse43 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)))))))))) .cse15))))))) is different from true [2024-08-27 01:57:36,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:41,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:43,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:47,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:54,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:56,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:58:02,490 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (.cse17 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse17 |c_~#top~0.offset|))) (.cse3 (not .cse2))) (let ((.cse1 (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (_ bv0 32)))) (.cse5 (or .cse3 (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (let ((.cse35 (let ((.cse36 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (store .cse36 |c_~#top~0.base| (store (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))))) (store .cse35 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse35 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))))) (or (= (_ bv1 32) (select (select .cse34 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse34 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (= (select (select (store .cse34 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32))))))) (.cse4 (not .cse0)) (.cse6 (or .cse2 (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse33 (store .cse30 |c_~#top~0.base| (store (select .cse30 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse31 (store (select .cse33 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse32 (store .cse33 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse31))) (or (= (_ bv1 32) (select (select (store (store (store .cse30 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse31) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse32 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (= (_ bv1 32) (select (select .cse32 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))))))))) (and (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv0 32)) (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (_ bv4 32))) (or (forall ((v_DerPreprocessor_51 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_51) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse0) (= (_ bv4 32) |c_~#top~0.base|) (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (_ bv3 32) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) .cse1 (or (and (or (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse2) (or .cse3 (forall ((v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))))) .cse4) (or .cse1 (and (= (_ bv0 32) |c_~#top~0.offset|) (= (_ bv4 32) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (or (and .cse5 .cse6) (not (= (select (select |c_#memory_int| |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))) .cse5 (= (_ bv1 32) |c_thr1Thread3of3ForFork0_push_#t~mem13#1|) (or .cse2 (and (or .cse0 (forall ((v_DerPreprocessor_57 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_57))) (let ((.cse10 (let ((.cse11 (store .cse9 |c_~#m~0.base| v_ArrVal_1566))) (store .cse11 |c_~#top~0.base| (store (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54))))) (let ((.cse7 (store (select .cse10 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse8 (store .cse10 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse7))) (or (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse7) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse8 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (not (= (_ bv0 32) (select (select .cse9 |c_~#m~0.base|) |c_~#m~0.offset|)))))))))) (or (forall ((v_DerPreprocessor_58 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1560 (_ BitVec 32))) (let ((.cse16 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse17 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse14 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_58) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse16))) (let ((.cse15 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse16) |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| (store (select (store .cse14 |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse13 (store (select .cse15 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse12 (store .cse15 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13))) (or (not (= v_DerPreprocessor_54 (select (select .cse12 |c_~#top~0.base|) |c_~#top~0.offset|))) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse12 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse14 |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))))))))) .cse4))) (or .cse3 (and (or .cse0 (forall ((v_DerPreprocessor_56 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_56))) (let ((.cse23 (store .cse19 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse20 (store (select .cse23 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse22 (store .cse23 |c_~#top~0.base| .cse20))) (let ((.cse21 (store (select .cse22 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse18 (store .cse22 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse21))) (or (not (= (select (select .cse18 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (not (= (_ bv0 32) (select (select .cse19 |c_~#m~0.base|) |c_~#m~0.offset|))) (= (_ bv1 32) (select (select .cse18 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| .cse20) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))))))))))) (or (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1560 (_ BitVec 32))) (let ((.cse27 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse17 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32))))) (let ((.cse29 (store .cse27 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse25 (store (select .cse29 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse28 (store .cse29 |c_~#top~0.base| .cse25))) (let ((.cse26 (store (select .cse28 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse24 (store .cse28 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse26))) (or (= (_ bv1 32) (select (select .cse24 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| .cse25) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse26) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (_ bv0 32) (select (select .cse27 |c_~#m~0.base|) |c_~#m~0.offset|))) (not (= (select (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)))))))))) .cse4))) .cse6)))) is different from true [2024-08-27 01:58:03,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:58:05,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:58:07,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:58:09,583 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (.cse17 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse17 |c_~#top~0.offset|))) (.cse3 (not .cse2))) (let ((.cse1 (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (_ bv0 32)))) (.cse5 (or .cse3 (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (let ((.cse35 (let ((.cse36 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (store .cse36 |c_~#top~0.base| (store (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))))) (store .cse35 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse35 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))))) (or (= (_ bv1 32) (select (select .cse34 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse34 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (= (select (select (store .cse34 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32))))))) (.cse4 (not .cse0)) (.cse6 (or .cse2 (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse33 (store .cse30 |c_~#top~0.base| (store (select .cse30 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse31 (store (select .cse33 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse32 (store .cse33 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse31))) (or (= (_ bv1 32) (select (select (store (store (store .cse30 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse31) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse32 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (= (_ bv1 32) (select (select .cse32 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))))))))) (and (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv0 32)) (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (_ bv4 32))) (or (forall ((v_DerPreprocessor_51 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_51) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse0) (= (_ bv4 32) |c_~#top~0.base|) (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (_ bv3 32) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) .cse1 (or (and (or (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse2) (or .cse3 (forall ((v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))))) .cse4) (or .cse1 (and (= (_ bv0 32) |c_~#top~0.offset|) (= (_ bv4 32) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (or (and .cse5 .cse6) (not (= (select (select |c_#memory_int| |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))) .cse5 (or .cse2 (and (or .cse0 (forall ((v_DerPreprocessor_57 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_57))) (let ((.cse10 (let ((.cse11 (store .cse9 |c_~#m~0.base| v_ArrVal_1566))) (store .cse11 |c_~#top~0.base| (store (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54))))) (let ((.cse7 (store (select .cse10 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse8 (store .cse10 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse7))) (or (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse7) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse8 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (not (= (_ bv0 32) (select (select .cse9 |c_~#m~0.base|) |c_~#m~0.offset|)))))))))) (or (forall ((v_DerPreprocessor_58 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1560 (_ BitVec 32))) (let ((.cse16 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse17 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse14 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_58) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse16))) (let ((.cse15 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse16) |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| (store (select (store .cse14 |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse13 (store (select .cse15 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse12 (store .cse15 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13))) (or (not (= v_DerPreprocessor_54 (select (select .cse12 |c_~#top~0.base|) |c_~#top~0.offset|))) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse12 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse14 |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))))))))) .cse4))) (or .cse3 (and (or .cse0 (forall ((v_DerPreprocessor_56 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_56))) (let ((.cse23 (store .cse19 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse20 (store (select .cse23 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse22 (store .cse23 |c_~#top~0.base| .cse20))) (let ((.cse21 (store (select .cse22 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse18 (store .cse22 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse21))) (or (not (= (select (select .cse18 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (not (= (_ bv0 32) (select (select .cse19 |c_~#m~0.base|) |c_~#m~0.offset|))) (= (_ bv1 32) (select (select .cse18 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| .cse20) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))))))))))) (or (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1560 (_ BitVec 32))) (let ((.cse27 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse17 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32))))) (let ((.cse29 (store .cse27 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse25 (store (select .cse29 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse28 (store .cse29 |c_~#top~0.base| .cse25))) (let ((.cse26 (store (select .cse28 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse24 (store .cse28 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse26))) (or (= (_ bv1 32) (select (select .cse24 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select (store (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| .cse25) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse26) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (_ bv0 32) (select (select .cse27 |c_~#m~0.base|) |c_~#m~0.offset|))) (not (= (select (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)))))))))) .cse4))) .cse6)))) is different from true [2024-08-27 01:58:14,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:58:23,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-27 01:58:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:58:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:58:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:58:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:58:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:58:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:58:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:58:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:58:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:58:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:58:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:58:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-27 01:58:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-08-27 01:58:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:58:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:58:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-27 01:58:41,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:58:41,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-08-27 01:58:41,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2024-08-27 01:58:41,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:58:41,243 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:58:41,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:58:41,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1422240575, now seen corresponding path program 2 times [2024-08-27 01:58:41,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:58:41,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955783896] [2024-08-27 01:58:41,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 01:58:41,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:58:41,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:58:41,245 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:58:41,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2024-08-27 01:58:41,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-08-27 01:58:41,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 01:58:41,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-27 01:58:41,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:58:44,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 29 [2024-08-27 01:58:44,919 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2024-08-27 01:58:44,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 45 [2024-08-27 01:58:46,150 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-08-27 01:58:46,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:58:49,870 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse9 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (or (and (or (= (select (select |c_#memory_int| |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (= (_ bv1 32) (select (select (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32))) |c_~#m~0.base|) |c_~#m~0.offset|)))) (forall ((v_DerPreprocessor_61 (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_DerPreprocessor_61)))) (store .cse1 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse1 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (= |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (= (_ bv0 32) .cse0) (= (_ bv1 32) .cse0)))) (forall ((v_DerPreprocessor_60 (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse3 (select (select (let ((.cse4 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_DerPreprocessor_60)))) (store .cse4 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse4 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (= (_ bv1 32) .cse3) (= |c_~#top~0.base| |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (= (_ bv0 32) .cse3)))) (forall ((v_DerPreprocessor_62 (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse5 (select (select (let ((.cse6 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_DerPreprocessor_62)))) (store .cse6 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse6 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) |c_~#m2~0.base|) |c_~#m2~0.offset|))) (or (= |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (= .cse5 (_ bv0 32)) (= .cse5 (_ bv1 32))))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (= (_ bv1 32) (select (select (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32))) |c_~#m2~0.base|) |c_~#m2~0.offset|))) (= (select (select |c_#memory_int| |c_~#m2~0.base|) |c_~#m2~0.offset|) (_ bv0 32))) (forall ((v_DerPreprocessor_63 (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse7 (select (select (let ((.cse8 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_DerPreprocessor_63)))) (store .cse8 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse8 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) |c_~#m2~0.base|) |c_~#m2~0.offset|))) (or (= .cse7 (_ bv1 32)) (= |c_~#top~0.base| |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (= .cse7 (_ bv0 32)))))) (not .cse9)) (or .cse9 (and (forall ((v_DerPreprocessor_64 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32))) (let ((.cse10 (select (select (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_64) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (= .cse10 (_ bv0 32)) (= .cse10 (_ bv1 32))))) (not (= (_ bv1 32) (select v_DerPreprocessor_64 |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))) (forall ((v_DerPreprocessor_64 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32))) (let ((.cse11 (select (select (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_64) |c_~#m2~0.base|) |c_~#m2~0.offset|))) (or (= (_ bv1 32) .cse11) (= (_ bv0 32) .cse11)))) (not (= (_ bv1 32) (select v_DerPreprocessor_64 |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))) is different from false [2024-08-27 01:58:50,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:58:50,088 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 890 treesize of output 813 [2024-08-27 01:58:51,518 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 1 not checked. [2024-08-27 01:58:51,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:58:51,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955783896] [2024-08-27 01:58:51,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955783896] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:58:51,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:58:51,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2024-08-27 01:58:51,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871949835] [2024-08-27 01:58:51,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:58:51,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-27 01:58:51,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:58:51,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-27 01:58:51,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=4, NotChecked=20, Total=156 [2024-08-27 01:58:51,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:58:51,520 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:58:51,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 10.666666666666666) internal successors, (128), 12 states have internal predecessors, (128), 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-27 01:58:51,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:58:51,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:58:51,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:58:51,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:58:51,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:58:51,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:58:51,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:58:51,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:58:51,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:58:51,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:58:51,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:58:51,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-27 01:58:51,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-08-27 01:58:51,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:58:51,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:58:51,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-27 01:58:51,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:58:51,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-08-27 01:58:51,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:59:03,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:59:07,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:59:17,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:59:26,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:59:29,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:59:31,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:59:41,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:59:46,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:59:52,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:59:59,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 02:00:11,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 02:00:12,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 02:00:21,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 02:00:33,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 02:00:36,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 02:00:43,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 02:00:55,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 02:01:05,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15