./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-09-02_08-21-23.files/protection-local/26_stack_cas_longer-1.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a4c57e3 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-09-02_08-21-23.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.positions.where.we.compute.the.hoare.annotation None --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-4a4c57e-m [2024-09-08 06:32:19,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-08 06:32:19,996 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-08 06:32:20,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-08 06:32:20,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-08 06:32:20,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-08 06:32:20,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-08 06:32:20,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-08 06:32:20,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-08 06:32:20,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-08 06:32:20,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-08 06:32:20,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-08 06:32:20,029 INFO L153 SettingsManager]: * Use SBE=true [2024-09-08 06:32:20,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-08 06:32:20,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-08 06:32:20,031 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-08 06:32:20,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-08 06:32:20,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-08 06:32:20,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-08 06:32:20,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-08 06:32:20,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-08 06:32:20,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-08 06:32:20,034 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-08 06:32:20,034 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-08 06:32:20,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-08 06:32:20,034 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-08 06:32:20,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-08 06:32:20,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-08 06:32:20,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-08 06:32:20,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-08 06:32:20,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 06:32:20,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-08 06:32:20,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-08 06:32:20,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-08 06:32:20,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-08 06:32:20,036 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-08 06:32:20,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-08 06:32:20,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-08 06:32:20,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-08 06:32:20,036 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-08 06:32:20,036 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-08 06:32:20,038 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: Positions where we compute the Hoare Annotation -> None 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-09-08 06:32:20,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-08 06:32:20,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-08 06:32:20,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-08 06:32:20,241 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-08 06:32:20,242 INFO L274 PluginConnector]: CDTParser initialized [2024-09-08 06:32:20,243 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-09-08 06:32:21,445 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-08 06:32:21,659 INFO L384 CDTParser]: Found 1 translation units. [2024-09-08 06:32:21,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i [2024-09-08 06:32:21,674 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d850dec08/aeaca7347cbe477dac95289ddafc9016/FLAGf50f9454d [2024-09-08 06:32:21,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d850dec08/aeaca7347cbe477dac95289ddafc9016 [2024-09-08 06:32:21,692 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-08 06:32:21,693 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-08 06:32:21,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-09-02_08-21-23.files/protection-local/26_stack_cas_longer-1.yml/witness.yml [2024-09-08 06:32:21,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-08 06:32:21,738 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-08 06:32:21,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-08 06:32:21,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-08 06:32:21,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-08 06:32:21,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:32:21" (1/2) ... [2024-09-08 06:32:21,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69dcb357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:32:21, skipping insertion in model container [2024-09-08 06:32:21,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:32:21" (1/2) ... [2024-09-08 06:32:21,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@38a939ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:32:21, skipping insertion in model container [2024-09-08 06:32:21,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 06:32:21" (2/2) ... [2024-09-08 06:32:21,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69dcb357 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:32:21, skipping insertion in model container [2024-09-08 06:32:21,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 06:32:21" (2/2) ... [2024-09-08 06:32:21,764 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-08 06:32:21,766 INFO L1541 ArrayList]: Location invariant before [L751-L751] (m == 0 || m == 1) && (m2 == 0 || m2 == 1) [2024-09-08 06:32:21,803 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-08 06:32:22,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 06:32:22,113 INFO L200 MainTranslator]: Completed pre-run Start Parsing Local [2024-09-08 06:32:22,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 06:32:22,247 INFO L204 MainTranslator]: Completed translation [2024-09-08 06:32:22,247 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:32:22 WrapperNode [2024-09-08 06:32:22,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-08 06:32:22,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-08 06:32:22,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-08 06:32:22,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-08 06:32:22,253 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 08.09 06:32:22" (1/1) ... [2024-09-08 06:32:22,268 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 08.09 06:32:22" (1/1) ... [2024-09-08 06:32:22,294 INFO L138 Inliner]: procedures = 179, calls = 51, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 200 [2024-09-08 06:32:22,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-08 06:32:22,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-08 06:32:22,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-08 06:32:22,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-08 06:32:22,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:32:22" (1/1) ... [2024-09-08 06:32:22,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:32:22" (1/1) ... [2024-09-08 06:32:22,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:32:22" (1/1) ... [2024-09-08 06:32:22,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:32:22" (1/1) ... [2024-09-08 06:32:22,312 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:32:22" (1/1) ... [2024-09-08 06:32:22,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:32:22" (1/1) ... [2024-09-08 06:32:22,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:32:22" (1/1) ... [2024-09-08 06:32:22,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:32:22" (1/1) ... [2024-09-08 06:32:22,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-08 06:32:22,320 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-08 06:32:22,320 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-08 06:32:22,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-08 06:32:22,322 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:32:22" (1/1) ... [2024-09-08 06:32:22,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 06:32:22,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:32:22,350 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-09-08 06:32:22,352 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-09-08 06:32:22,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-09-08 06:32:22,385 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-09-08 06:32:22,385 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-09-08 06:32:22,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-09-08 06:32:22,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-08 06:32:22,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-08 06:32:22,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-08 06:32:22,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-08 06:32:22,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-08 06:32:22,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-08 06:32:22,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-08 06:32:22,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-08 06:32:22,387 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-08 06:32:22,489 INFO L242 CfgBuilder]: Building ICFG [2024-09-08 06:32:22,491 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-08 06:32:22,746 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-08 06:32:22,746 INFO L291 CfgBuilder]: Performing block encoding [2024-09-08 06:32:22,913 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-08 06:32:22,913 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-08 06:32:22,914 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:32:22 BoogieIcfgContainer [2024-09-08 06:32:22,915 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-08 06:32:22,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-08 06:32:22,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-08 06:32:22,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-08 06:32:22,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:32:21" (1/4) ... [2024-09-08 06:32:22,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35069ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:32:22, skipping insertion in model container [2024-09-08 06:32:22,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 06:32:21" (2/4) ... [2024-09-08 06:32:22,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35069ac9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 06:32:22, skipping insertion in model container [2024-09-08 06:32:22,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:32:22" (3/4) ... [2024-09-08 06:32:22,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35069ac9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 06:32:22, skipping insertion in model container [2024-09-08 06:32:22,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:32:22" (4/4) ... [2024-09-08 06:32:22,924 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longer-1.i [2024-09-08 06:32:22,940 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-08 06:32:22,941 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-08 06:32:22,941 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-08 06:32:22,981 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 06:32:23,016 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 06:32:23,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 06:32:23,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:32:23,019 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-09-08 06:32:23,020 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-09-08 06:32:23,047 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 06:32:23,057 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-09-08 06:32:23,068 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@66327933, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 06:32:23,068 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 06:32:23,190 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:32:23,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:23,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1521780113, now seen corresponding path program 1 times [2024-09-08 06:32:23,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:23,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155699525] [2024-09-08 06:32:23,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:23,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:23,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:23,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:23,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155699525] [2024-09-08 06:32:23,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155699525] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:32:23,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:32:23,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 06:32:23,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273396312] [2024-09-08 06:32:23,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:32:23,517 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 06:32:23,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:23,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 06:32:23,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 06:32:23,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:23,541 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:23,541 INFO L475 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-09-08 06:32:23,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:23,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:23,573 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-08 06:32:23,574 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:32:23,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:23,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1823734536, now seen corresponding path program 1 times [2024-09-08 06:32:23,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:23,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869186744] [2024-09-08 06:32:23,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:23,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:23,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:23,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869186744] [2024-09-08 06:32:23,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869186744] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:32:23,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896920524] [2024-09-08 06:32:23,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:23,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:32:23,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:32:23,903 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-09-08 06:32:23,905 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-09-08 06:32:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:24,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-08 06:32:24,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:32:24,097 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-09-08 06:32:24,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:24,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-08 06:32:24,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:24,211 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-09-08 06:32:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:24,307 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 06:32:24,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896920524] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:32:24,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-08 06:32:24,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2024-09-08 06:32:24,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558708954] [2024-09-08 06:32:24,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:32:24,310 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 06:32:24,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:24,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 06:32:24,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-09-08 06:32:24,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:24,312 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:24,312 INFO L475 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-09-08 06:32:24,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:24,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:24,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:24,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:24,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-08 06:32:24,584 WARN L456 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-09-08 06:32:24,584 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:32:24,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:24,585 INFO L85 PathProgramCache]: Analyzing trace with hash 925778014, now seen corresponding path program 1 times [2024-09-08 06:32:24,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:24,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725030023] [2024-09-08 06:32:24,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:24,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:24,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 06:32:24,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:24,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725030023] [2024-09-08 06:32:24,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725030023] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:32:24,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:32:24,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 06:32:24,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936850336] [2024-09-08 06:32:24,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:32:24,683 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 06:32:24,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:24,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 06:32:24,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 06:32:24,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:24,685 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:24,685 INFO L475 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-09-08 06:32:24,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:24,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:24,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:24,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:24,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:24,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:24,791 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-08 06:32:24,791 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:32:24,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:24,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1291862496, now seen corresponding path program 1 times [2024-09-08 06:32:24,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:24,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032646736] [2024-09-08 06:32:24,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:24,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:24,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:24,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:24,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032646736] [2024-09-08 06:32:24,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032646736] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:32:24,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218061618] [2024-09-08 06:32:24,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:24,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:32:24,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:32:24,881 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-09-08 06:32:24,883 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-09-08 06:32:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:24,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-08 06:32:24,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:32:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:25,060 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:32:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:25,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218061618] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:32:25,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 06:32:25,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-08 06:32:25,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879514931] [2024-09-08 06:32:25,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 06:32:25,114 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-08 06:32:25,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:25,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-08 06:32:25,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-08 06:32:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:25,115 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:25,116 INFO L475 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-09-08 06:32:25,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:25,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:25,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:25,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:25,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:25,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-08 06:32:25,363 WARN L456 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-09-08 06:32:25,364 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:32:25,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:25,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1650478471, now seen corresponding path program 1 times [2024-09-08 06:32:25,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:25,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091114315] [2024-09-08 06:32:25,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:25,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:25,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:25,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:25,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091114315] [2024-09-08 06:32:25,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091114315] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:32:25,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653853972] [2024-09-08 06:32:25,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:25,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:32:25,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:32:25,748 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-09-08 06:32:25,749 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-09-08 06:32:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:25,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-08 06:32:25,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:32:25,904 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 06:32:25,905 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-09-08 06:32:26,021 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-09-08 06:32:26,024 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-09-08 06:32:26,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:26,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:32:26,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:32:26,207 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-09-08 06:32:26,214 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-09-08 06:32:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:26,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653853972] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:32:26,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 06:32:26,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2024-09-08 06:32:26,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084609190] [2024-09-08 06:32:26,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 06:32:26,371 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-08 06:32:26,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:26,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-08 06:32:26,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=467, Unknown=2, NotChecked=0, Total=552 [2024-09-08 06:32:26,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:26,372 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:26,373 INFO L475 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-09-08 06:32:26,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:26,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:26,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:26,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:26,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:26,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:26,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:26,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:26,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:26,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-08 06:32:26,715 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 1 remaining) [2024-09-08 06:32:26,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-08 06:32:26,916 WARN L456 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-09-08 06:32:26,923 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-09-08 06:32:26,924 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-09-08 06:32:26,927 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 06:32:26,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 06:32:26,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:32:26,930 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-09-08 06:32:26,940 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-09-08 06:32:26,942 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 06:32:26,942 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 06:32:26,943 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@66327933, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 06:32:26,943 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 06:32:26,999 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 06:32:27,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash -837336820, now seen corresponding path program 1 times [2024-09-08 06:32:27,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:27,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042168059] [2024-09-08 06:32:27,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:27,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:27,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:27,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:27,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042168059] [2024-09-08 06:32:27,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042168059] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:32:27,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:32:27,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 06:32:27,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550212349] [2024-09-08 06:32:27,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:32:27,028 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 06:32:27,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:27,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 06:32:27,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 06:32:27,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:27,030 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:27,030 INFO L475 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-09-08 06:32:27,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:27,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:27,050 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-08 06:32:27,050 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 06:32:27,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:27,051 INFO L85 PathProgramCache]: Analyzing trace with hash -828712491, now seen corresponding path program 1 times [2024-09-08 06:32:27,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:27,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898685910] [2024-09-08 06:32:27,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:27,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 06:32:27,066 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 06:32:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 06:32:27,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-08 06:32:27,096 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 06:32:27,097 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-08 06:32:27,097 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-08 06:32:27,099 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1] [2024-09-08 06:32:27,100 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-09-08 06:32:27,101 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-08 06:32:27,101 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-09-08 06:32:27,134 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 06:32:27,138 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 06:32:27,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 06:32:27,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:32:27,140 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-09-08 06:32:27,141 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-09-08 06:32:27,147 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 06:32:27,147 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 06:32:27,147 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@66327933, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 06:32:27,147 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 06:32:27,325 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 06:32:27,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:27,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1218277817, now seen corresponding path program 1 times [2024-09-08 06:32:27,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:27,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862257282] [2024-09-08 06:32:27,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:27,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:27,367 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 06:32:27,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:27,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862257282] [2024-09-08 06:32:27,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862257282] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:32:27,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:32:27,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 06:32:27,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104986319] [2024-09-08 06:32:27,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:32:27,368 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 06:32:27,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:27,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 06:32:27,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 06:32:27,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:27,369 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:27,369 INFO L475 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-09-08 06:32:27,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:27,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:27,409 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-08 06:32:27,410 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 06:32:27,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:27,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1105059173, now seen corresponding path program 1 times [2024-09-08 06:32:27,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:27,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298639611] [2024-09-08 06:32:27,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:27,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:27,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:27,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298639611] [2024-09-08 06:32:27,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298639611] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:32:27,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437821533] [2024-09-08 06:32:27,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:27,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:32:27,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:32:27,479 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-09-08 06:32:27,480 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-09-08 06:32:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:27,582 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-08 06:32:27,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:32:27,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:27,616 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:32:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:27,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437821533] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:32:27,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 06:32:27,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-08 06:32:27,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540697408] [2024-09-08 06:32:27,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 06:32:27,652 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-08 06:32:27,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:27,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-08 06:32:27,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-08 06:32:27,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:27,652 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:27,652 INFO L475 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-09-08 06:32:27,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:27,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:27,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:27,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:27,735 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-09-08 06:32:27,921 WARN L456 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-09-08 06:32:27,922 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 06:32:27,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:27,922 INFO L85 PathProgramCache]: Analyzing trace with hash -904601861, now seen corresponding path program 1 times [2024-09-08 06:32:27,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:27,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804691453] [2024-09-08 06:32:27,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:27,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:28,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 06:32:28,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:28,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804691453] [2024-09-08 06:32:28,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804691453] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:32:28,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:32:28,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 06:32:28,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547311546] [2024-09-08 06:32:28,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:32:28,004 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 06:32:28,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:28,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 06:32:28,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-08 06:32:28,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:28,004 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:28,005 INFO L475 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-09-08 06:32:28,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:28,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:28,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:28,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:28,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:28,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:28,049 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-08 06:32:28,050 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 06:32:28,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:28,050 INFO L85 PathProgramCache]: Analyzing trace with hash -999344735, now seen corresponding path program 1 times [2024-09-08 06:32:28,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:28,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436851506] [2024-09-08 06:32:28,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:28,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:28,244 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:28,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:28,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436851506] [2024-09-08 06:32:28,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436851506] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:32:28,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653314407] [2024-09-08 06:32:28,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:28,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:32:28,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:32:28,246 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-09-08 06:32:28,248 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-09-08 06:32:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:28,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-08 06:32:28,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:32:28,465 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-09-08 06:32:28,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:28,539 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-09-08 06:32:28,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:28,566 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-09-08 06:32:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:28,599 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:32:28,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:32:28,756 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-09-08 06:32:28,762 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-09-08 06:32:28,811 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-09-08 06:32:28,826 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-09-08 06:32:28,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:32:28,839 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-09-08 06:32:28,842 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-09-08 06:32:28,847 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-09-08 06:32:28,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2024-09-08 06:32:28,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:32:28,885 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-09-08 06:32:28,888 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-09-08 06:32:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-09-08 06:32:29,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653314407] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:32:29,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 06:32:29,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 22 [2024-09-08 06:32:29,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520238711] [2024-09-08 06:32:29,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 06:32:29,045 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-08 06:32:29,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:29,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-08 06:32:29,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=280, Unknown=11, NotChecked=114, Total=506 [2024-09-08 06:32:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:29,046 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:29,046 INFO L475 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-09-08 06:32:29,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:29,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:29,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:29,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:29,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:29,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:29,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:29,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-08 06:32:29,493 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-09-08 06:32:29,683 WARN L456 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-09-08 06:32:29,683 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 06:32:29,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:29,684 INFO L85 PathProgramCache]: Analyzing trace with hash -323185154, now seen corresponding path program 1 times [2024-09-08 06:32:29,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:29,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381326340] [2024-09-08 06:32:29,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:29,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 06:32:29,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:29,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381326340] [2024-09-08 06:32:29,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381326340] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:32:29,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:32:29,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 06:32:29,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57552131] [2024-09-08 06:32:29,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:32:29,775 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 06:32:29,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:29,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 06:32:29,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 06:32:29,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:29,777 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:29,777 INFO L475 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-09-08 06:32:29,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:29,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:29,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:29,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-09-08 06:32:29,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:29,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-08 06:32:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:29,920 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-08 06:32:29,920 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 06:32:29,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:29,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1323347906, now seen corresponding path program 1 times [2024-09-08 06:32:29,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:29,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647466299] [2024-09-08 06:32:29,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:29,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:30,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:30,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647466299] [2024-09-08 06:32:30,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647466299] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:32:30,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874889073] [2024-09-08 06:32:30,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:30,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:32:30,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:32:30,233 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-09-08 06:32:30,234 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-09-08 06:32:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:30,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-08 06:32:30,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:32:30,388 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 06:32:30,389 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-09-08 06:32:30,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-09-08 06:32:30,503 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-09-08 06:32:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:30,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:32:30,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:32:30,637 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-09-08 06:32:30,638 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-09-08 06:32:30,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:30,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874889073] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:32:30,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 06:32:30,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2024-09-08 06:32:30,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891879282] [2024-09-08 06:32:30,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 06:32:30,798 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-08 06:32:30,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:30,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-08 06:32:30,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=471, Unknown=3, NotChecked=0, Total=552 [2024-09-08 06:32:30,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:30,799 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:30,799 INFO L475 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-09-08 06:32:30,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:30,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:30,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:30,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-09-08 06:32:30,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:30,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:31,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-08 06:32:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:31,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:32:31,214 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-09-08 06:32:31,401 WARN L456 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-09-08 06:32:31,402 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 06:32:31,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:31,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1233754093, now seen corresponding path program 1 times [2024-09-08 06:32:31,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:31,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631208447] [2024-09-08 06:32:31,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:31,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 06:32:31,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 06:32:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 06:32:31,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-08 06:32:31,452 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 06:32:31,452 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-08 06:32:31,452 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-08 06:32:31,453 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-09-08 06:32:31,453 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-09-08 06:32:31,453 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-08 06:32:31,453 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-09-08 06:32:31,488 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 06:32:31,490 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 06:32:31,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 06:32:31,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:32:31,492 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-09-08 06:32:31,493 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-09-08 06:32:31,494 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 06:32:31,495 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-09-08 06:32:31,495 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@66327933, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 06:32:31,495 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 06:32:31,775 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:32:31,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:31,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1653505405, now seen corresponding path program 1 times [2024-09-08 06:32:31,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:31,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701789781] [2024-09-08 06:32:31,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:31,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 06:32:31,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:31,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701789781] [2024-09-08 06:32:31,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701789781] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:32:31,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:32:31,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 06:32:31,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379106290] [2024-09-08 06:32:31,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:32:31,845 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 06:32:31,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:31,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 06:32:31,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 06:32:31,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:31,846 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:31,846 INFO L475 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-09-08 06:32:31,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:31,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:31,907 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-08 06:32:31,907 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:32:31,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:31,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1329674543, now seen corresponding path program 1 times [2024-09-08 06:32:31,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:31,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400330150] [2024-09-08 06:32:31,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:31,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:31,970 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 06:32:31,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:31,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400330150] [2024-09-08 06:32:31,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400330150] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:32:31,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494601854] [2024-09-08 06:32:31,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:31,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:32:31,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:32:31,972 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-09-08 06:32:31,977 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-09-08 06:32:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:32,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-08 06:32:32,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:32:32,151 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 06:32:32,152 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:32:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 06:32:32,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494601854] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:32:32,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 06:32:32,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-08 06:32:32,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308767528] [2024-09-08 06:32:32,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 06:32:32,186 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-08 06:32:32,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:32,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-08 06:32:32,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-08 06:32:32,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:32,187 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:32,187 INFO L475 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-09-08 06:32:32,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:32,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:32,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:32,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:32,285 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-09-08 06:32:32,472 WARN L456 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-09-08 06:32:32,473 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:32:32,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:32,473 INFO L85 PathProgramCache]: Analyzing trace with hash -770286953, now seen corresponding path program 1 times [2024-09-08 06:32:32,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:32,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673362907] [2024-09-08 06:32:32,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:32,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:32,598 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-08 06:32:32,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:32,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673362907] [2024-09-08 06:32:32,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673362907] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:32:32,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:32:32,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 06:32:32,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683953007] [2024-09-08 06:32:32,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:32:32,599 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 06:32:32,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:32,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 06:32:32,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-08 06:32:32,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:32,600 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:32,601 INFO L475 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-09-08 06:32:32,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:32,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:32,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:32,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:32,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:32,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:32,766 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-08 06:32:32,766 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:32:32,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:32,766 INFO L85 PathProgramCache]: Analyzing trace with hash 222230507, now seen corresponding path program 1 times [2024-09-08 06:32:32,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:32,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550700262] [2024-09-08 06:32:32,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:32,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:32,875 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 06:32:32,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:32,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550700262] [2024-09-08 06:32:32,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550700262] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:32:32,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:32:32,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 06:32:32,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439157979] [2024-09-08 06:32:32,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:32:32,876 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 06:32:32,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:32,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 06:32:32,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 06:32:32,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:32,877 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:32,877 INFO L475 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-09-08 06:32:32,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:32,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:32,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:32,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:33,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:33,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:33,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:33,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:33,042 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-08 06:32:33,042 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:32:33,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:33,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1791435089, now seen corresponding path program 1 times [2024-09-08 06:32:33,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:33,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135188858] [2024-09-08 06:32:33,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:33,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-08 06:32:33,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:33,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135188858] [2024-09-08 06:32:33,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135188858] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:32:33,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531438601] [2024-09-08 06:32:33,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:33,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:32:33,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:32:33,491 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-09-08 06:32:33,492 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-09-08 06:32:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:33,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-09-08 06:32:33,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:32:33,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 06:32:33,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:33,764 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-09-08 06:32:33,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:33,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-08 06:32:33,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:33,879 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-09-08 06:32:33,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:33,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-08 06:32:34,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:34,040 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-09-08 06:32:34,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:34,178 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 06:32:34,178 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-09-08 06:32:34,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:34,267 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 06:32:34,267 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-09-08 06:32:34,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:34,348 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 06:32:34,349 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-09-08 06:32:34,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:34,463 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-09-08 06:32:34,463 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-09-08 06:32:34,872 INFO L349 Elim1Store]: treesize reduction 160, result has 30.1 percent of original size [2024-09-08 06:32:34,873 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-09-08 06:32:34,924 INFO L349 Elim1Store]: treesize reduction 68, result has 39.3 percent of original size [2024-09-08 06:32:34,924 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-09-08 06:32:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:35,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:32:35,706 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-09-08 06:32:35,718 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-09-08 06:32:35,723 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-09-08 06:32:35,729 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-09-08 06:32:35,765 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-09-08 06:32:36,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:32:36,751 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-09-08 06:32:36,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:32:36,773 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-09-08 06:32:36,786 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-09-08 06:32:36,793 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-09-08 06:32:36,800 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-09-08 06:32:36,807 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-09-08 06:32:36,836 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-09-08 06:32:36,843 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-09-08 06:32:36,850 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-09-08 06:32:37,068 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:37,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531438601] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:32:37,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 06:32:37,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 20] total 48 [2024-09-08 06:32:37,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373607646] [2024-09-08 06:32:37,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 06:32:37,069 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-09-08 06:32:37,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:37,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-09-08 06:32:37,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1628, Unknown=24, NotChecked=440, Total=2352 [2024-09-08 06:32:37,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:37,070 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:37,070 INFO L475 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-09-08 06:32:37,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:37,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:37,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:37,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:37,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:37,531 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (= 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 ((.cse21 (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 .cse21 |c_~#top~0.base| (store (select .cse21 |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))))) (.cse13 (not (= c_~state~0 1))) (.cse6 (not .cse4))) (let ((.cse1 (or .cse6 (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 ((.cse20 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_10))) (or (not (= (select (select (store (let ((.cse19 (store (select (store (store .cse20 |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| .cse19) |c_~#top~0.base| (store (select (store (store .cse20 |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .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 .cse20 |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0))))))) (.cse2 (or .cse7 .cse13)) (.cse0 (= |c_thr1Thread1of3ForFork0_index_malloc_~curr_alloc_idx~0#1| 0))) (and (or .cse0 (and .cse1 .cse2)) (= |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 ((.cse3 (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 .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))) .cse4) (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 ((.cse5 (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| .cse5) |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| .cse5) |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)))) .cse6) (or .cse7 .cse4) (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))) .cse1 (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 ((.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))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse6) (or (= c_~next_alloc_idx~0 0) (let ((.cse11 (+ c_~next_alloc_idx~0 2))) (and (or .cse6 (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 ((.cse10 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_10))) (let ((.cse9 (store (select (store (store .cse10 |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| .cse9) |c_~#top~0.base| (store (select (store (store .cse10 |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse9) |c_~#top~0.base|) |c_~#top~0.offset| .cse11)))) |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 ((.cse12 (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 .cse12 |c_~#top~0.base| (store (select .cse12 |c_~#top~0.base|) |c_~#top~0.offset| .cse11))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) .cse13)))) (not (= |c_thr1Thread2of3ForFork0_push_~newTop~0#1| 0)) (or .cse4 (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 ((.cse14 (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 .cse14 |c_~#top~0.base| (store (select .cse14 |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))))) (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 ((.cse15 (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| .cse15) |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| .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 |c_#memory_int| |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)))) .cse6) .cse2 (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 ((.cse17 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_10))) (let ((.cse16 (store (select (store (store .cse17 |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| .cse16) |c_~#top~0.base| (store (select (store (store .cse17 |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse16) |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)))) .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_ArrVal_808 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse18 (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 .cse18 |c_~#top~0.base| (store (select .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 (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)))) .cse13))) (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-09-08 06:32:37,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:37,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:37,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:37,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:37,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:32:37,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-09-08 06:32:37,982 WARN L456 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-09-08 06:32:37,982 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:32:37,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:37,983 INFO L85 PathProgramCache]: Analyzing trace with hash 801107341, now seen corresponding path program 2 times [2024-09-08 06:32:37,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:37,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763642984] [2024-09-08 06:32:37,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:37,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:38,212 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 06:32:38,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:38,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763642984] [2024-09-08 06:32:38,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763642984] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:32:38,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551007936] [2024-09-08 06:32:38,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 06:32:38,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:32:38,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:32:38,214 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-09-08 06:32:38,215 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-09-08 06:32:38,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 06:32:38,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 06:32:38,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-08 06:32:38,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:32:38,434 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-09-08 06:32:38,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:38,457 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-09-08 06:32:38,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:38,465 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-09-08 06:32:38,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:38,471 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-09-08 06:32:38,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:38,483 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-09-08 06:32:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 06:32:38,531 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 06:32:38,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551007936] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:32:38,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-08 06:32:38,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-09-08 06:32:38,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421623684] [2024-09-08 06:32:38,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:32:38,532 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 06:32:38,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:38,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 06:32:38,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-09-08 06:32:38,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:38,533 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:38,533 INFO L475 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-09-08 06:32:38,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:38,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:38,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:38,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:38,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:32:38,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:38,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:38,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:38,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:38,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:38,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:32:38,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:38,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-09-08 06:32:38,919 WARN L456 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-09-08 06:32:38,920 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:32:38,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:38,920 INFO L85 PathProgramCache]: Analyzing trace with hash -765518316, now seen corresponding path program 2 times [2024-09-08 06:32:38,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:38,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451197647] [2024-09-08 06:32:38,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:38,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 06:32:39,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:39,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451197647] [2024-09-08 06:32:39,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451197647] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:32:39,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227885768] [2024-09-08 06:32:39,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 06:32:39,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:32:39,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:32:39,334 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-09-08 06:32:39,334 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-09-08 06:32:39,461 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-08 06:32:39,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 06:32:39,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-08 06:32:39,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:32:39,699 INFO L349 Elim1Store]: treesize reduction 96, result has 35.6 percent of original size [2024-09-08 06:32:39,699 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-09-08 06:32:39,716 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-09-08 06:32:39,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:39,749 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-09-08 06:32:39,780 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-08 06:32:39,782 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-09-08 06:32:39,824 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-08 06:32:39,825 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-09-08 06:32:39,868 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-09-08 06:32:39,876 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-09-08 06:32:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-08 06:32:40,151 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 06:32:40,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227885768] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:32:40,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-08 06:32:40,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2024-09-08 06:32:40,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373149013] [2024-09-08 06:32:40,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:32:40,151 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 06:32:40,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:40,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 06:32:40,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-09-08 06:32:40,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:40,152 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:40,152 INFO L475 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-09-08 06:32:40,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:40,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:40,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:40,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:40,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:32:40,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:40,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:40,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:40,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:40,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:40,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:40,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:32:40,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:40,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:40,432 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-09-08 06:32:40,620 WARN L456 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-09-08 06:32:40,621 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:32:40,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:40,621 INFO L85 PathProgramCache]: Analyzing trace with hash 882666815, now seen corresponding path program 1 times [2024-09-08 06:32:40,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:40,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361828858] [2024-09-08 06:32:40,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:40,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-08 06:32:40,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:40,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361828858] [2024-09-08 06:32:40,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361828858] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:32:40,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:32:40,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 06:32:40,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026569089] [2024-09-08 06:32:40,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:32:40,744 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 06:32:40,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:40,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 06:32:40,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 06:32:40,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:40,745 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:40,745 INFO L475 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-09-08 06:32:40,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:40,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:40,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:40,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:40,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:32:40,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:40,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:40,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:40,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:40,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:32:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:40,983 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-09-08 06:32:40,983 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:32:40,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:40,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1259604423, now seen corresponding path program 1 times [2024-09-08 06:32:40,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:40,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143228827] [2024-09-08 06:32:40,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:40,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 06:32:41,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:41,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143228827] [2024-09-08 06:32:41,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143228827] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:32:41,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061746233] [2024-09-08 06:32:41,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:41,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:32:41,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:32:41,102 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-09-08 06:32:41,103 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-09-08 06:32:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:41,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-08 06:32:41,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:32:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 06:32:41,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:32:41,481 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 06:32:41,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061746233] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:32:41,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 06:32:41,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-09-08 06:32:41,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764130083] [2024-09-08 06:32:41,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 06:32:41,481 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-08 06:32:41,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:41,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-08 06:32:41,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-08 06:32:41,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:41,482 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:41,482 INFO L475 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-09-08 06:32:41,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:41,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:41,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:41,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:41,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:32:41,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:41,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:41,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:41,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:32:41,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:41,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:41,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:41,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 06:32:41,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-09-08 06:32:41,796 WARN L456 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-09-08 06:32:41,796 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:32:41,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:41,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1176978261, now seen corresponding path program 1 times [2024-09-08 06:32:41,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:41,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400261368] [2024-09-08 06:32:41,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:41,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-08 06:32:42,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:42,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400261368] [2024-09-08 06:32:42,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400261368] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:32:42,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542315746] [2024-09-08 06:32:42,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:42,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:32:42,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:32:42,062 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-09-08 06:32:42,063 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-09-08 06:32:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:42,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-08 06:32:42,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:32:42,297 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-09-08 06:32:42,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:42,339 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-09-08 06:32:42,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:42,382 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-09-08 06:32:42,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:42,419 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-09-08 06:32:42,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:42,498 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-09-08 06:32:42,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:42,558 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-09-08 06:32:42,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:42,631 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-09-08 06:32:42,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:42,660 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-09-08 06:32:42,690 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 06:32:42,690 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-09-08 06:32:42,836 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-09-08 06:32:42,838 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-09-08 06:32:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 06:32:42,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:32:42,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:32:42,978 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-09-08 06:32:42,979 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-09-08 06:32:42,982 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-09-08 06:32:43,095 WARN L854 $PredicateComparison]: unable to prove that (and (or (not (= c_~next_alloc_idx~0 0)) (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)))) is different from false [2024-09-08 06:32:43,126 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= c_~next_alloc_idx~0 0)))) (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)))) (or (and (forall ((v_prenex_107 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_15) |c_~#m2~0.base| v_prenex_107) |c_~#top~0.base|) 0) 1) 0))) (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int)) (v_DerPreprocessor_15 (Array Int Int))) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_15) |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0))))) (not (= c_~state~0 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))))) is different from false [2024-09-08 06:32:43,461 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-09-08 06:32:43,481 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-09-08 06:32:43,502 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-09-08 06:32:43,556 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-09-08 06:32:43,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:32:43,741 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-09-08 06:32:43,783 INFO L349 Elim1Store]: treesize reduction 22, result has 60.0 percent of original size [2024-09-08 06:32:43,783 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-09-08 06:32:43,798 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-09-08 06:32:43,808 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-09-08 06:32:43,817 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-09-08 06:32:43,827 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-09-08 06:32:43,841 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-09-08 06:32:43,853 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-09-08 06:32:43,862 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-09-08 06:32:43,871 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-09-08 06:32:43,882 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-09-08 06:32:44,059 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-09-08 06:32:44,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542315746] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:32:44,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 06:32:44,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 37 [2024-09-08 06:32:44,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127576281] [2024-09-08 06:32:44,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 06:32:44,060 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-09-08 06:32:44,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:44,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-09-08 06:32:44,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=877, Unknown=8, NotChecked=390, Total=1406 [2024-09-08 06:32:44,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:44,063 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:44,063 INFO L475 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-09-08 06:32:44,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:44,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:44,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:44,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:44,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:32:44,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:44,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:44,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:44,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 06:32:44,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:44,938 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 ((.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 |c_#memory_int| |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0))))) (.cse11 (not (= c_~state~0 1))) (.cse4 (not .cse6))) (let ((.cse1 (or .cse4 (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 ((.cse18 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_10))) (or (not (= (select (select (store (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 .cse18 |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0))))))) (.cse2 (or .cse5 .cse11)) (.cse0 (= |c_thr1Thread1of3ForFork0_index_malloc_~curr_alloc_idx~0#1| 0))) (and (or .cse0 (and .cse1 .cse2)) (= |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 ((.cse3 (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| .cse3) |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| .cse3) |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)))) .cse4) (or .cse5 .cse6) .cse1 (or (= c_~next_alloc_idx~0 0) (let ((.cse9 (+ c_~next_alloc_idx~0 2))) (and (or .cse4 (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 ((.cse8 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_10))) (let ((.cse7 (store (select (store (store .cse8 |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| .cse7) |c_~#top~0.base| (store (select (store (store .cse8 |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse7) |c_~#top~0.base|) |c_~#top~0.offset| .cse9)))) |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 ((.cse10 (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 .cse10 |c_~#top~0.base| (store (select .cse10 |c_~#top~0.base|) |c_~#top~0.offset| .cse9))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) .cse11)))) (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 ((.cse12 (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 .cse12 |c_~#top~0.base| (store (select .cse12 |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))))) (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 ((.cse13 (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| .cse13) |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| .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 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)))) .cse4) .cse2 (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 ((.cse15 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_10))) (let ((.cse14 (store (select (store (store .cse15 |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| .cse14) |c_~#top~0.base| (store (select (store (store .cse15 |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse14) |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)))) .cse4) (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 ((.cse16 (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 .cse16 |c_~#top~0.base| (store (select .cse16 |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)))) .cse11))))))) is different from false [2024-09-08 06:32:45,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:45,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:45,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:45,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:45,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-08 06:32:45,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:45,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:45,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:45,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 06:32:45,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:32:45,654 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-09-08 06:32:45,840 WARN L456 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-09-08 06:32:45,841 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:32:45,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:45,841 INFO L85 PathProgramCache]: Analyzing trace with hash 425971427, now seen corresponding path program 1 times [2024-09-08 06:32:45,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:45,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910638348] [2024-09-08 06:32:45,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:45,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:45,953 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-08 06:32:45,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:45,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910638348] [2024-09-08 06:32:45,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910638348] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:32:45,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:32:45,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 06:32:45,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299706989] [2024-09-08 06:32:45,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:32:45,954 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 06:32:45,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:45,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 06:32:45,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 06:32:45,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:45,955 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:45,955 INFO L475 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-09-08 06:32:45,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:45,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:45,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:45,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:45,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-09-08 06:32:45,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:45,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:45,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:45,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 06:32:45,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:32:45,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:46,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:46,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:46,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:46,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:46,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 06:32:46,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:46,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:46,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:46,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 06:32:46,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:32:46,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:46,434 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-09-08 06:32:46,435 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:32:46,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:46,435 INFO L85 PathProgramCache]: Analyzing trace with hash 701199428, now seen corresponding path program 1 times [2024-09-08 06:32:46,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:46,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785912844] [2024-09-08 06:32:46,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:46,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:47,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:47,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785912844] [2024-09-08 06:32:47,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785912844] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:32:47,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672621447] [2024-09-08 06:32:47,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:47,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:32:47,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:32:47,100 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-09-08 06:32:47,101 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-09-08 06:32:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:47,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-08 06:32:47,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:32:47,409 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 06:32:47,409 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-09-08 06:32:47,534 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-09-08 06:32:47,536 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-09-08 06:32:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:47,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:32:47,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:32:47,662 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-09-08 06:32:47,664 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-09-08 06:32:47,666 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-09-08 06:32:47,808 INFO L349 Elim1Store]: treesize reduction 11, result has 60.7 percent of original size [2024-09-08 06:32:47,808 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-09-08 06:32:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:47,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672621447] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:32:47,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 06:32:47,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 37 [2024-09-08 06:32:47,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368026436] [2024-09-08 06:32:47,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 06:32:47,919 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-09-08 06:32:47,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:47,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-09-08 06:32:47,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1271, Unknown=2, NotChecked=0, Total=1406 [2024-09-08 06:32:47,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:47,920 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:47,920 INFO L475 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-09-08 06:32:47,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:47,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:47,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:47,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:47,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 06:32:47,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:47,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:47,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:47,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 06:32:47,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:32:47,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:47,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:50,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:50,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 06:32:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 06:32:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:32:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-08 06:32:50,061 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-09-08 06:32:50,248 WARN L456 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-09-08 06:32:50,248 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:32:50,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:50,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1378747720, now seen corresponding path program 1 times [2024-09-08 06:32:50,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:50,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692883095] [2024-09-08 06:32:50,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:50,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 06:32:50,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:50,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692883095] [2024-09-08 06:32:50,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692883095] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:32:50,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935427049] [2024-09-08 06:32:50,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:50,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:32:50,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:32:50,782 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-09-08 06:32:50,783 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-09-08 06:32:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:50,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-08 06:32:50,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:32:50,990 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 06:32:50,990 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-09-08 06:32:51,083 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-09-08 06:32:51,085 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-09-08 06:32:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 06:32:51,133 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:32:51,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:32:51,203 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-09-08 06:32:51,205 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-09-08 06:32:51,304 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 06:32:51,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935427049] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:32:51,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 06:32:51,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2024-09-08 06:32:51,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844934985] [2024-09-08 06:32:51,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 06:32:51,305 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-08 06:32:51,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:51,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-08 06:32:51,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=523, Unknown=2, NotChecked=0, Total=600 [2024-09-08 06:32:51,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:51,306 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:51,306 INFO L475 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-09-08 06:32:51,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:51,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:51,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:51,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:51,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 06:32:51,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:51,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:51,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:51,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 06:32:51,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:32:51,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:51,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-09-08 06:32:51,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:53,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:53,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:53,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:53,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:53,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 06:32:53,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:53,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:53,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:53,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 06:32:53,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:32:53,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:53,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-09-08 06:32:53,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-08 06:32:53,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-09-08 06:32:54,080 WARN L456 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-09-08 06:32:54,080 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:32:54,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:54,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1085853016, now seen corresponding path program 1 times [2024-09-08 06:32:54,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:54,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756251203] [2024-09-08 06:32:54,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:54,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:54,467 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 06:32:54,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:54,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756251203] [2024-09-08 06:32:54,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756251203] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:32:54,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552526950] [2024-09-08 06:32:54,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:54,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:32:54,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:32:54,469 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-09-08 06:32:54,470 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-09-08 06:32:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:54,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-09-08 06:32:54,688 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:32:54,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:55,003 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 06:32:55,003 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-09-08 06:32:55,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:55,061 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 06:32:55,061 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-09-08 06:32:55,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:55,133 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 06:32:55,133 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-09-08 06:32:55,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:55,161 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 06:32:55,161 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-09-08 06:32:55,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:55,201 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 06:32:55,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 2 case distinctions, treesize of input 29 treesize of output 31 [2024-09-08 06:32:55,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:32:55,229 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 06:32:55,229 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-09-08 06:32:55,316 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-09-08 06:32:55,316 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-09-08 06:32:55,326 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-08 06:32:55,326 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-09-08 06:32:55,328 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-09-08 06:32:55,379 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:32:55,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:32:55,483 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-09-08 06:32:55,508 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-09-08 06:32:55,512 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-09-08 06:32:55,554 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-09-08 06:32:55,554 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-09-08 06:32:55,556 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-09-08 06:32:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2024-09-08 06:32:55,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552526950] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:32:55,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 06:32:55,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 13] total 35 [2024-09-08 06:32:55,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652096335] [2024-09-08 06:32:55,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 06:32:55,731 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-09-08 06:32:55,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:55,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-09-08 06:32:55,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=926, Unknown=8, NotChecked=192, Total=1260 [2024-09-08 06:32:55,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:55,732 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:55,732 INFO L475 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-09-08 06:32:55,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:55,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:55,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:55,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:55,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 06:32:55,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:55,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:55,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:55,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 06:32:55,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:32:55,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:55,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-09-08 06:32:55,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-09-08 06:32:55,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 06:32:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-08 06:32:59,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:32:59,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:59,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-09-08 06:32:59,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-08 06:32:59,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-09-08 06:32:59,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-09-08 06:32:59,210 WARN L456 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-09-08 06:32:59,210 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:32:59,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:32:59,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1994314252, now seen corresponding path program 1 times [2024-09-08 06:32:59,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:32:59,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427399175] [2024-09-08 06:32:59,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:32:59,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:32:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:32:59,403 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-09-08 06:32:59,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:32:59,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427399175] [2024-09-08 06:32:59,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427399175] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:32:59,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:32:59,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 06:32:59,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199110388] [2024-09-08 06:32:59,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:32:59,404 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 06:32:59,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:32:59,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 06:32:59,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 06:32:59,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:32:59,405 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:32:59,405 INFO L475 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-09-08 06:32:59,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:32:59,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:32:59,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:59,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:59,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 06:32:59,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:59,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:59,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:59,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-08 06:32:59,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:32:59,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:32:59,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2024-09-08 06:32:59,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-08 06:32:59,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-09-08 06:32:59,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:33:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:33:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:33:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 06:33:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:33:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:33:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2024-09-08 06:33:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-08 06:33:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-09-08 06:33:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:33:00,388 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-09-08 06:33:00,388 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:33:00,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:33:00,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1384830022, now seen corresponding path program 1 times [2024-09-08 06:33:00,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:33:00,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469309184] [2024-09-08 06:33:00,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:33:00,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:33:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:33:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-08 06:33:01,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:33:01,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469309184] [2024-09-08 06:33:01,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469309184] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:33:01,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707892000] [2024-09-08 06:33:01,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:33:01,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:33:01,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:33:01,494 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-09-08 06:33:01,496 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-09-08 06:33:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:33:01,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-08 06:33:01,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:33:02,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:33:02,050 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-09-08 06:33:02,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:33:02,062 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-09-08 06:33:02,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:33:02,094 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-09-08 06:33:02,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:33:02,109 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-09-08 06:33:02,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:33:02,156 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 06:33:02,156 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-09-08 06:33:02,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:33:02,199 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 06:33:02,199 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-09-08 06:33:02,205 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 06:33:02,205 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-09-08 06:33:02,366 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-09-08 06:33:02,369 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-09-08 06:33:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 48 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 06:33:02,434 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:33:02,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:33:02,519 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-09-08 06:33:02,520 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-09-08 06:33:02,523 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-09-08 06:33:02,603 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-09-08 06:33:02,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:33:02,625 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-09-08 06:33:02,627 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-09-08 06:33:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 32 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2024-09-08 06:33:02,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707892000] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:33:02,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 06:33:02,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 34 [2024-09-08 06:33:02,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035627318] [2024-09-08 06:33:02,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 06:33:02,743 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-09-08 06:33:02,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:33:02,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-09-08 06:33:02,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=992, Unknown=3, NotChecked=64, Total=1190 [2024-09-08 06:33:02,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:33:02,744 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:33:02,745 INFO L475 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-09-08 06:33:02,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:33:02,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:33:02,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:02,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:02,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 06:33:02,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:02,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:02,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:02,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:33:02,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:33:02,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:02,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2024-09-08 06:33:02,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-08 06:33:02,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-09-08 06:33:02,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:33:02,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:33:05,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:33:05,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:33:05,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:05,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:05,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 06:33:05,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:33:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:33:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-09-08 06:33:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-08 06:33:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-09-08 06:33:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:33:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 06:33:05,512 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-09-08 06:33:05,698 WARN L456 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-09-08 06:33:05,699 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:33:05,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:33:05,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2018876800, now seen corresponding path program 2 times [2024-09-08 06:33:05,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:33:05,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252914170] [2024-09-08 06:33:05,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:33:05,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:33:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:33:06,047 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 06:33:06,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:33:06,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252914170] [2024-09-08 06:33:06,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252914170] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:33:06,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890612897] [2024-09-08 06:33:06,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 06:33:06,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:33:06,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:33:06,049 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-09-08 06:33:06,050 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-09-08 06:33:06,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 06:33:06,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 06:33:06,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-08 06:33:06,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:33:06,504 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-08 06:33:06,505 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-09-08 06:33:06,529 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:33:06,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:33:06,776 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:33:06,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890612897] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:33:06,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 06:33:06,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 27 [2024-09-08 06:33:06,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939441103] [2024-09-08 06:33:06,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 06:33:06,778 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-08 06:33:06,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:33:06,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-08 06:33:06,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=644, Unknown=1, NotChecked=0, Total=756 [2024-09-08 06:33:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:33:06,779 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:33:06,779 INFO L475 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-09-08 06:33:06,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:33:06,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:33:06,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:06,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:06,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 06:33:06,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:06,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:06,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:06,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:33:06,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:33:06,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:06,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 122 states. [2024-09-08 06:33:06,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-08 06:33:06,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2024-09-08 06:33:06,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:33:06,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 06:33:06,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:33:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:33:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:33:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:33:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 06:33:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:33:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:33:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:33:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-09-08 06:33:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-08 06:33:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-09-08 06:33:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:33:10,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-08 06:33:10,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-08 06:33:10,051 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-09-08 06:33:10,238 WARN L456 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-09-08 06:33:10,238 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:33:10,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:33:10,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1087457335, now seen corresponding path program 1 times [2024-09-08 06:33:10,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:33:10,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946301789] [2024-09-08 06:33:10,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:33:10,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:33:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:33:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-08 06:33:10,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:33:10,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946301789] [2024-09-08 06:33:10,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946301789] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:33:10,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128546456] [2024-09-08 06:33:10,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:33:10,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:33:10,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:33:10,496 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-09-08 06:33:10,497 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-09-08 06:33:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:33:10,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-09-08 06:33:10,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:33:11,035 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-08 06:33:11,035 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-09-08 06:33:11,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:33:11,076 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 06:33:11,076 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-09-08 06:33:11,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:33:11,134 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 06:33:11,135 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-09-08 06:33:11,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:33:11,310 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-09-08 06:33:11,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:33:11,312 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-09-08 06:33:11,361 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2024-09-08 06:33:11,362 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-09-08 06:33:11,374 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-09-08 06:33:11,385 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-08 06:33:11,386 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-09-08 06:33:11,412 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 06:33:11,412 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-09-08 06:33:11,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:33:11,417 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-09-08 06:33:11,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:33:11,537 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-09-08 06:33:11,590 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-09-08 06:33:11,607 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:33:11,608 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:33:13,664 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_30 (Array Int Int))) (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (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|))) (not .cse1)) (or .cse1 (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|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|)))))) is different from false [2024-09-08 06:33:13,704 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-09-08 06:33:13,773 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-09-08 06:33:13,808 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-09-08 06:33:13,841 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-09-08 06:33:13,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 68 [2024-09-08 06:33:13,848 INFO L349 Elim1Store]: treesize reduction 3, result has 72.7 percent of original size [2024-09-08 06:33:13,848 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-09-08 06:33:13,852 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-09-08 06:33:13,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:33:13,855 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-09-08 06:33:13,904 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2024-09-08 06:33:13,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128546456] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:33:13,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 06:33:13,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17, 12] total 33 [2024-09-08 06:33:13,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001046924] [2024-09-08 06:33:13,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 06:33:13,905 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-08 06:33:13,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:33:13,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-08 06:33:13,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=770, Unknown=8, NotChecked=236, Total=1122 [2024-09-08 06:33:13,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:33:13,906 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:33:13,908 INFO L475 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-09-08 06:33:13,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:33:13,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:33:13,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:13,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:33:13,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 06:33:13,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:13,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:13,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:33:13,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:33:13,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:33:13,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:33:13,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-09-08 06:33:13,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-08 06:33:13,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-09-08 06:33:13,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:33:13,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-08 06:33:13,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-09-08 06:33:13,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:33:20,756 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-09-08 06:33:24,788 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-09-08 06:33:31,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 06:33:35,039 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-09-08 06:33:37,054 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-09-08 06:33:39,060 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-09-08 06:33:43,252 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-09-08 06:33:47,405 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-09-08 06:33:49,416 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-09-08 06:34:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:34:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:34:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:34:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:34:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 06:34:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:34:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:34:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:34:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:34:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:34:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:34:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-09-08 06:34:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-08 06:34:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-09-08 06:34:00,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:34:00,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-08 06:34:00,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-08 06:34:00,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-09-08 06:34:00,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-09-08 06:34:00,837 WARN L456 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-09-08 06:34:00,837 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:34:00,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:34:00,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1402148267, now seen corresponding path program 1 times [2024-09-08 06:34:00,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:34:00,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080649828] [2024-09-08 06:34:00,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:34:00,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:34:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:34:01,062 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 06:34:01,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:34:01,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080649828] [2024-09-08 06:34:01,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080649828] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:34:01,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072478685] [2024-09-08 06:34:01,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:34:01,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:34:01,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:34:01,065 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-09-08 06:34:01,066 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-09-08 06:34:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:34:01,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-08 06:34:01,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:34:01,286 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-09-08 06:34:01,307 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 06:34:01,307 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-09-08 06:34:01,346 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-09-08 06:34:01,347 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-09-08 06:34:01,350 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-09-08 06:34:01,353 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-09-08 06:34:01,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:34:01,370 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-09-08 06:34:01,415 INFO L349 Elim1Store]: treesize reduction 82, result has 30.5 percent of original size [2024-09-08 06:34:01,416 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-09-08 06:34:01,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:34:01,465 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-09-08 06:34:01,469 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-09-08 06:34:01,514 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-09-08 06:34:01,514 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-09-08 06:34:01,523 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-09-08 06:34:01,525 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-09-08 06:34:01,528 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-09-08 06:34:01,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:34:01,543 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-09-08 06:34:01,543 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-09-08 06:34:01,547 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-09-08 06:34:01,624 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 06:34:01,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:34:09,091 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-09-08 06:34:09,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:34:09,108 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-09-08 06:34:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 7 refuted. 1 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 06:34:09,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072478685] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:34:09,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 06:34:09,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 22 [2024-09-08 06:34:09,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192972968] [2024-09-08 06:34:09,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 06:34:09,148 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-08 06:34:09,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:34:09,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-08 06:34:09,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=349, Unknown=6, NotChecked=38, Total=462 [2024-09-08 06:34:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:34:09,148 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:34:09,149 INFO L475 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-09-08 06:34:09,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:34:09,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:34:09,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:34:09,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:34:09,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 06:34:09,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:34:09,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:34:09,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:34:09,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:34:09,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:34:09,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:34:09,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-09-08 06:34:09,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-08 06:34:09,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2024-09-08 06:34:09,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:34:09,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-08 06:34:09,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-09-08 06:34:09,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2024-09-08 06:34:09,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:34:11,708 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-09-08 06:34:13,820 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-09-08 06:34:15,929 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-09-08 06:34:16,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:34:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:34:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:34:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:34:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 06:34:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:34:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:34:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:34:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:34:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:34:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:34:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-09-08 06:34:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-08 06:34:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-09-08 06:34:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:34:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-08 06:34:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-08 06:34:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-09-08 06:34:16,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-08 06:34:16,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-09-08 06:34:16,742 WARN L456 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-09-08 06:34:16,742 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:34:16,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:34:16,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1345921391, now seen corresponding path program 1 times [2024-09-08 06:34:16,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:34:16,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661046891] [2024-09-08 06:34:16,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:34:16,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:34:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:34:18,861 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:34:18,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:34:18,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661046891] [2024-09-08 06:34:18,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661046891] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:34:18,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866717581] [2024-09-08 06:34:18,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:34:18,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:34:18,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:34:18,864 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-09-08 06:34:18,864 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-09-08 06:34:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:34:19,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-09-08 06:34:19,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:34:19,241 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 06:34:19,241 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-09-08 06:34:19,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-09-08 06:34:19,621 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-09-08 06:34:19,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:34:19,872 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-09-08 06:34:19,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:34:19,945 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-09-08 06:34:20,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:34:20,082 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-09-08 06:34:20,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:34:20,161 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-09-08 06:34:20,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:34:20,390 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-09-08 06:34:20,390 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-09-08 06:34:20,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:34:20,541 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 06:34:20,541 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-09-08 06:34:20,830 INFO L349 Elim1Store]: treesize reduction 46, result has 37.0 percent of original size [2024-09-08 06:34:20,830 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-09-08 06:34:21,118 INFO L349 Elim1Store]: treesize reduction 126, result has 26.7 percent of original size [2024-09-08 06:34:21,118 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-09-08 06:34:21,281 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-09-08 06:34:21,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:34:21,284 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-09-08 06:34:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:34:21,445 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:34:21,640 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-09-08 06:34:21,674 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-09-08 06:34:25,163 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-09-08 06:34:27,911 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-09-08 06:34:29,003 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-09-08 06:34:29,228 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-09-08 06:34:29,441 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-09-08 06:34:29,855 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-09-08 06:34:30,050 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-09-08 06:34:30,772 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-09-08 06:34:31,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:34:31,363 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-09-08 06:34:31,556 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-09-08 06:34:31,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:34:31,602 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-09-08 06:34:31,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:34:31,706 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-09-08 06:34:31,752 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-09-08 06:34:31,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:34:31,802 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-09-08 06:34:31,848 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-09-08 06:34:32,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 90 treesize of output 88 [2024-09-08 06:34:35,727 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2024-09-08 06:34:35,728 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-09-08 06:34:35,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:34:35,781 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-09-08 06:34:35,848 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-09-08 06:34:35,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:34:35,896 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-09-08 06:34:35,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:34:35,946 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-09-08 06:34:36,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:34:36,003 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-09-08 06:34:36,094 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-09-08 06:34:45,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:34:45,221 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-09-08 06:34:45,254 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-09-08 06:34:45,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:34:45,267 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-09-08 06:34:46,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:34:46,525 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-09-08 06:34:46,594 INFO L349 Elim1Store]: treesize reduction 3, result has 72.7 percent of original size [2024-09-08 06:34:46,596 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-09-08 06:34:46,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:34:46,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:34:46,709 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-09-08 06:34:46,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:34:46,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:34:46,728 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-09-08 06:34:46,740 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-09-08 06:34:46,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 91 [2024-09-08 06:34:46,767 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-09-08 06:34:46,781 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-09-08 06:34:47,027 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 06:34:47,032 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-09-08 06:34:47,032 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-09-08 06:34:47,037 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 06:34:47,072 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2024-09-08 06:34:47,073 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-09-08 06:34:47,162 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 06:34:47,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:34:47,186 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-09-08 06:34:47,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:34:47,318 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-09-08 06:34:47,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:34:47,365 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-09-08 06:34:47,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:34:47,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 145 treesize of output 147 [2024-09-08 06:34:47,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 942 treesize of output 910 [2024-09-08 06:34:48,670 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-09-08 06:34:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-09-08 06:34:52,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866717581] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:34:52,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 06:34:52,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 26] total 77 [2024-09-08 06:34:52,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943183234] [2024-09-08 06:34:52,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 06:34:52,086 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2024-09-08 06:34:52,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 06:34:52,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2024-09-08 06:34:52,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=4260, Unknown=63, NotChecked=1410, Total=6006 [2024-09-08 06:34:52,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:34:52,088 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:34:52,088 INFO L475 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-09-08 06:34:52,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:34:52,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:34:52,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:34:52,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:34:52,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 06:34:52,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:34:52,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:34:52,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:34:52,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:34:52,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:34:52,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:34:52,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-09-08 06:34:52,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-08 06:34:52,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2024-09-08 06:34:52,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:34:52,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-08 06:34:52,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-09-08 06:34:52,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-09-08 06:34:52,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-08 06:34:52,089 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:35:12,158 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-09-08 06:35:22,530 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-09-08 06:35:24,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-08 06:35:26,861 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-09-08 06:35:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:35:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:35:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:35:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:35:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 06:35:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:35:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:35:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:35:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:35:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:35:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:35:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-09-08 06:35:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-08 06:35:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-09-08 06:35:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:35:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-08 06:35:51,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-08 06:35:51,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-09-08 06:35:51,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-08 06:35:51,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-08 06:35:51,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-09-08 06:35:52,065 WARN L456 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-09-08 06:35:52,066 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:35:52,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:35:52,066 INFO L85 PathProgramCache]: Analyzing trace with hash 92829193, now seen corresponding path program 1 times [2024-09-08 06:35:52,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 06:35:52,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497453145] [2024-09-08 06:35:52,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:35:52,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 06:35:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:35:52,979 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 06:35:52,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 06:35:52,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497453145] [2024-09-08 06:35:52,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497453145] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 06:35:52,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912688694] [2024-09-08 06:35:52,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:35:52,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 06:35:52,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:35:52,981 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-09-08 06:35:52,982 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-09-08 06:35:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:35:53,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-09-08 06:35:53,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:35:53,507 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-08 06:35:53,508 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-09-08 06:35:53,558 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-09-08 06:35:53,618 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 06:35:53,618 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-09-08 06:35:53,674 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-09-08 06:35:53,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:35:53,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:35:53,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:35:53,876 INFO L349 Elim1Store]: treesize reduction 36, result has 21.7 percent of original size [2024-09-08 06:35:53,877 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-09-08 06:35:53,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:35:53,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:35:53,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:35:53,966 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-09-08 06:35:53,966 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-09-08 06:35:54,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:35:54,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:35:54,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:35:54,212 INFO L349 Elim1Store]: treesize reduction 28, result has 39.1 percent of original size [2024-09-08 06:35:54,212 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-09-08 06:35:54,217 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-09-08 06:35:54,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:35:54,238 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-09-08 06:35:54,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:35:54,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:35:54,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:35:54,274 INFO L349 Elim1Store]: treesize reduction 61, result has 4.7 percent of original size [2024-09-08 06:35:54,274 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-09-08 06:35:54,280 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-09-08 06:35:54,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:35:54,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:35:54,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:35:54,547 INFO L349 Elim1Store]: treesize reduction 168, result has 21.5 percent of original size [2024-09-08 06:35:54,547 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-09-08 06:35:54,556 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-09-08 06:35:54,648 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-09-08 06:35:54,660 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-09-08 06:35:54,731 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-09-08 06:35:54,732 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-09-08 06:35:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:35:54,977 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:35:55,200 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (not .cse0) (let ((.cse1 (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|))) (and (or (not .cse1) (and (forall ((v_DerPreprocessor_56 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_56))) (or (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|)) (forall ((v_DerPreprocessor_54 (Array Int Int))) (or (= (select v_DerPreprocessor_54 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (= (select (select (store .cse2 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_54) |c_~#m~0.base|) |c_~#m~0.offset|) 0)))))) (forall ((v_DerPreprocessor_56 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_56))) (or (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|)) (forall ((v_prenex_384 (Array Int Int))) (or (= (select v_prenex_384 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (= (select (select (store .cse3 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_prenex_384) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0)))))))) (or .cse1 (and (forall ((v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_57) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_58))) (or (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|)) (forall ((v_prenex_385 (Array Int Int))) (or (= (select v_prenex_385 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (= (select (select (store .cse4 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_prenex_385) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0)))))) (forall ((v_DerPreprocessor_57 (Array Int Int)) (v_DerPreprocessor_58 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_57) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_58))) (or (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select (select .cse5 |c_~#top~0.base|) |c_~#top~0.offset|)) (forall ((v_DerPreprocessor_54 (Array Int Int))) (or (= (select v_DerPreprocessor_54 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (= (select (select (store .cse5 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_54) |c_~#m~0.base|) |c_~#m~0.offset|) 0))))))))))) (or (and (forall ((v_DerPreprocessor_55 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_55))) (or (forall ((v_DerPreprocessor_54 (Array Int Int))) (or (= (select v_DerPreprocessor_54 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (= (select (select (store .cse6 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_54) |c_~#m~0.base|) |c_~#m~0.offset|) 0))) (= (select (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|)))) (forall ((v_DerPreprocessor_55 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_55))) (or (= (select (select .cse7 |c_~#top~0.base|) |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|) (forall ((v_prenex_382 (Array Int Int))) (or (= (select v_prenex_382 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (= (select (select (store .cse7 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_prenex_382) |c_~#m2~0.base|) |c_~#m2~0.offset|) 0))))))) .cse0))) is different from false [2024-09-08 06:35:56,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:35:56,022 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-09-08 06:35:56,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:35:56,099 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-09-08 06:36:02,620 INFO L349 Elim1Store]: treesize reduction 195, result has 83.8 percent of original size [2024-09-08 06:36:02,621 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-09-08 06:36:03,275 INFO L349 Elim1Store]: treesize reduction 775, result has 15.0 percent of original size [2024-09-08 06:36:03,276 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-09-08 06:36:03,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:36:03,878 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-09-08 06:36:04,047 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-09-08 06:36:04,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:36:04,221 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-09-08 06:36:04,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:36:04,393 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-09-08 06:36:04,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:36:04,563 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-09-08 06:36:04,722 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-09-08 06:36:04,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:36:04,898 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-09-08 06:36:05,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:36:05,077 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-09-08 06:36:05,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:36:05,284 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-09-08 06:36:05,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:36:05,466 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-09-08 06:36:05,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:36:05,650 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-09-08 06:36:05,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:36:05,839 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-09-08 06:36:06,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:36:06,026 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-09-08 06:36:06,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:36:06,232 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-09-08 06:36:06,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:36:06,423 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-09-08 06:36:06,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:36:06,619 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-09-08 06:36:06,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:36:06,814 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-09-08 06:36:07,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:36:07,022 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-09-08 06:36:07,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:36:07,220 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-09-08 06:36:07,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:36:07,440 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-09-08 06:38:00,849 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-09-08 06:38:00,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2024-09-08 06:38:00,850 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-09-08 06:38:00,866 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-09-08 06:38:01,051 WARN L456 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-09-08 06:38:01,051 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:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:410) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:327) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) 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-09-08 06:38:01,056 INFO L158 Benchmark]: Toolchain (without parser) took 339317.99ms. Allocated memory was 180.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 108.1MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-09-08 06:38:01,056 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory was 74.2MB in the beginning and 74.1MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 06:38:01,056 INFO L158 Benchmark]: Witness Parser took 0.52ms. Allocated memory is still 180.4MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 06:38:01,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.04ms. Allocated memory is still 180.4MB. Free memory was 107.9MB in the beginning and 147.5MB in the end (delta: -39.5MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2024-09-08 06:38:01,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.23ms. Allocated memory is still 180.4MB. Free memory was 147.5MB in the beginning and 144.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-08 06:38:01,056 INFO L158 Benchmark]: Boogie Preprocessor took 22.50ms. Allocated memory is still 180.4MB. Free memory was 144.8MB in the beginning and 142.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-08 06:38:01,056 INFO L158 Benchmark]: RCFGBuilder took 594.92ms. Allocated memory is still 180.4MB. Free memory was 142.7MB in the beginning and 88.8MB in the end (delta: 53.8MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-09-08 06:38:01,056 INFO L158 Benchmark]: TraceAbstraction took 338138.85ms. Allocated memory was 180.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 88.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-09-08 06:38:01,057 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.14ms. Allocated memory is still 113.2MB. Free memory was 74.2MB in the beginning and 74.1MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.52ms. Allocated memory is still 180.4MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.04ms. Allocated memory is still 180.4MB. Free memory was 107.9MB in the beginning and 147.5MB in the end (delta: -39.5MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.23ms. Allocated memory is still 180.4MB. Free memory was 147.5MB in the beginning and 144.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.50ms. Allocated memory is still 180.4MB. Free memory was 144.8MB in the beginning and 142.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 594.92ms. Allocated memory is still 180.4MB. Free memory was 142.7MB in the beginning and 88.8MB in the end (delta: 53.8MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 338138.85ms. Allocated memory was 180.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 88.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics 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: 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: 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: 124, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 44, dependent conditional: 0, dependent unconditional: 44, 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: 173, Maximal queried relation: 0, Independence queries for same thread: 54, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, 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: 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: 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: 124, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 44, dependent conditional: 0, dependent unconditional: 44, 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: 173, Maximal queried relation: 0, Independence queries for same thread: 54 - StatisticsResult: Partial order reduction statistics 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: 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: 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: 47, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 7, dependent conditional: 0, dependent unconditional: 7, 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: 44, Maximal queried relation: 0, Independence queries for same thread: 10, Persistent sets #1 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: 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: 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: 47, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 7, dependent conditional: 0, dependent unconditional: 7, 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: 44, Maximal queried relation: 0, Independence queries for same thread: 10 - StatisticsResult: Partial order reduction statistics 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: 620, independent unconditional: 1415, dependent: 75, dependent conditional: 32, dependent unconditional: 43, 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: 237, independent: 123, independent conditional: 3, independent unconditional: 120, dependent: 114, dependent conditional: 26, dependent unconditional: 89, 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: 637, Maximal queried relation: 5, Independence queries for same thread: 65, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, 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: 620, independent unconditional: 1415, dependent: 75, dependent conditional: 32, dependent unconditional: 43, 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: 237, independent: 123, independent conditional: 3, independent unconditional: 120, dependent: 114, dependent conditional: 26, dependent unconditional: 89, 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: 637, 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-09-08 06:38:01,094 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-09-08 06:38:01,279 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-09-08 06:38:01,479 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-09-08 06:38:01,680 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-09-02_08-21-23.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.positions.where.we.compute.the.hoare.annotation None --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-4a4c57e-m [2024-09-08 06:38:03,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-08 06:38:03,677 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-09-08 06:38:03,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-08 06:38:03,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-08 06:38:03,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-08 06:38:03,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-08 06:38:03,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-08 06:38:03,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-08 06:38:03,711 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-08 06:38:03,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-08 06:38:03,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-08 06:38:03,712 INFO L153 SettingsManager]: * Use SBE=true [2024-09-08 06:38:03,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-08 06:38:03,713 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-08 06:38:03,713 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-08 06:38:03,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-08 06:38:03,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-08 06:38:03,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-08 06:38:03,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-08 06:38:03,714 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-08 06:38:03,717 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-08 06:38:03,717 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-08 06:38:03,718 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-08 06:38:03,718 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-08 06:38:03,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-08 06:38:03,720 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-08 06:38:03,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-08 06:38:03,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-08 06:38:03,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-08 06:38:03,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-08 06:38:03,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 06:38:03,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-08 06:38:03,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-08 06:38:03,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-08 06:38:03,722 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-08 06:38:03,722 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-08 06:38:03,722 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-08 06:38:03,723 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-08 06:38:03,723 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-08 06:38:03,724 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-08 06:38:03,724 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-08 06:38:03,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-08 06:38:03,725 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: Positions where we compute the Hoare Annotation -> None 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-09-08 06:38:03,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-08 06:38:03,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-08 06:38:03,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-08 06:38:04,000 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-08 06:38:04,000 INFO L274 PluginConnector]: CDTParser initialized [2024-09-08 06:38:04,001 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-09-08 06:38:05,270 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-08 06:38:05,486 INFO L384 CDTParser]: Found 1 translation units. [2024-09-08 06:38:05,487 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longer-1.i [2024-09-08 06:38:05,500 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d9787bd2b/ecf06111aa904531be54204a7f1c1de8/FLAG8f6fb8b1a [2024-09-08 06:38:05,510 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d9787bd2b/ecf06111aa904531be54204a7f1c1de8 [2024-09-08 06:38:05,512 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-08 06:38:05,512 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-08 06:38:05,513 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-09-02_08-21-23.files/protection-local/26_stack_cas_longer-1.yml/witness.yml [2024-09-08 06:38:05,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-08 06:38:05,559 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-08 06:38:05,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-08 06:38:05,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-08 06:38:05,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-08 06:38:05,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:38:05" (1/2) ... [2024-09-08 06:38:05,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7322b44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:38:05, skipping insertion in model container [2024-09-08 06:38:05,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:38:05" (1/2) ... [2024-09-08 06:38:05,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1ca20e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:38:05, skipping insertion in model container [2024-09-08 06:38:05,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 06:38:05" (2/2) ... [2024-09-08 06:38:05,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7322b44d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:38:05, skipping insertion in model container [2024-09-08 06:38:05,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 06:38:05" (2/2) ... [2024-09-08 06:38:05,582 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-08 06:38:05,583 INFO L1541 ArrayList]: Location invariant before [L751-L751] (m == 0 || m == 1) && (m2 == 0 || m2 == 1) [2024-09-08 06:38:05,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-08 06:38:05,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 06:38:05,918 INFO L200 MainTranslator]: Completed pre-run Start Parsing Local [2024-09-08 06:38:05,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 06:38:06,016 INFO L204 MainTranslator]: Completed translation [2024-09-08 06:38:06,016 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:38:06 WrapperNode [2024-09-08 06:38:06,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-08 06:38:06,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-08 06:38:06,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-08 06:38:06,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-08 06:38:06,023 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 08.09 06:38:06" (1/1) ... [2024-09-08 06:38:06,048 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 08.09 06:38:06" (1/1) ... [2024-09-08 06:38:06,070 INFO L138 Inliner]: procedures = 183, calls = 51, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 197 [2024-09-08 06:38:06,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-08 06:38:06,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-08 06:38:06,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-08 06:38:06,072 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-08 06:38:06,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:38:06" (1/1) ... [2024-09-08 06:38:06,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:38:06" (1/1) ... [2024-09-08 06:38:06,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:38:06" (1/1) ... [2024-09-08 06:38:06,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:38:06" (1/1) ... [2024-09-08 06:38:06,094 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:38:06" (1/1) ... [2024-09-08 06:38:06,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:38:06" (1/1) ... [2024-09-08 06:38:06,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:38:06" (1/1) ... [2024-09-08 06:38:06,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:38:06" (1/1) ... [2024-09-08 06:38:06,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-08 06:38:06,106 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-08 06:38:06,106 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-08 06:38:06,106 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-08 06:38:06,106 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:38:06" (1/1) ... [2024-09-08 06:38:06,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 06:38:06,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:38:06,132 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-09-08 06:38:06,134 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-09-08 06:38:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-09-08 06:38:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-09-08 06:38:06,164 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-09-08 06:38:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-08 06:38:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-08 06:38:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-08 06:38:06,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-08 06:38:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-09-08 06:38:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-09-08 06:38:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-09-08 06:38:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-08 06:38:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-08 06:38:06,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-08 06:38:06,166 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-08 06:38:06,275 INFO L242 CfgBuilder]: Building ICFG [2024-09-08 06:38:06,277 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-08 06:38:06,590 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-08 06:38:06,590 INFO L291 CfgBuilder]: Performing block encoding [2024-09-08 06:38:06,814 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-08 06:38:06,814 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-08 06:38:06,815 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:38:06 BoogieIcfgContainer [2024-09-08 06:38:06,816 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-08 06:38:06,817 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-08 06:38:06,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-08 06:38:06,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-08 06:38:06,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:38:05" (1/4) ... [2024-09-08 06:38:06,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db170c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:38:06, skipping insertion in model container [2024-09-08 06:38:06,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 06:38:05" (2/4) ... [2024-09-08 06:38:06,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db170c9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 06:38:06, skipping insertion in model container [2024-09-08 06:38:06,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 06:38:06" (3/4) ... [2024-09-08 06:38:06,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db170c9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 06:38:06, skipping insertion in model container [2024-09-08 06:38:06,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:38:06" (4/4) ... [2024-09-08 06:38:06,822 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longer-1.i [2024-09-08 06:38:06,836 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-08 06:38:06,836 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-08 06:38:06,837 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-08 06:38:06,885 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 06:38:06,918 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 06:38:06,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 06:38:06,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:38:06,920 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-09-08 06:38:06,922 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-09-08 06:38:06,949 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 06:38:06,960 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-09-08 06:38:06,966 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4fc6d5f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 06:38:06,966 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 06:38:07,079 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:38:07,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:07,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1114168855, now seen corresponding path program 1 times [2024-09-08 06:38:07,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:07,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32856008] [2024-09-08 06:38:07,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:07,095 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-09-08 06:38:07,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:07,116 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-09-08 06:38:07,117 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-09-08 06:38:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:07,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-08 06:38:07,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:07,270 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 06:38:07,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:07,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32856008] [2024-09-08 06:38:07,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32856008] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:38:07,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:38:07,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 06:38:07,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172646603] [2024-09-08 06:38:07,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:38:07,277 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 06:38:07,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:07,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 06:38:07,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 06:38:07,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:07,307 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:07,308 INFO L475 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-09-08 06:38:07,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:07,358 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 (3)] Ended with exit code 0 [2024-09-08 06:38:07,554 WARN L456 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-09-08 06:38:07,554 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:38:07,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:07,555 INFO L85 PathProgramCache]: Analyzing trace with hash -148017800, now seen corresponding path program 1 times [2024-09-08 06:38:07,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:07,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733047297] [2024-09-08 06:38:07,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:07,556 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-09-08 06:38:07,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:07,558 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-09-08 06:38:07,559 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-09-08 06:38:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:07,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-08 06:38:07,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:07,695 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-09-08 06:38:07,743 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-09-08 06:38:07,773 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-09-08 06:38:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:07,851 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 06:38:07,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:07,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733047297] [2024-09-08 06:38:07,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733047297] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:38:07,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:38:07,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 06:38:07,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397549915] [2024-09-08 06:38:07,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:38:07,853 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 06:38:07,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:07,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 06:38:07,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-08 06:38:07,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:07,854 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:07,854 INFO L475 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-09-08 06:38:07,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:07,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:07,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:07,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:07,926 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-09-08 06:38:08,121 WARN L456 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-09-08 06:38:08,121 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:38:08,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:08,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1592448670, now seen corresponding path program 1 times [2024-09-08 06:38:08,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:08,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543975417] [2024-09-08 06:38:08,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:08,122 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-09-08 06:38:08,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:08,125 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-09-08 06:38:08,126 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-09-08 06:38:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:08,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-08 06:38:08,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:08,220 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-09-08 06:38:08,236 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-09-08 06:38:08,250 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-09-08 06:38:08,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:38:08,273 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-09-08 06:38:08,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 06:38:08,298 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 06:38:08,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:08,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543975417] [2024-09-08 06:38:08,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543975417] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:38:08,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:38:08,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 06:38:08,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657781498] [2024-09-08 06:38:08,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:38:08,301 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 06:38:08,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:08,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 06:38:08,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 06:38:08,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:08,303 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:08,303 INFO L475 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-09-08 06:38:08,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:08,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:08,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:08,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:08,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:08,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:08,440 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 (5)] Ended with exit code 0 [2024-09-08 06:38:08,639 WARN L456 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-09-08 06:38:08,639 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:38:08,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:08,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1754051290, now seen corresponding path program 1 times [2024-09-08 06:38:08,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:08,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582324468] [2024-09-08 06:38:08,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:08,641 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-09-08 06:38:08,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:08,642 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-09-08 06:38:08,643 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-09-08 06:38:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:08,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-08 06:38:08,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:08,782 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:38:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:08,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:08,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582324468] [2024-09-08 06:38:08,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582324468] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:38:08,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 06:38:08,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-09-08 06:38:08,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266119051] [2024-09-08 06:38:08,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 06:38:08,841 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-08 06:38:08,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:08,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-08 06:38:08,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-08 06:38:08,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:08,842 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:08,842 INFO L475 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-09-08 06:38:08,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:08,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:08,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:08,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:08,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:08,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:08,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:08,919 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-09-08 06:38:09,117 WARN L456 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-09-08 06:38:09,118 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:38:09,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:09,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2130591545, now seen corresponding path program 1 times [2024-09-08 06:38:09,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:09,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551942608] [2024-09-08 06:38:09,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:09,119 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-09-08 06:38:09,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:09,121 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-09-08 06:38:09,122 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-09-08 06:38:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:09,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-08 06:38:09,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:09,299 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 06:38:09,300 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-09-08 06:38:09,426 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-09-08 06:38:09,430 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-09-08 06:38:09,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:09,454 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:38:09,525 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-09-08 06:38:09,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:38:09,551 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-09-08 06:38:09,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-09-08 06:38:09,713 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:09,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:09,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551942608] [2024-09-08 06:38:09,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551942608] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:38:09,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 06:38:09,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-09-08 06:38:09,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642148470] [2024-09-08 06:38:09,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 06:38:09,714 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-08 06:38:09,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:09,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-08 06:38:09,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2024-09-08 06:38:09,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:09,716 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:09,716 INFO L475 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-09-08 06:38:09,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:09,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:09,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:09,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:09,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:10,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:10,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:10,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:10,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:10,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 06:38:10,069 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 1 remaining) [2024-09-08 06:38:10,079 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 (7)] Forceful destruction successful, exit code 0 [2024-09-08 06:38:10,269 WARN L456 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-09-08 06:38:10,274 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-09-08 06:38:10,276 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-09-08 06:38:10,282 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 06:38:10,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 06:38:10,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:38:10,284 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-09-08 06:38:10,286 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-09-08 06:38:10,289 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 06:38:10,289 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 06:38:10,290 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4fc6d5f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 06:38:10,291 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 06:38:10,353 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 06:38:10,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:10,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1614565434, now seen corresponding path program 1 times [2024-09-08 06:38:10,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:10,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254698761] [2024-09-08 06:38:10,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:10,355 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-09-08 06:38:10,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:10,357 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-09-08 06:38:10,358 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-09-08 06:38:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:10,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-08 06:38:10,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:10,440 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 06:38:10,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:10,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254698761] [2024-09-08 06:38:10,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254698761] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:38:10,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:38:10,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 06:38:10,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330814512] [2024-09-08 06:38:10,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:38:10,441 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 06:38:10,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:10,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 06:38:10,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 06:38:10,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:10,441 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:10,442 INFO L475 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-09-08 06:38:10,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:10,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:10,474 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-09-08 06:38:10,670 WARN L456 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-09-08 06:38:10,670 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 06:38:10,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:10,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1917162261, now seen corresponding path program 1 times [2024-09-08 06:38:10,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:10,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742833408] [2024-09-08 06:38:10,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:10,671 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-09-08 06:38:10,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:10,674 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-09-08 06:38:10,674 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-09-08 06:38:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 06:38:10,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 06:38:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 06:38:10,787 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-09-08 06:38:10,787 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 06:38:10,787 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-08 06:38:10,799 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 (10)] Forceful destruction successful, exit code 0 [2024-09-08 06:38:10,991 WARN L456 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-09-08 06:38:10,992 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1] [2024-09-08 06:38:10,992 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-09-08 06:38:10,993 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-08 06:38:10,993 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-09-08 06:38:11,028 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 06:38:11,030 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 06:38:11,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 06:38:11,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:38:11,031 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-09-08 06:38:11,032 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-09-08 06:38:11,037 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 06:38:11,038 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 06:38:11,038 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4fc6d5f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 06:38:11,038 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 06:38:11,314 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 06:38:11,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:11,315 INFO L85 PathProgramCache]: Analyzing trace with hash -826269901, now seen corresponding path program 1 times [2024-09-08 06:38:11,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:11,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835403025] [2024-09-08 06:38:11,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:11,315 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-09-08 06:38:11,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:11,317 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-09-08 06:38:11,317 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-09-08 06:38:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:11,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-08 06:38:11,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:11,453 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 06:38:11,453 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 06:38:11,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:11,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835403025] [2024-09-08 06:38:11,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835403025] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:38:11,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:38:11,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 06:38:11,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092932729] [2024-09-08 06:38:11,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:38:11,454 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 06:38:11,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:11,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 06:38:11,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 06:38:11,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:11,455 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:11,455 INFO L475 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-09-08 06:38:11,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:11,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:11,518 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-09-08 06:38:11,714 WARN L456 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-09-08 06:38:11,714 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 06:38:11,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:11,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1039106021, now seen corresponding path program 1 times [2024-09-08 06:38:11,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:11,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955104367] [2024-09-08 06:38:11,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:11,715 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-09-08 06:38:11,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:11,718 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-09-08 06:38:11,719 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-09-08 06:38:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:11,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-08 06:38:11,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:11,811 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-09-08 06:38:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 06:38:11,838 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 06:38:11,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:11,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955104367] [2024-09-08 06:38:11,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955104367] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:38:11,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:38:11,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 06:38:11,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952103920] [2024-09-08 06:38:11,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:38:11,839 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 06:38:11,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:11,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 06:38:11,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-08 06:38:11,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:11,840 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:11,840 INFO L475 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-09-08 06:38:11,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:11,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:13,880 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-09-08 06:38:13,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:13,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:13,946 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 (13)] Ended with exit code 0 [2024-09-08 06:38:14,142 WARN L456 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-09-08 06:38:14,142 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 06:38:14,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:14,143 INFO L85 PathProgramCache]: Analyzing trace with hash -210511263, now seen corresponding path program 1 times [2024-09-08 06:38:14,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:14,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103309494] [2024-09-08 06:38:14,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:14,144 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-09-08 06:38:14,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:14,145 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-09-08 06:38:14,146 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-09-08 06:38:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:14,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-08 06:38:14,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:14,358 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-09-08 06:38:14,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-09-08 06:38:14,460 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-09-08 06:38:14,510 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:14,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:38:14,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:38:14,661 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-09-08 06:38:14,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:38:14,837 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-09-08 06:38:14,841 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-09-08 06:38:14,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:38:14,852 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-09-08 06:38:14,854 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 06:38:14,855 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-09-08 06:38:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:14,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:14,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103309494] [2024-09-08 06:38:14,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103309494] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:38:14,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 06:38:14,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-09-08 06:38:14,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363818447] [2024-09-08 06:38:14,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 06:38:14,980 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-08 06:38:14,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:14,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-08 06:38:14,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=106, Unknown=6, NotChecked=0, Total=156 [2024-09-08 06:38:14,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:14,981 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:14,981 INFO L475 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-09-08 06:38:14,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:14,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:14,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:17,259 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-09-08 06:38:17,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:17,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:17,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:17,334 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 (14)] Ended with exit code 0 [2024-09-08 06:38:17,529 WARN L456 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-09-08 06:38:17,529 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 06:38:17,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:17,530 INFO L85 PathProgramCache]: Analyzing trace with hash -240740414, now seen corresponding path program 1 times [2024-09-08 06:38:17,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:17,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304989044] [2024-09-08 06:38:17,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:17,530 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-09-08 06:38:17,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:17,531 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-09-08 06:38:17,533 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-09-08 06:38:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:17,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-08 06:38:17,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:17,666 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-09-08 06:38:17,666 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-09-08 06:38:17,676 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-09-08 06:38:17,684 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-09-08 06:38:17,708 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-09-08 06:38:17,711 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-09-08 06:38:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 06:38:17,722 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 06:38:17,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:17,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304989044] [2024-09-08 06:38:17,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304989044] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:38:17,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:38:17,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 06:38:17,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320695711] [2024-09-08 06:38:17,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:38:17,723 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 06:38:17,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:17,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 06:38:17,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 06:38:17,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:17,724 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:17,724 INFO L475 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-09-08 06:38:17,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:17,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:17,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:17,724 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:17,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:17,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:17,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:17,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:17,943 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 (15)] Forceful destruction successful, exit code 0 [2024-09-08 06:38:18,139 WARN L456 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-09-08 06:38:18,139 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 06:38:18,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:18,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1541764542, now seen corresponding path program 1 times [2024-09-08 06:38:18,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:18,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378540146] [2024-09-08 06:38:18,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:18,140 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-09-08 06:38:18,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:18,142 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-09-08 06:38:18,143 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-09-08 06:38:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:18,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-08 06:38:18,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:18,282 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:38:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:18,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:18,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378540146] [2024-09-08 06:38:18,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378540146] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:38:18,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 06:38:18,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-09-08 06:38:18,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618161507] [2024-09-08 06:38:18,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 06:38:18,359 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-08 06:38:18,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:18,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-08 06:38:18,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-08 06:38:18,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:18,360 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:18,360 INFO L475 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-09-08 06:38:18,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:18,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:18,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:18,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:18,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:18,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:18,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:18,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:18,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:18,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:18,464 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 (16)] Forceful destruction successful, exit code 0 [2024-09-08 06:38:18,656 WARN L456 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-09-08 06:38:18,657 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 06:38:18,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:18,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2137440580, now seen corresponding path program 1 times [2024-09-08 06:38:18,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:18,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [708023927] [2024-09-08 06:38:18,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:18,657 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-09-08 06:38:18,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:18,660 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-09-08 06:38:18,661 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-09-08 06:38:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:18,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-08 06:38:18,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:18,836 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 06:38:18,837 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-09-08 06:38:18,951 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-09-08 06:38:18,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-08 06:38:19,010 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:19,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:38:19,083 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-09-08 06:38:19,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:38:19,108 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-09-08 06:38:19,110 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-09-08 06:38:19,271 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:19,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:19,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [708023927] [2024-09-08 06:38:19,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [708023927] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:38:19,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 06:38:19,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-09-08 06:38:19,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729292373] [2024-09-08 06:38:19,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 06:38:19,272 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-08 06:38:19,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:19,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-08 06:38:19,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-09-08 06:38:19,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:19,273 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:19,273 INFO L475 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-09-08 06:38:19,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:19,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:19,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:19,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:19,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:19,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:19,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:19,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:19,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:19,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:19,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:38:19,844 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 (17)] Ended with exit code 0 [2024-09-08 06:38:20,039 WARN L456 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-09-08 06:38:20,039 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 06:38:20,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:20,040 INFO L85 PathProgramCache]: Analyzing trace with hash 460945972, now seen corresponding path program 2 times [2024-09-08 06:38:20,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:20,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157623935] [2024-09-08 06:38:20,040 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 06:38:20,040 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-09-08 06:38:20,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:20,041 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-09-08 06:38:20,042 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-09-08 06:38:20,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 06:38:20,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 06:38:20,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-08 06:38:20,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:20,224 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 06:38:20,224 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-09-08 06:38:20,401 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-09-08 06:38:20,404 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-09-08 06:38:20,440 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-09-08 06:38:20,450 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-09-08 06:38:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:20,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:38:20,477 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_363) |c_~#top~0.base|) |c_~#top~0.offset|)))) is different from false [2024-09-08 06:38:20,519 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-09-08 06:38:20,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:38:20,537 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-09-08 06:38:20,538 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-09-08 06:38:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:20,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:20,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157623935] [2024-09-08 06:38:20,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157623935] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:38:20,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 06:38:20,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-09-08 06:38:20,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685198460] [2024-09-08 06:38:20,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 06:38:20,794 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-08 06:38:20,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:20,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-08 06:38:20,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=150, Unknown=2, NotChecked=50, Total=240 [2024-09-08 06:38:20,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:20,796 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:20,796 INFO L475 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-09-08 06:38:20,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:20,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:20,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:20,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:20,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:20,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:38:20,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:23,166 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-09-08 06:38:23,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:23,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:23,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:23,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:23,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:23,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 06:38:23,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-08 06:38:23,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 (18)] Ended with exit code 0 [2024-09-08 06:38:23,436 WARN L456 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-09-08 06:38:23,436 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 06:38:23,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:23,437 INFO L85 PathProgramCache]: Analyzing trace with hash -956094227, now seen corresponding path program 1 times [2024-09-08 06:38:23,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:23,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193712620] [2024-09-08 06:38:23,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:23,437 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-09-08 06:38:23,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:23,438 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-09-08 06:38:23,439 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-09-08 06:38:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 06:38:23,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 06:38:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 06:38:23,629 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-09-08 06:38:23,629 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 06:38:23,630 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-08 06:38:23,636 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 (19)] Ended with exit code 0 [2024-09-08 06:38:23,830 WARN L456 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-09-08 06:38:23,831 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-09-08 06:38:23,831 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-09-08 06:38:23,831 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-08 06:38:23,832 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-09-08 06:38:23,861 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 06:38:23,862 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 06:38:23,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 06:38:23,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 06:38:23,864 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-09-08 06:38:23,865 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-09-08 06:38:23,867 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 06:38:23,867 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-09-08 06:38:23,868 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4fc6d5f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 06:38:23,868 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 06:38:24,343 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:38:24,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:24,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2126375043, now seen corresponding path program 1 times [2024-09-08 06:38:24,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:24,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163394311] [2024-09-08 06:38:24,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:24,344 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-09-08 06:38:24,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:24,345 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-09-08 06:38:24,346 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-09-08 06:38:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:24,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-08 06:38:24,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:24,476 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 06:38:24,476 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 06:38:24,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:24,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163394311] [2024-09-08 06:38:24,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163394311] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:38:24,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:38:24,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 06:38:24,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736845181] [2024-09-08 06:38:24,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:38:24,477 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 06:38:24,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:24,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 06:38:24,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 06:38:24,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:24,478 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:24,478 INFO L475 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-09-08 06:38:24,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:24,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:24,560 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 (21)] Ended with exit code 0 [2024-09-08 06:38:24,756 WARN L456 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-09-08 06:38:24,756 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:38:24,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:24,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1980207569, now seen corresponding path program 1 times [2024-09-08 06:38:24,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:24,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912826243] [2024-09-08 06:38:24,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:24,757 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-09-08 06:38:24,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:24,758 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-09-08 06:38:24,759 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-09-08 06:38:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:24,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-08 06:38:24,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:24,883 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-09-08 06:38:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-08 06:38:24,909 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 06:38:24,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:24,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912826243] [2024-09-08 06:38:24,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912826243] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:38:24,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:38:24,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 06:38:24,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728704468] [2024-09-08 06:38:24,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:38:24,910 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 06:38:24,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:24,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 06:38:24,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-08 06:38:24,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:24,910 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:24,911 INFO L475 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-09-08 06:38:24,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:24,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:26,945 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-09-08 06:38:29,023 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-09-08 06:38:31,066 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-09-08 06:38:33,186 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-09-08 06:38:33,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:33,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:33,264 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 (22)] Ended with exit code 0 [2024-09-08 06:38:33,458 WARN L456 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-09-08 06:38:33,459 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:38:33,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:33,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1145783191, now seen corresponding path program 1 times [2024-09-08 06:38:33,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:33,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765830810] [2024-09-08 06:38:33,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:33,460 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-09-08 06:38:33,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:33,461 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-09-08 06:38:33,461 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-09-08 06:38:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:33,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-08 06:38:33,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:33,615 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-08 06:38:33,615 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:38:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-08 06:38:33,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:33,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765830810] [2024-09-08 06:38:33,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765830810] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:38:33,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 06:38:33,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-09-08 06:38:33,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290471081] [2024-09-08 06:38:33,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 06:38:33,674 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-08 06:38:33,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:33,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-08 06:38:33,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-08 06:38:33,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:33,674 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:33,674 INFO L475 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-09-08 06:38:33,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:33,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:33,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:33,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:33,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:33,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:38:33,817 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 (23)] Ended with exit code 0 [2024-09-08 06:38:34,013 WARN L456 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-09-08 06:38:34,013 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:38:34,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:34,013 INFO L85 PathProgramCache]: Analyzing trace with hash 455569771, now seen corresponding path program 1 times [2024-09-08 06:38:34,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:34,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309963126] [2024-09-08 06:38:34,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:34,014 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-09-08 06:38:34,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:34,015 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-09-08 06:38:34,016 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-09-08 06:38:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:34,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-08 06:38:34,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:34,152 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-09-08 06:38:34,157 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-09-08 06:38:34,164 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-09-08 06:38:34,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:38:34,170 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-09-08 06:38:34,183 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 06:38:34,183 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 06:38:34,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:34,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309963126] [2024-09-08 06:38:34,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309963126] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:38:34,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:38:34,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 06:38:34,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239194385] [2024-09-08 06:38:34,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:38:34,184 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 06:38:34,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:34,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 06:38:34,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 06:38:34,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:34,185 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:34,185 INFO L475 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-09-08 06:38:34,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:34,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:34,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:38:34,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:34,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:34,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:34,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:38:34,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:34,453 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 (24)] Forceful destruction successful, exit code 0 [2024-09-08 06:38:34,648 WARN L456 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-09-08 06:38:34,648 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:38:34,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:34,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1522923375, now seen corresponding path program 1 times [2024-09-08 06:38:34,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:34,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899947556] [2024-09-08 06:38:34,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:34,649 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-09-08 06:38:34,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:34,650 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-09-08 06:38:34,651 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-09-08 06:38:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:34,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-08 06:38:34,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:34,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 06:38:34,937 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-09-08 06:38:34,976 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-09-08 06:38:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-08 06:38:35,009 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:38:35,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:38:35,135 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-09-08 06:38:35,149 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m2~0.offset| (_ BitVec 32))) (or (= (select (select (store |c_#memory_int| |c_~#m2~0.base| v_arrayElimArr_14) |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_14 |~#m2~0.offset|))))) (or (forall ((v_ArrVal_630 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m2~0.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_630) |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base|) |~#m2~0.offset| (_ bv0 32))) |c_~#m~0.base|) |c_~#m~0.offset|))) (not (= (_ bv0 32) c_~state~0)))) is different from false [2024-09-08 06:38:35,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:38:35,222 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-09-08 06:38:35,224 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-09-08 06:38:35,228 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-09-08 06:38:35,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 85 [2024-09-08 06:38:35,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:38:35,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-09-08 06:38:35,285 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-09-08 06:38:35,368 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 2 not checked. [2024-09-08 06:38:35,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:35,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899947556] [2024-09-08 06:38:35,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899947556] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:38:35,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 06:38:35,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-09-08 06:38:35,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551188277] [2024-09-08 06:38:35,369 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 06:38:35,369 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-08 06:38:35,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:35,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-08 06:38:35,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=94, Unknown=1, NotChecked=20, Total=156 [2024-09-08 06:38:35,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:35,370 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:35,370 INFO L475 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-09-08 06:38:35,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:35,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:35,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:38:35,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:35,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:35,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:35,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:35,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:38:35,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:35,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:36,001 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-09-08 06:38:36,195 WARN L456 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-09-08 06:38:36,195 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:38:36,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:36,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1452080061, now seen corresponding path program 1 times [2024-09-08 06:38:36,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:36,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436018248] [2024-09-08 06:38:36,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:36,196 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-09-08 06:38:36,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:36,197 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-09-08 06:38:36,199 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-09-08 06:38:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:36,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-08 06:38:36,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:36,379 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-09-08 06:38:36,380 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-09-08 06:38:36,385 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-09-08 06:38:36,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:38:36,407 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-09-08 06:38:36,416 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-09-08 06:38:36,420 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-09-08 06:38:36,430 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 06:38:36,430 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 06:38:36,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:36,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436018248] [2024-09-08 06:38:36,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436018248] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:38:36,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:38:36,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 06:38:36,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505117151] [2024-09-08 06:38:36,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:38:36,431 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 06:38:36,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:36,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 06:38:36,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 06:38:36,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:36,432 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:36,432 INFO L475 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-09-08 06:38:36,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:36,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:36,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:38:36,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:36,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:36,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:36,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:36,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:36,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:38:36,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:36,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:36,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:36,816 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 (26)] Forceful destruction successful, exit code 0 [2024-09-08 06:38:37,011 WARN L456 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-09-08 06:38:37,011 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:38:37,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:37,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1179436776, now seen corresponding path program 1 times [2024-09-08 06:38:37,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:37,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90971419] [2024-09-08 06:38:37,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:37,012 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-09-08 06:38:37,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:37,013 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-09-08 06:38:37,014 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-09-08 06:38:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:37,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-08 06:38:37,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:37,243 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 06:38:37,244 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-09-08 06:38:37,366 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-09-08 06:38:37,368 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-09-08 06:38:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 06:38:37,419 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:38:37,488 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-09-08 06:38:37,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:38:37,505 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-09-08 06:38:37,507 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-09-08 06:38:37,695 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 06:38:37,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:37,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90971419] [2024-09-08 06:38:37,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90971419] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:38:37,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 06:38:37,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-09-08 06:38:37,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236890897] [2024-09-08 06:38:37,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 06:38:37,696 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-08 06:38:37,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:37,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-08 06:38:37,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-09-08 06:38:37,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:37,697 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:37,697 INFO L475 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-09-08 06:38:37,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:37,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:37,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:38:37,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:37,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:37,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:37,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:38:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:38,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:38:38,350 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-09-08 06:38:38,545 WARN L456 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-09-08 06:38:38,545 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:38:38,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:38,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1258041184, now seen corresponding path program 2 times [2024-09-08 06:38:38,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:38,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843230804] [2024-09-08 06:38:38,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 06:38:38,546 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-09-08 06:38:38,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:38,547 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-09-08 06:38:38,549 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-09-08 06:38:38,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 06:38:38,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 06:38:38,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-08 06:38:38,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:38,841 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-09-08 06:38:38,870 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-09-08 06:38:38,882 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-09-08 06:38:38,938 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 06:38:38,938 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 06:38:38,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:38,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843230804] [2024-09-08 06:38:38,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843230804] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:38:38,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:38:38,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 06:38:38,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668133053] [2024-09-08 06:38:38,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:38:38,939 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 06:38:38,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:38,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 06:38:38,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-08 06:38:38,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:38,940 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:38,940 INFO L475 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-09-08 06:38:38,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:38,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:38,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:38:38,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:38,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:38,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:38,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:38:38,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:39,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:39,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:39,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:38:39,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:39,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:39,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:39,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:38:39,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:39,282 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-09-08 06:38:39,476 WARN L456 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-09-08 06:38:39,476 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:38:39,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:39,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1390433366, now seen corresponding path program 1 times [2024-09-08 06:38:39,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:39,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000341842] [2024-09-08 06:38:39,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:39,478 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-09-08 06:38:39,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:39,479 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-09-08 06:38:39,480 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-09-08 06:38:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:39,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-08 06:38:39,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:39,728 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:39,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:38:39,884 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:39,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:39,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000341842] [2024-09-08 06:38:39,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000341842] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:38:39,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 06:38:39,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-09-08 06:38:39,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169765648] [2024-09-08 06:38:39,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 06:38:39,885 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-08 06:38:39,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:39,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-08 06:38:39,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-09-08 06:38:39,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:39,886 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:39,886 INFO L475 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-09-08 06:38:39,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:39,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:39,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:38:39,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:39,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:39,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:39,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:38:39,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:39,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:38:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:38:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 06:38:40,133 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-09-08 06:38:40,328 WARN L456 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-09-08 06:38:40,328 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:38:40,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:40,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1311039028, now seen corresponding path program 1 times [2024-09-08 06:38:40,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:40,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141837525] [2024-09-08 06:38:40,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:40,329 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-09-08 06:38:40,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:40,330 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-09-08 06:38:40,331 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-09-08 06:38:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:40,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-08 06:38:40,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:40,753 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-08 06:38:40,753 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-09-08 06:38:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:40,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:38:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:41,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:41,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141837525] [2024-09-08 06:38:41,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141837525] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:38:41,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 06:38:41,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2024-09-08 06:38:41,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940032133] [2024-09-08 06:38:41,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 06:38:41,125 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-08 06:38:41,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:41,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-08 06:38:41,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=280, Unknown=1, NotChecked=0, Total=342 [2024-09-08 06:38:41,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:41,126 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:41,126 INFO L475 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-09-08 06:38:41,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:41,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:41,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:38:41,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:41,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:41,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:41,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:38:41,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:41,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 06:38:41,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:38:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:38:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 06:38:42,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-08 06:38:42,063 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-09-08 06:38:42,257 WARN L456 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-09-08 06:38:42,257 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:38:42,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:42,258 INFO L85 PathProgramCache]: Analyzing trace with hash 585131588, now seen corresponding path program 2 times [2024-09-08 06:38:42,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:42,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064352890] [2024-09-08 06:38:42,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 06:38:42,258 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-09-08 06:38:42,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:42,260 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-09-08 06:38:42,260 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-09-08 06:38:42,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 06:38:42,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 06:38:42,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-08 06:38:42,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:42,570 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 06:38:42,570 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-09-08 06:38:42,749 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-09-08 06:38:42,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-08 06:38:42,833 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-09-08 06:38:42,861 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-09-08 06:38:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-08 06:38:42,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:38:43,013 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-09-08 06:38:43,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:38:43,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 22 treesize of output 23 [2024-09-08 06:38:43,036 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-09-08 06:38:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-08 06:38:43,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:43,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064352890] [2024-09-08 06:38:43,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064352890] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:38:43,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 06:38:43,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-09-08 06:38:43,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63839691] [2024-09-08 06:38:43,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 06:38:43,314 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-08 06:38:43,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:43,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-08 06:38:43,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=273, Unknown=12, NotChecked=34, Total=380 [2024-09-08 06:38:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:43,323 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:43,324 INFO L475 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-09-08 06:38:43,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:43,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:43,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:38:43,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:43,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:43,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:43,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:38:43,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:43,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 06:38:43,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-09-08 06:38:43,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:45,862 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-09-08 06:38:48,847 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-09-08 06:38:48,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:48,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:48,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:38:48,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:48,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:48,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:48,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:38:48,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:48,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 06:38:48,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-08 06:38:48,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:38:48,994 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-09-08 06:38:49,188 WARN L456 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-09-08 06:38:49,189 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:38:49,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:49,189 INFO L85 PathProgramCache]: Analyzing trace with hash 741122395, now seen corresponding path program 1 times [2024-09-08 06:38:49,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:49,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734880309] [2024-09-08 06:38:49,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:49,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-09-08 06:38:49,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:49,191 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-09-08 06:38:49,192 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-09-08 06:38:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:49,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-08 06:38:49,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:49,897 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-08 06:38:49,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2024-09-08 06:38:49,996 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-08 06:38:49,996 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-09-08 06:38:50,172 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-08 06:38:50,172 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-09-08 06:38:50,317 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-08 06:38:50,318 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-09-08 06:38:50,571 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-09-08 06:38:50,571 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-09-08 06:38:50,589 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-08 06:38:50,589 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-09-08 06:38:50,640 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-09-08 06:38:50,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-08 06:38:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:50,679 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:38:50,811 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-09-08 06:38:50,828 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-09-08 06:38:51,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:38:51,690 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-09-08 06:38:51,715 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-09-08 06:38:51,722 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-09-08 06:38:51,734 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-09-08 06:38:51,746 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-09-08 06:38:51,755 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-09-08 06:38:51,768 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-09-08 06:38:51,775 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-09-08 06:38:51,787 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-09-08 06:38:51,795 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-09-08 06:38:51,804 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-09-08 06:38:51,812 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-09-08 06:38:51,821 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-09-08 06:38:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:52,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:38:52,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734880309] [2024-09-08 06:38:52,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734880309] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:38:52,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 06:38:52,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2024-09-08 06:38:52,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157003686] [2024-09-08 06:38:52,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 06:38:52,544 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-08 06:38:52,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:38:52,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-08 06:38:52,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=770, Unknown=29, NotChecked=118, Total=1056 [2024-09-08 06:38:52,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:52,545 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:38:52,546 INFO L475 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-09-08 06:38:52,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:52,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:52,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:38:52,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:52,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:52,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:52,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:38:52,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:52,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 06:38:52,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-08 06:38:52,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:38:52,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:38:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:38:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:38:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:38:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:38:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:54,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:38:54,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:38:54,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 06:38:54,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-08 06:38:54,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:38:54,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-08 06:38:54,041 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 (32)] Ended with exit code 0 [2024-09-08 06:38:54,235 WARN L456 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-09-08 06:38:54,236 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:38:54,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:38:54,236 INFO L85 PathProgramCache]: Analyzing trace with hash -877004733, now seen corresponding path program 1 times [2024-09-08 06:38:54,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:38:54,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469147197] [2024-09-08 06:38:54,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:38:54,237 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-09-08 06:38:54,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:38:54,238 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-09-08 06:38:54,239 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-09-08 06:38:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:38:54,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-08 06:38:54,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:38:54,538 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-09-08 06:38:54,538 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-09-08 06:38:54,816 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-09-08 06:38:54,816 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-09-08 06:38:54,827 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-09-08 06:38:54,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:38:54,850 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-09-08 06:38:54,861 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-09-08 06:38:55,011 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-09-08 06:38:55,012 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-09-08 06:38:55,222 INFO L349 Elim1Store]: treesize reduction 4, result has 90.2 percent of original size [2024-09-08 06:38:55,222 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-09-08 06:38:55,232 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-09-08 06:38:55,410 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-09-08 06:38:55,562 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-09-08 06:38:55,566 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-09-08 06:38:55,611 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-09-08 06:38:55,625 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-09-08 06:38:55,679 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:38:55,680 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:38:55,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:38:55,761 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-09-08 06:38:55,769 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-09-08 06:38:55,981 WARN L854 $PredicateComparison]: unable to prove that (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 (select |c_#memory_int| |c_~#top~0.base|) |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|)))) is different from false [2024-09-08 06:38:56,049 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-09-08 06:38:56,049 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-09-08 06:38:56,052 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-09-08 06:38:56,057 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-09-08 06:38:56,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:38:56,065 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-09-08 06:38:56,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:38:56,742 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-09-08 06:38:56,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 138 [2024-09-08 06:38:56,812 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-09-08 06:38:56,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:38:56,852 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-09-08 06:38:56,859 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-09-08 06:38:56,926 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-09-08 06:38:56,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:38:56,954 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-09-08 06:38:56,960 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-09-08 06:38:57,023 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-09-08 06:39:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-09-08 06:39:28,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:39:28,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469147197] [2024-09-08 06:39:28,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469147197] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:39:28,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 06:39:28,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2024-09-08 06:39:28,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489825924] [2024-09-08 06:39:28,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 06:39:28,263 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-08 06:39:28,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:39:28,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-08 06:39:28,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=343, Unknown=14, NotChecked=78, Total=506 [2024-09-08 06:39:28,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:39:28,267 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:39:28,268 INFO L475 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-09-08 06:39:28,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:39:28,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:39:28,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:39:28,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:28,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:39:28,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:28,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:39:28,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:28,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 06:39:28,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-08 06:39:28,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:39:28,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-09-08 06:39:28,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:39:28,730 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_thr1Thread1of3ForFork0_push_~oldTop~0#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (let ((.cse6 (not .cse1))) (let ((.cse3 (not (= |c_~#m~0.base| |c_~#m2~0.base|))) (.cse5 (forall ((v_ArrVal_1161 (_ BitVec 1))) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_ArrVal_1161) |c_~#m2~0.base|))))) (.cse2 (or .cse6 (forall ((v_ArrVal_1161 (_ BitVec 1)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_42| (_ BitVec 32)) (v_ArrVal_1158 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (bvadd (_ bv1 32) (select (select (let ((.cse9 (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_1158))) (store .cse9 |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| (store (select .cse9 |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_42|) (_ bv0 32))))) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_ArrVal_1161) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_42|))))))) (.cse8 (not (= |c_~#top~0.base| |c_~#m2~0.base|))) (.cse4 (forall ((v_ArrVal_1161 (_ BitVec 1)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_42| (_ BitVec 32))) (or (not (= (_ bv0 32) (bvadd (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_42|) (_ bv0 32)) (_ bv1 32)))) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_ArrVal_1161) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_42|)))))) (.cse0 (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (_ bv5 32)))))) (and (= (_ bv5 32) |c_~#m2~0.base|) (= (_ bv4 32) |c_~#top~0.base|) (or (= (_ bv5 32) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base|) .cse0) (or (and (or .cse1 (forall ((v_ArrVal_1161 (_ BitVec 1)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_42| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (bvadd (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_32) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_42|) (_ bv0 32))))) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_ArrVal_1161) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_42|)))))) .cse2) .cse3) (= (_ bv0 32) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.offset|) (= (_ bv3 32) |c_~#m~0.base|) (or .cse4 .cse3) (or .cse5 (not (= (bvadd (_ bv1 32) (select (select |c_#memory_int| |c_~#m2~0.base|) (_ bv0 32))) (_ bv0 32)))) (= (_ bv0 32) (select (select |c_#memory_int| (_ bv5 32)) |c_~#m2~0.offset|)) (= (_ bv0 32) (select (select |c_#memory_int| (_ bv3 32)) |c_~#m~0.offset|)) (or .cse5 (and (or .cse6 (forall ((v_ArrVal_1158 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (bvadd (_ bv1 32) (select (select (let ((.cse7 (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_1158))) (store .cse7 |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| (store (select .cse7 |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) |c_~#m2~0.base|) (_ bv0 32))))))) (or .cse1 (forall ((v_DerPreprocessor_30 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (bvadd (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#m2~0.base|) (_ bv0 32))) (_ bv0 32))))))) (or .cse8 (and (or (forall ((v_ArrVal_1161 (_ BitVec 1)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_42| (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (bvadd (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_31) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_42|) (_ bv0 32))))) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_ArrVal_1161) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_42|))))) .cse1) .cse2)) (or .cse8 .cse4) .cse0)))) is different from false [2024-09-08 06:39:31,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:39:31,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:39:31,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:39:31,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:31,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:39:31,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:31,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:39:31,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:31,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 06:39:31,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-08 06:39:31,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:39:31,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-08 06:39:31,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:39:31,212 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-09-08 06:39:31,406 WARN L456 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-09-08 06:39:31,406 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:39:31,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:39:31,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1897379409, now seen corresponding path program 1 times [2024-09-08 06:39:31,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:39:31,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172464532] [2024-09-08 06:39:31,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:39:31,407 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-09-08 06:39:31,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:39:31,408 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-09-08 06:39:31,409 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-09-08 06:39:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:39:31,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-08 06:39:31,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:39:31,616 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-09-08 06:39:31,622 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-09-08 06:39:31,629 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-09-08 06:39:31,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:39:31,634 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-09-08 06:39:31,651 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-08 06:39:31,651 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 06:39:31,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:39:31,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172464532] [2024-09-08 06:39:31,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172464532] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:39:31,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:39:31,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 06:39:31,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134167864] [2024-09-08 06:39:31,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:39:31,652 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 06:39:31,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:39:31,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 06:39:31,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 06:39:31,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:39:31,653 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:39:31,653 INFO L475 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-09-08 06:39:31,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:39:31,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:39:31,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:39:31,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:31,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:39:31,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:31,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:39:31,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:31,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 06:39:31,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-08 06:39:31,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:39:31,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-08 06:39:31,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:39:31,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:39:32,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:39:32,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:39:32,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:39:32,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:32,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:39:32,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:32,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:39:32,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:32,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 06:39:32,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-08 06:39:32,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:39:32,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-08 06:39:32,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:39:32,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:32,343 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 (34)] Ended with exit code 0 [2024-09-08 06:39:32,536 WARN L456 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-09-08 06:39:32,537 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:39:32,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:39:32,537 INFO L85 PathProgramCache]: Analyzing trace with hash -460996992, now seen corresponding path program 1 times [2024-09-08 06:39:32,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:39:32,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914981742] [2024-09-08 06:39:32,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:39:32,538 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-09-08 06:39:32,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:39:32,539 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-09-08 06:39:32,540 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-09-08 06:39:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:39:32,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-08 06:39:32,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:39:33,166 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-08 06:39:33,166 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-09-08 06:39:33,198 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:39:33,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:39:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:39:33,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:39:33,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914981742] [2024-09-08 06:39:33,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914981742] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:39:33,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 06:39:33,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2024-09-08 06:39:33,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938630226] [2024-09-08 06:39:33,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 06:39:33,546 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-08 06:39:33,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:39:33,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-08 06:39:33,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=338, Unknown=2, NotChecked=0, Total=420 [2024-09-08 06:39:33,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:39:33,546 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:39:33,547 INFO L475 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-09-08 06:39:33,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:39:33,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:39:33,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:39:33,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:33,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:39:33,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:33,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:39:33,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:33,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 06:39:33,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-09-08 06:39:33,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:39:33,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-08 06:39:33,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 06:39:33,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:33,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:39:35,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:39:35,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:39:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:39:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:39:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:39:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:39:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 06:39:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 06:39:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:39:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-08 06:39:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-08 06:39:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-08 06:39:35,787 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 (35)] Forceful destruction successful, exit code 0 [2024-09-08 06:39:35,981 WARN L456 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-09-08 06:39:35,981 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:39:35,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:39:35,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1192799301, now seen corresponding path program 1 times [2024-09-08 06:39:35,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:39:35,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271331903] [2024-09-08 06:39:35,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:39:35,982 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-09-08 06:39:35,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:39:35,983 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-09-08 06:39:35,984 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-09-08 06:39:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:39:36,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-08 06:39:36,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:39:36,453 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-09-08 06:39:36,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:39:36,462 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-09-08 06:39:36,467 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-09-08 06:39:36,473 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-09-08 06:39:36,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:39:36,480 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-09-08 06:39:36,519 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-08 06:39:36,519 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-09-08 06:39:36,545 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-09-08 06:39:36,564 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 06:39:36,565 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 06:39:36,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:39:36,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271331903] [2024-09-08 06:39:36,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271331903] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 06:39:36,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 06:39:36,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-08 06:39:36,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230332881] [2024-09-08 06:39:36,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 06:39:36,565 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-08 06:39:36,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:39:36,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-08 06:39:36,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-08 06:39:36,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:39:36,566 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:39:36,566 INFO L475 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-09-08 06:39:36,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:39:36,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:39:36,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:39:36,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:39:36,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:39:36,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:36,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:39:36,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:36,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 06:39:36,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 06:39:36,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:39:36,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-08 06:39:36,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-09-08 06:39:36,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:36,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-09-08 06:39:36,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:39:37,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:39:37,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:39:37,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:39:37,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:39:37,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:39:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:39:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 06:39:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 06:39:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:39:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-08 06:39:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-08 06:39:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:39:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-08 06:39:37,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-08 06:39:37,554 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 (36)] Forceful destruction successful, exit code 0 [2024-09-08 06:39:37,748 WARN L456 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-09-08 06:39:37,748 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:39:37,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:39:37,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1349471029, now seen corresponding path program 1 times [2024-09-08 06:39:37,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:39:37,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165074619] [2024-09-08 06:39:37,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 06:39:37,749 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-09-08 06:39:37,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:39:37,750 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-09-08 06:39:37,751 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-09-08 06:39:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 06:39:37,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-08 06:39:37,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:39:38,192 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-09-08 06:39:38,396 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-09-08 06:39:38,407 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-08 06:39:38,408 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-09-08 06:39:38,457 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 06:39:38,457 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-09-08 06:39:38,512 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 06:39:38,512 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-09-08 06:39:38,596 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-08 06:39:38,596 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-09-08 06:39:38,827 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-09-08 06:39:38,836 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-09-08 06:39:38,842 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-09-08 06:39:39,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:39:39,077 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-09-08 06:39:39,077 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-09-08 06:39:39,111 INFO L349 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2024-09-08 06:39:39,111 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-09-08 06:39:39,116 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-09-08 06:39:39,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 06:39:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 06:39:39,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:39:39,235 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-09-08 06:39:39,423 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse4 (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or (let ((.cse2 (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|))) (and (or (forall ((v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (= (select (select (store (let ((.cse0 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_1485)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse0) |c_~#top~0.base| (store (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_40) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse0) |c_~#top~0.base|) |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|) (_ bv1 32))) .cse2) (or (forall ((v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (let ((.cse3 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_1485)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse3 |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 .cse2)))) (not .cse4)) (or (forall ((v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_41 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse5 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_41))) (store .cse5 |c_~#top~0.base| (store (select .cse5 |c_~#top~0.base|) |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|) (_ bv1 32))) .cse4)))) is different from false [2024-09-08 06:39:40,744 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 06:39:40,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:39:40,748 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-09-08 06:39:40,752 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-09-08 06:39:40,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:39:40,762 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-09-08 06:39:40,767 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-09-08 06:39:40,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:39:40,777 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-09-08 06:39:40,782 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-09-08 06:39:41,116 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-09-08 06:39:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-09-08 06:39:41,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:39:41,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165074619] [2024-09-08 06:39:41,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165074619] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:39:41,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 06:39:41,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2024-09-08 06:39:41,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631967715] [2024-09-08 06:39:41,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 06:39:41,262 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-08 06:39:41,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:39:41,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-08 06:39:41,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=650, Unknown=16, NotChecked=106, Total=870 [2024-09-08 06:39:41,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:39:41,263 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:39:41,263 INFO L475 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-09-08 06:39:41,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:39:41,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:39:41,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:39:41,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:39:41,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:39:41,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:41,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:39:41,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:41,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 06:39:41,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 06:39:41,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:39:41,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-08 06:39:41,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-09-08 06:39:41,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:39:41,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-08 06:39:41,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-08 06:39:41,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:39:46,999 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-09-08 06:39:47,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:39:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:39:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:39:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:39:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:39:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:39:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:39:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 06:39:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 06:39:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:39:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-08 06:39:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-08 06:39:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:39:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-08 06:39:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-08 06:39:47,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-08 06:39:47,980 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-09-08 06:39:48,173 WARN L456 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-09-08 06:39:48,173 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:39:48,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:39:48,174 INFO L85 PathProgramCache]: Analyzing trace with hash 116354577, now seen corresponding path program 2 times [2024-09-08 06:39:48,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:39:48,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607619176] [2024-09-08 06:39:48,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 06:39:48,174 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-09-08 06:39:48,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:39:48,175 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-09-08 06:39:48,176 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-09-08 06:39:48,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 06:39:48,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 06:39:48,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-08 06:39:48,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:39:48,534 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-09-08 06:39:48,754 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 06:39:48,755 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-09-08 06:39:48,789 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-09-08 06:39:48,797 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-09-08 06:39:48,805 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-09-08 06:39:48,811 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-09-08 06:39:48,881 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2024-09-08 06:39:48,881 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-09-08 06:39:48,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:39:48,891 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-09-08 06:39:48,896 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-09-08 06:39:48,937 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-09-08 06:39:49,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:39:49,050 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-09-08 06:39:49,083 INFO L349 Elim1Store]: treesize reduction 37, result has 28.8 percent of original size [2024-09-08 06:39:49,084 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-09-08 06:39:49,284 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-09-08 06:39:49,319 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 06:39:49,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:39:49,374 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (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) (or (let ((.cse1 (= |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|))) .cse1) (or (not .cse1) (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|)))))) (not .cse0)))) is different from false [2024-09-08 06:39:49,401 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-09-08 06:39:49,421 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-09-08 06:39:50,390 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-09-08 06:40:08,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 06:40:09,099 INFO L349 Elim1Store]: treesize reduction 49, result has 40.2 percent of original size [2024-09-08 06:40:09,100 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-09-08 06:40:09,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:40:09,161 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-09-08 06:40:09,176 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-09-08 06:40:09,187 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-09-08 06:40:09,224 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-09-08 06:40:09,297 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-09-08 06:40:09,298 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-09-08 06:40:09,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:40:09,341 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-09-08 06:40:09,371 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-09-08 06:40:09,436 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 06:40:09,536 INFO L349 Elim1Store]: treesize reduction 50, result has 39.0 percent of original size [2024-09-08 06:40:09,536 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-09-08 06:40:09,624 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-09-08 06:40:09,624 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-09-08 06:40:09,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 690 treesize of output 668 [2024-09-08 06:40:09,705 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-09-08 06:40:09,706 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-09-08 06:40:09,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 86 [2024-09-08 06:40:09,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 86 treesize of output 78 [2024-09-08 06:40:10,057 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-09-08 06:40:11,837 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-09-08 06:40:13,020 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 10 not checked. [2024-09-08 06:40:13,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:40:13,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607619176] [2024-09-08 06:40:13,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607619176] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:40:13,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 06:40:13,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-09-08 06:40:13,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498066525] [2024-09-08 06:40:13,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 06:40:13,021 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-08 06:40:13,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:40:13,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-08 06:40:13,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=488, Unknown=29, NotChecked=196, Total=812 [2024-09-08 06:40:13,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:40:13,022 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:40:13,022 INFO L475 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-09-08 06:40:13,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:40:13,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:40:13,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:40:13,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:40:13,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:40:13,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:40:13,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:40:13,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:40:13,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 06:40:13,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 06:40:13,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:40:13,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-08 06:40:13,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-09-08 06:40:13,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:40:13,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-08 06:40:13,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-08 06:40:13,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-09-08 06:40:13,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:40:19,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 06:40:22,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 06:40:58,160 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 (= |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|))) .cse1) (or (not .cse1) (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|)))))))) (and (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv0 32)) (= (_ bv4 32) |c_~#top~0.base|) (= (_ bv3 32) |c_~#m~0.base|) (= (bvadd (_ bv1 1) (select |c_#valid| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (_ bv0 1)) (or .cse0 (= (_ bv1 32) |c_thr1Thread2of3ForFork0_push_#t~mem13#1|)) (or (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32)) .cse0) (= (_ bv0 32) |c_~#m~0.offset|))) is different from false [2024-09-08 06:41:01,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 06:41:03,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 06:41:06,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 06:41:08,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 [1] [2024-09-08 06:41:15,076 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-09-08 06:41:16,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 06:41:20,649 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-09-08 06:41:22,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 06:41:26,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 06:41:34,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 06:41:49,061 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-09-08 06:41:50,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-08 06:41:51,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-08 06:41:52,905 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 [0, 1] [2024-09-08 06:41:58,376 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-09-08 06:42:13,256 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-09-08 06:42:17,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 06:42:25,557 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-09-08 06:42:31,088 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (.cse15 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse4 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse15 |c_~#top~0.offset|))) (.cse17 (not .cse3))) (let ((.cse0 (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (_ bv0 32)))) (.cse1 (or .cse17 (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))))))) (.cse16 (not .cse4)) (.cse2 (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)) (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))) (= (_ 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|)) .cse0 (or .cse0 (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 .cse1 .cse2) (not (= (select (select |c_#memory_int| |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))) .cse1 (= (_ bv1 32) |c_thr1Thread3of3ForFork0_push_#t~mem13#1|) (or .cse3 (and (or .cse4 (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 ((.cse7 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_57))) (let ((.cse8 (let ((.cse9 (store .cse7 |c_~#m~0.base| v_ArrVal_1566))) (store .cse9 |c_~#top~0.base| (store (select .cse9 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54))))) (let ((.cse5 (store (select .cse8 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse6 (store .cse8 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse5))) (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| .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|)) (= (_ bv1 32) (select (select .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (not (= (_ bv0 32) (select (select .cse7 |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 ((.cse14 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse15 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse12 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_58) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse14))) (let ((.cse13 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| (store (select (store .cse12 |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse11 (store (select .cse13 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse10 (store .cse13 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse11))) (or (not (= v_DerPreprocessor_54 (select (select .cse10 |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| .cse11) |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 .cse10 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse12 |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))))))))) .cse16))) (or .cse17 (and (or .cse4 (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 .cse15 |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)))))))))) .cse16))) .cse2)))) is different from true [2024-09-08 06:42:32,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 06:42:40,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 06:42:42,075 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (.cse16 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse5 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse16 |c_~#top~0.offset|))) (.cse2 (not .cse1)) (.cse18 (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (_ bv0 32)))) (let ((.cse0 (= (_ bv1 32) .cse18)) (.cse3 (or .cse2 (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 ((.cse35 (let ((.cse36 (let ((.cse37 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (store .cse37 |c_~#top~0.base| (store (select .cse37 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))))) (store .cse36 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse36 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))))) (or (= (_ bv1 32) (select (select .cse35 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (= (select (select (store .cse35 |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))))))) (.cse17 (not .cse5)) (.cse4 (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)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse34 (store .cse31 |c_~#top~0.base| (store (select .cse31 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse32 (store (select .cse34 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse33 (store .cse34 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse32))) (or (= (_ bv1 32) (select (select (store (store (store .cse31 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse32) |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 .cse33 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (= (_ bv1 32) (select (select .cse33 |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))) (= (_ 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|)) .cse0 (or .cse0 (and (= (_ bv0 32) |c_~#top~0.offset|) (= (_ bv4 32) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (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|))) .cse1) (or .cse2 (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|)) (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (or (and .cse3 .cse4) (not (= (select (select |c_#memory_int| |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))) .cse3 (or .cse1 (and (or .cse5 (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 ((.cse8 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_57))) (let ((.cse9 (let ((.cse10 (store .cse8 |c_~#m~0.base| v_ArrVal_1566))) (store .cse10 |c_~#top~0.base| (store (select .cse10 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54))))) (let ((.cse6 (store (select .cse9 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse7 (store .cse9 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse6))) (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| .cse6) |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 .cse7 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse7 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (not (= (_ bv0 32) (select (select .cse8 |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 ((.cse15 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse16 |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 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_58) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse15))) (let ((.cse14 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse15) |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| (store (select (store .cse13 |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse12 (store (select .cse14 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse11 (store .cse14 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse12))) (or (not (= v_DerPreprocessor_54 (select (select .cse11 |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| .cse12) |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 .cse11 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse13 |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))))))))) .cse17))) (= |c_thr1Thread2of3ForFork0_push_#t~mem13#1| .cse18) (or .cse2 (and (or .cse5 (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 ((.cse20 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_56))) (let ((.cse24 (store .cse20 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse21 (store (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse23 (store .cse24 |c_~#top~0.base| .cse21))) (let ((.cse22 (store (select .cse23 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse19 (store .cse23 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse22))) (or (not (= (select (select .cse19 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (not (= (_ bv0 32) (select (select .cse20 |c_~#m~0.base|) |c_~#m~0.offset|))) (= (_ bv1 32) (select (select .cse19 |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| .cse21) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse22) |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 ((.cse28 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse16 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32))))) (let ((.cse30 (store .cse28 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse26 (store (select .cse30 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse29 (store .cse30 |c_~#top~0.base| .cse26))) (let ((.cse27 (store (select .cse29 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse25 (store .cse29 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse27))) (or (= (_ bv1 32) (select (select .cse25 |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| .cse26) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse27) |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 .cse28 |c_~#m~0.base|) |c_~#m~0.offset|))) (not (= (select (select .cse25 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)))))))))) .cse17))) .cse4)))) is different from true [2024-09-08 06:42:45,914 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-09-08 06:42:47,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 06:42:51,004 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 [0, 1] [2024-09-08 06:42:54,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-08 06:42:59,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-08 06:43:01,754 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 [0, 1] [2024-09-08 06:43:03,232 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-09-08 06:43:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:43:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:43:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:43:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:43:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:43:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:43:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:43:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:43:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 06:43:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 06:43:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:43:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 06:43:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-08 06:43:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:43:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-08 06:43:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-08 06:43:03,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 06:43:03,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-09-08 06:43:03,457 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-09-08 06:43:03,652 WARN L456 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-09-08 06:43:03,652 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-08 06:43:03,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 06:43:03,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1422240575, now seen corresponding path program 2 times [2024-09-08 06:43:03,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 06:43:03,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672388251] [2024-09-08 06:43:03,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 06:43:03,653 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-09-08 06:43:03,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 06:43:03,654 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-09-08 06:43:03,654 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-09-08 06:43:03,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-08 06:43:03,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 06:43:03,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-08 06:43:03,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 06:43:05,549 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-09-08 06:43:05,728 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2024-09-08 06:43:05,728 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-09-08 06:43:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-08 06:43:06,392 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 06:43:09,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 06:43:09,783 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-09-08 06:43:10,529 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 2 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-08 06:43:10,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 06:43:10,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672388251] [2024-09-08 06:43:10,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672388251] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 06:43:10,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 06:43:10,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-09-08 06:43:10,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944552868] [2024-09-08 06:43:10,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 06:43:10,530 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-08 06:43:10,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 06:43:10,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-08 06:43:10,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=88, Unknown=4, NotChecked=0, Total=132 [2024-09-08 06:43:10,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:43:10,531 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 06:43:10,531 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 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-09-08 06:43:10,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 06:43:10,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 06:43:10,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:43:10,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:43:10,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 06:43:10,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:43:10,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:43:10,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 06:43:10,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 06:43:10,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 06:43:10,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 06:43:10,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 06:43:10,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-09-08 06:43:10,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 06:43:10,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-08 06:43:10,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-08 06:43:10,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 06:43:10,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-09-08 06:43:10,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 06:43:15,980 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-09-08 06:43:20,674 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-09-08 06:43:28,236 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-09-08 06:43:34,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 06:43:40,871 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-09-08 06:43:45,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 06:43:51,523 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-09-08 06:43:57,788 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-09-08 06:44:19,258 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-09-08 06:44:33,561 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-09-08 06:44:38,077 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-09-08 06:44:40,779 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-09-08 06:44:46,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 06:44:50,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 06:44:58,478 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse3 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse8 |c_~#top~0.offset|)))) (let ((.cse9 (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|)) (.cse11 (store |c_#memory_int| |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|))) (.cse12 (not .cse3)) (.cse0 (not (= (_ bv0 32) (bvadd (_ bv1 32) c_~next_alloc_idx~0)))) (.cse2 (not (= (_ bv0 1) (select |c_#valid| |c_~#top~0.base|)))) (.cse1 (not (= (_ bv0 32) |c_~#top~0.offset|)))) (and (or .cse0 .cse1) (or .cse2 .cse1 (not (= (_ bv0 32) (bvadd (_ bv1 32) |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (or .cse3 (forall ((v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_44 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44))) (or (not (= (_ bv0 32) (bvadd (_ bv1 32) (select (select .cse4 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|))) (= (_ bv1 32) (select (select (store (let ((.cse6 (store .cse4 |c_~#m~0.base| v_ArrVal_1481))) (let ((.cse5 (store (select (store .cse6 |c_~#top~0.base| (store (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1485)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32) (_ bv1 32)))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse5) |c_~#top~0.base| (store (select (store (store .cse6 |c_~#top~0.base| v_DerPreprocessor_40) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse5) |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1487)))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32))) (= |c_~#top~0.base| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|))))) (or (not (= (_ bv0 32) (bvadd (_ bv3 32) c_~next_alloc_idx~0))) .cse1) (not (= (_ bv0 1) (select |c_#valid| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (or (forall ((v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (= (select (select (store (let ((.cse7 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| v_ArrVal_1485)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse7) |c_~#top~0.base| (store (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_40) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse7) |c_~#top~0.base|) |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|) (_ bv1 32))) .cse9) (or .cse2 (and (or (forall ((v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_42 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store .cse11 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_42))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481) |c_~#top~0.base| (store (store (select (store .cse10 |c_~#m~0.base| v_ArrVal_1481) |c_~#top~0.base|) (_ bv0 32) (_ bv1 32)) |c_~#top~0.offset| v_ArrVal_1487)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_~#top~0.base|) (_ bv0 32))) (not (= (_ bv0 32) (bvadd (_ bv1 32) (select (select .cse10 |c_~#top~0.base|) (_ bv0 32)))))))) .cse12) (or .cse3 (forall ((v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_43 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_43))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481) |c_~#top~0.base| (store (store (select (store .cse13 |c_~#m~0.base| v_ArrVal_1481) |c_~#top~0.base|) (_ bv0 32) (_ bv1 32)) |c_~#top~0.offset| v_ArrVal_1487)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_~#top~0.base|) (_ bv0 32))) (not (= (_ bv0 32) (bvadd (select (select .cse13 |c_~#top~0.base|) (_ bv0 32)) (_ bv1 32)))))))))) (or (forall ((v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (let ((.cse14 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481))) (store .cse14 |c_~#top~0.base| (store (store (select .cse14 |c_~#top~0.base|) (_ bv0 32) (_ bv1 32)) |c_~#top~0.offset| v_ArrVal_1487))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_~#top~0.base|) (_ bv0 32)))) .cse2 (not (= (_ bv0 32) (bvadd (select .cse8 (_ bv0 32)) (_ bv1 32))))) (or (forall ((v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (let ((.cse15 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| v_ArrVal_1485)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse15) |c_~#top~0.base| (store .cse15 |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 .cse9)) (or (forall ((v_DerPreprocessor_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (let ((.cse18 (store .cse11 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45))) (or (= (_ bv1 32) (select (select (store (let ((.cse17 (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#m~0.base| v_ArrVal_1481))) (let ((.cse16 (store (select (store .cse17 |c_~#top~0.base| (store (select (store .cse18 |c_~#m~0.base| v_ArrVal_1481) |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1485)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32) (_ bv1 32)))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse16) |c_~#top~0.base| (store (select (store (store .cse17 |c_~#top~0.base| v_DerPreprocessor_40) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse16) |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1487)))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32))) (not (= (_ bv0 32) (bvadd (_ bv1 32) (select (select .cse18 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|))) (= |c_~#top~0.base| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|)))) .cse12) (or .cse0 .cse2 .cse1) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| (_ BitVec 32))) (or (not (= (bvadd (_ bv1 32) (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|))) (= |c_~#top~0.base| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (forall ((v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (= (select (select (store (let ((.cse19 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481))) (let ((.cse20 (store (select (store .cse19 |c_~#top~0.base| (store (select .cse19 |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1485)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32) (_ bv1 32)))) (store (store .cse19 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse20) |c_~#top~0.base| (store (select (store (store .cse19 |c_~#top~0.base| v_DerPreprocessor_40) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse20) |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1487)))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32)) (_ bv1 32))))))))) is different from false [2024-09-08 06:45:01,072 WARN L854 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (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 (select |c_#memory_int| |c_~#top~0.base|) |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|))) (= (_ bv1 32) |c_thr1Thread3of3ForFork0_push_#t~mem13#1|)) is different from false [2024-09-08 06:45:05,830 WARN L854 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (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 (select |c_#memory_int| |c_~#top~0.base|) |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|)))) is different from false [2024-09-08 06:45:31,296 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse6 |c_~#top~0.offset|)))) (let ((.cse0 (not (= (_ bv0 1) (select |c_#valid| |c_~#top~0.base|)))) (.cse7 (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|)) (.cse9 (store |c_#memory_int| |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|))) (.cse10 (not .cse1))) (and (or .cse0 (not (= (_ bv0 32) |c_~#top~0.offset|)) (not (= (_ bv0 32) (bvadd (_ bv1 32) |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (or .cse1 (forall ((v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_44 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44))) (or (not (= (_ bv0 32) (bvadd (_ bv1 32) (select (select .cse2 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|))) (= (_ bv1 32) (select (select (store (let ((.cse4 (store .cse2 |c_~#m~0.base| v_ArrVal_1481))) (let ((.cse3 (store (select (store .cse4 |c_~#top~0.base| (store (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1485)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32) (_ bv1 32)))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse3) |c_~#top~0.base| (store (select (store (store .cse4 |c_~#top~0.base| v_DerPreprocessor_40) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse3) |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1487)))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32))) (= |c_~#top~0.base| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|))))) (not (= (_ bv0 1) (select |c_#valid| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (or (forall ((v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (= (select (select (store (let ((.cse5 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| v_ArrVal_1485)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base| (store (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_40) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base|) |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|) (_ bv1 32))) .cse7) (or .cse0 (and (or (forall ((v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_42 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_42))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481) |c_~#top~0.base| (store (store (select (store .cse8 |c_~#m~0.base| v_ArrVal_1481) |c_~#top~0.base|) (_ bv0 32) (_ bv1 32)) |c_~#top~0.offset| v_ArrVal_1487)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_~#top~0.base|) (_ bv0 32))) (not (= (_ bv0 32) (bvadd (_ bv1 32) (select (select .cse8 |c_~#top~0.base|) (_ bv0 32)))))))) .cse10) (or .cse1 (forall ((v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_43 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_43))) (or (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481) |c_~#top~0.base| (store (store (select (store .cse11 |c_~#m~0.base| v_ArrVal_1481) |c_~#top~0.base|) (_ bv0 32) (_ bv1 32)) |c_~#top~0.offset| v_ArrVal_1487)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_~#top~0.base|) (_ bv0 32))) (not (= (_ bv0 32) (bvadd (select (select .cse11 |c_~#top~0.base|) (_ bv0 32)) (_ bv1 32)))))))))) (or (forall ((v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (let ((.cse12 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481))) (store .cse12 |c_~#top~0.base| (store (store (select .cse12 |c_~#top~0.base|) (_ bv0 32) (_ bv1 32)) |c_~#top~0.offset| v_ArrVal_1487))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_~#top~0.base|) (_ bv0 32)))) .cse0 (not (= (_ bv0 32) (bvadd (select .cse6 (_ bv0 32)) (_ bv1 32))))) (or (forall ((v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (let ((.cse13 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| v_ArrVal_1485)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base| (store .cse13 |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 .cse7)) (or (forall ((v_DerPreprocessor_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (let ((.cse16 (store .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45))) (or (= (_ bv1 32) (select (select (store (let ((.cse15 (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#m~0.base| v_ArrVal_1481))) (let ((.cse14 (store (select (store .cse15 |c_~#top~0.base| (store (select (store .cse16 |c_~#m~0.base| v_ArrVal_1481) |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1485)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32) (_ bv1 32)))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse14) |c_~#top~0.base| (store (select (store (store .cse15 |c_~#top~0.base| v_DerPreprocessor_40) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse14) |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1487)))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32))) (not (= (_ bv0 32) (bvadd (_ bv1 32) (select (select .cse16 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|))) (= |c_~#top~0.base| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|)))) .cse10) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| (_ BitVec 32))) (or (not (= (bvadd (_ bv1 32) (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|))) (= |c_~#top~0.base| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (forall ((v_ArrVal_1481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (_ BitVec 32))) (= (select (select (store (let ((.cse17 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1481))) (let ((.cse18 (store (select (store .cse17 |c_~#top~0.base| (store (select .cse17 |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1485)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32) (_ bv1 32)))) (store (store .cse17 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse18) |c_~#top~0.base| (store (select (store (store .cse17 |c_~#top~0.base| v_DerPreprocessor_40) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37| .cse18) |c_~#top~0.base|) |c_~#top~0.offset| v_ArrVal_1487)))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_37|) (_ bv0 32)) (_ bv1 32))))))))) is different from false [2024-09-08 06:45:33,521 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-09-08 06:45:35,551 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] Killed by 15