./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-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_longest-1.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e94c40da 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_longest-1.i ./goblint.2024-09-02_08-21-23.files/protection-local/26_stack_cas_longest-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-dev-e94c40d-m [2024-09-24 13:04:04,180 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 13:04:04,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-24 13:04:04,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 13:04:04,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 13:04:04,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 13:04:04,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 13:04:04,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 13:04:04,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 13:04:04,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 13:04:04,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 13:04:04,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 13:04:04,251 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 13:04:04,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 13:04:04,251 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 13:04:04,254 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 13:04:04,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-24 13:04:04,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 13:04:04,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 13:04:04,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 13:04:04,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 13:04:04,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 13:04:04,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 13:04:04,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 13:04:04,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 13:04:04,255 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 13:04:04,255 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 13:04:04,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 13:04:04,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 13:04:04,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 13:04:04,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-24 13:04:04,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 13:04:04,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 13:04:04,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 13:04:04,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-24 13:04:04,256 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-24 13:04:04,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-24 13:04:04,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 13:04:04,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-24 13:04:04,257 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-24 13:04:04,258 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-24 13:04:04,258 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-24 13:04:04,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 13:04:04,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 13:04:04,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 13:04:04,474 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 13:04:04,475 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 13:04:04,475 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-1.i [2024-09-24 13:04:05,601 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 13:04:05,807 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 13:04:05,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-1.i [2024-09-24 13:04:05,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0d4309c58/491a54b52d71478f8fc248a055b80f6c/FLAG5093c6213 [2024-09-24 13:04:06,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0d4309c58/491a54b52d71478f8fc248a055b80f6c [2024-09-24 13:04:06,196 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-24 13:04:06,197 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-24 13:04:06,197 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_longest-1.yml/witness.yml [2024-09-24 13:04:06,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 13:04:06,234 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-24 13:04:06,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 13:04:06,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 13:04:06,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 13:04:06,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 01:04:06" (1/2) ... [2024-09-24 13:04:06,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@349a0964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 01:04:06, skipping insertion in model container [2024-09-24 13:04:06,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 01:04:06" (1/2) ... [2024-09-24 13:04:06,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2fdfad4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 01:04:06, skipping insertion in model container [2024-09-24 13:04:06,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 01:04:06" (2/2) ... [2024-09-24 13:04:06,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@349a0964 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 01:04:06, skipping insertion in model container [2024-09-24 13:04:06,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 01:04:06" (2/2) ... [2024-09-24 13:04:06,263 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-24 13:04:06,264 INFO L1541 ArrayList]: Location invariant before [L751-L751] (m == 0 || m == 1) && (m2 == 0 || m2 == 1) [2024-09-24 13:04:06,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 13:04:06,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 13:04:06,532 INFO L200 MainTranslator]: Completed pre-run Start Parsing Local [2024-09-24 13:04:06,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 13:04:06,626 INFO L204 MainTranslator]: Completed translation [2024-09-24 13:04:06,627 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 01:04:06 WrapperNode [2024-09-24 13:04:06,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 13:04:06,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 13:04:06,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 13:04:06,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 13:04:06,633 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 24.09 01:04:06" (1/1) ... [2024-09-24 13:04:06,643 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 24.09 01:04:06" (1/1) ... [2024-09-24 13:04:06,670 INFO L138 Inliner]: procedures = 179, calls = 51, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 200 [2024-09-24 13:04:06,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 13:04:06,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 13:04:06,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 13:04:06,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 13:04:06,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 01:04:06" (1/1) ... [2024-09-24 13:04:06,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 01:04:06" (1/1) ... [2024-09-24 13:04:06,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 01:04:06" (1/1) ... [2024-09-24 13:04:06,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 01:04:06" (1/1) ... [2024-09-24 13:04:06,694 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 01:04:06" (1/1) ... [2024-09-24 13:04:06,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 01:04:06" (1/1) ... [2024-09-24 13:04:06,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 01:04:06" (1/1) ... [2024-09-24 13:04:06,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 01:04:06" (1/1) ... [2024-09-24 13:04:06,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 13:04:06,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 13:04:06,713 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 13:04:06,713 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 13:04:06,714 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 01:04:06" (1/1) ... [2024-09-24 13:04:06,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-24 13:04:06,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:06,745 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-24 13:04:06,746 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-24 13:04:06,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-09-24 13:04:06,831 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-09-24 13:04:06,831 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-09-24 13:04:06,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-09-24 13:04:06,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-24 13:04:06,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 13:04:06,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-24 13:04:06,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-24 13:04:06,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-24 13:04:06,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-24 13:04:06,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 13:04:06,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 13:04:06,838 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-24 13:04:06,959 INFO L242 CfgBuilder]: Building ICFG [2024-09-24 13:04:06,961 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 13:04:07,174 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-24 13:04:07,176 INFO L291 CfgBuilder]: Performing block encoding [2024-09-24 13:04:07,339 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 13:04:07,339 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-24 13:04:07,340 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 01:04:07 BoogieIcfgContainer [2024-09-24 13:04:07,341 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 13:04:07,343 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 13:04:07,343 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 13:04:07,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 13:04:07,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 01:04:06" (1/4) ... [2024-09-24 13:04:07,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51598b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 01:04:07, skipping insertion in model container [2024-09-24 13:04:07,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 01:04:06" (2/4) ... [2024-09-24 13:04:07,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51598b18 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 24.09 01:04:07, skipping insertion in model container [2024-09-24 13:04:07,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 01:04:06" (3/4) ... [2024-09-24 13:04:07,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51598b18 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 24.09 01:04:07, skipping insertion in model container [2024-09-24 13:04:07,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 01:04:07" (4/4) ... [2024-09-24 13:04:07,350 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longest-1.i [2024-09-24 13:04:07,362 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 13:04:07,363 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-24 13:04:07,363 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-24 13:04:07,406 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-24 13:04:07,442 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 13:04:07,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 13:04:07,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:07,445 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-24 13:04:07,467 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-24 13:04:07,489 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 13:04:07,516 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-09-24 13:04:07,523 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;@5152091, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 13:04:07,524 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 13:04:07,630 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:07,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:07,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1521780113, now seen corresponding path program 1 times [2024-09-24 13:04:07,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:07,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497717516] [2024-09-24 13:04:07,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:07,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:07,904 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-24 13:04:07,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:07,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497717516] [2024-09-24 13:04:07,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497717516] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:04:07,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:04:07,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 13:04:07,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929106744] [2024-09-24 13:04:07,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:04:07,910 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 13:04:07,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:07,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 13:04:07,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 13:04:07,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:07,929 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:07,931 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-24 13:04:07,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:07,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:07,983 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-24 13:04:07,984 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:07,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:07,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1823734536, now seen corresponding path program 1 times [2024-09-24 13:04:07,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:07,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834198296] [2024-09-24 13:04:07,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:07,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:08,319 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-24 13:04:08,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:08,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834198296] [2024-09-24 13:04:08,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834198296] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:04:08,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535106208] [2024-09-24 13:04:08,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:08,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:04:08,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:08,332 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-24 13:04:08,333 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-24 13:04:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:08,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-24 13:04:08,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:04:08,502 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-24 13:04:08,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:08,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:08,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:08,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:08,629 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-24 13:04:08,629 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 13:04:08,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535106208] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:04:08,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 13:04:08,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2024-09-24 13:04:08,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933986468] [2024-09-24 13:04:08,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:04:08,631 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 13:04:08,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:08,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 13:04:08,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-09-24 13:04:08,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:08,633 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:08,633 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-24 13:04:08,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:08,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:08,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-24 13:04:08,894 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-24 13:04:08,895 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:08,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:08,896 INFO L85 PathProgramCache]: Analyzing trace with hash 925778014, now seen corresponding path program 1 times [2024-09-24 13:04:08,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:08,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749519894] [2024-09-24 13:04:08,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:08,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:09,049 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-24 13:04:09,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:09,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749519894] [2024-09-24 13:04:09,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749519894] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:04:09,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:04:09,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 13:04:09,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885171893] [2024-09-24 13:04:09,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:04:09,051 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 13:04:09,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:09,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 13:04:09,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 13:04:09,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:09,054 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:09,055 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-24 13:04:09,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:09,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:09,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:09,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:09,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:09,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:09,139 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-24 13:04:09,139 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:09,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:09,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1291862496, now seen corresponding path program 1 times [2024-09-24 13:04:09,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:09,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675274574] [2024-09-24 13:04:09,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:09,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:09,192 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-24 13:04:09,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:09,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675274574] [2024-09-24 13:04:09,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675274574] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:04:09,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046365222] [2024-09-24 13:04:09,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:09,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:04:09,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:09,195 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-24 13:04:09,196 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-24 13:04:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:09,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-24 13:04:09,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:04:09,321 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-24 13:04:09,322 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:04:09,367 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-24 13:04:09,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046365222] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:04:09,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 13:04:09,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-24 13:04:09,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850850048] [2024-09-24 13:04:09,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 13:04:09,369 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-24 13:04:09,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:09,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-24 13:04:09,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-24 13:04:09,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:09,370 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:09,370 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-24 13:04:09,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:09,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:09,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:09,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:09,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:09,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:09,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:09,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:09,438 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-24 13:04:09,626 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-24 13:04:09,627 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:09,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:09,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1650478471, now seen corresponding path program 1 times [2024-09-24 13:04:09,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:09,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129791063] [2024-09-24 13:04:09,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:09,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:09,943 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-24 13:04:09,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:09,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129791063] [2024-09-24 13:04:09,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129791063] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:04:09,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035290928] [2024-09-24 13:04:09,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:09,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:04:09,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:09,946 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-24 13:04:09,948 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-24 13:04:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:10,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-24 13:04:10,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:04:10,090 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-24 13:04:10,090 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-24 13:04:10,192 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-24 13:04:10,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:10,247 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-24 13:04:10,247 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:04:10,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:04:10,364 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-24 13:04:10,367 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-24 13:04:10,494 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-24 13:04:10,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035290928] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:04:10,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 13:04:10,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2024-09-24 13:04:10,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424791476] [2024-09-24 13:04:10,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 13:04:10,495 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-24 13:04:10,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:10,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-24 13:04:10,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=467, Unknown=2, NotChecked=0, Total=552 [2024-09-24 13:04:10,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:10,497 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:10,497 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-24 13:04:10,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:10,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:10,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:10,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:10,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:10,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-24 13:04:10,791 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 1 remaining) [2024-09-24 13:04:10,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-24 13:04:10,992 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-24 13:04:10,996 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-09-24 13:04:10,998 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-09-24 13:04:11,000 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 13:04:11,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 13:04:11,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:11,001 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-24 13:04:11,002 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-24 13:04:11,005 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 13:04:11,005 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-24 13:04:11,006 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;@5152091, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 13:04:11,006 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 13:04:11,054 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-24 13:04:11,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:11,054 INFO L85 PathProgramCache]: Analyzing trace with hash -837336820, now seen corresponding path program 1 times [2024-09-24 13:04:11,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:11,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369876006] [2024-09-24 13:04:11,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:11,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:11,078 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-24 13:04:11,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:11,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369876006] [2024-09-24 13:04:11,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369876006] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:04:11,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:04:11,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 13:04:11,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107094239] [2024-09-24 13:04:11,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:04:11,081 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 13:04:11,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:11,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 13:04:11,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 13:04:11,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:11,082 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:11,083 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-24 13:04:11,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:11,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:11,104 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-24 13:04:11,104 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-24 13:04:11,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:11,104 INFO L85 PathProgramCache]: Analyzing trace with hash -828712491, now seen corresponding path program 1 times [2024-09-24 13:04:11,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:11,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261775023] [2024-09-24 13:04:11,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:11,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 13:04:11,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-24 13:04:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 13:04:11,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-24 13:04:11,148 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-24 13:04:11,149 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-24 13:04:11,149 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-24 13:04:11,151 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1] [2024-09-24 13:04:11,152 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-09-24 13:04:11,153 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-24 13:04:11,153 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-09-24 13:04:11,183 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-24 13:04:11,185 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 13:04:11,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 13:04:11,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:11,188 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-24 13:04:11,189 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-24 13:04:11,191 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 13:04:11,191 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-24 13:04:11,191 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;@5152091, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 13:04:11,191 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 13:04:11,402 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-24 13:04:11,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:11,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1218277817, now seen corresponding path program 1 times [2024-09-24 13:04:11,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:11,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938694406] [2024-09-24 13:04:11,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:11,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:11,449 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-24 13:04:11,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:11,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938694406] [2024-09-24 13:04:11,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938694406] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:04:11,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:04:11,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 13:04:11,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690945837] [2024-09-24 13:04:11,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:04:11,450 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 13:04:11,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:11,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 13:04:11,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 13:04:11,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:11,452 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:11,452 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-24 13:04:11,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:11,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:11,494 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-24 13:04:11,494 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-24 13:04:11,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:11,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1105059173, now seen corresponding path program 1 times [2024-09-24 13:04:11,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:11,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608680903] [2024-09-24 13:04:11,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:11,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:11,563 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-24 13:04:11,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:11,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608680903] [2024-09-24 13:04:11,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608680903] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:04:11,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366973319] [2024-09-24 13:04:11,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:11,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:04:11,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:11,565 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-24 13:04:11,566 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-24 13:04:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:11,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-24 13:04:11,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:04:11,689 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-24 13:04:11,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:04:11,721 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-24 13:04:11,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366973319] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:04:11,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 13:04:11,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-24 13:04:11,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437259595] [2024-09-24 13:04:11,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 13:04:11,722 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-24 13:04:11,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:11,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-24 13:04:11,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-24 13:04:11,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:11,723 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:11,723 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-24 13:04:11,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:11,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:11,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:11,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:11,774 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-24 13:04:11,964 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-24 13:04:11,965 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-24 13:04:11,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:11,965 INFO L85 PathProgramCache]: Analyzing trace with hash -904601861, now seen corresponding path program 1 times [2024-09-24 13:04:11,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:11,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85998079] [2024-09-24 13:04:11,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:11,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:12,066 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-24 13:04:12,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:12,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85998079] [2024-09-24 13:04:12,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85998079] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:04:12,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:04:12,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 13:04:12,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057858975] [2024-09-24 13:04:12,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:04:12,068 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-24 13:04:12,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:12,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-24 13:04:12,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-24 13:04:12,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:12,069 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:12,069 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-24 13:04:12,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:12,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:12,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:12,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:12,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:12,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:12,114 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-24 13:04:12,114 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-24 13:04:12,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:12,114 INFO L85 PathProgramCache]: Analyzing trace with hash -999344735, now seen corresponding path program 1 times [2024-09-24 13:04:12,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:12,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295398791] [2024-09-24 13:04:12,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:12,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:12,283 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-24 13:04:12,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:12,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295398791] [2024-09-24 13:04:12,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295398791] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:04:12,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851024472] [2024-09-24 13:04:12,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:12,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:04:12,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:12,286 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-24 13:04:12,287 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-24 13:04:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:12,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-24 13:04:12,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:04:12,475 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-24 13:04:12,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:12,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:12,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:12,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:12,618 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-24 13:04:12,618 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:04:12,698 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~state~0 0))) (and (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array Int Int)) (|~#m2~0.offset| Int)) (= (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_4))) (store .cse1 |c_~#m2~0.base| (store (select .cse1 |c_~#m2~0.base|) |~#m2~0.offset| 0))) |c_~#m~0.base|) |c_~#m~0.offset|) 0))) (or (forall ((|~#m2~0.offset| Int)) (= 0 (select (select (store |c_#memory_int| |c_~#m2~0.base| (store (select |c_#memory_int| |c_~#m2~0.base|) |~#m2~0.offset| 0)) |c_~#m~0.base|) |c_~#m~0.offset|))) .cse0))) is different from false [2024-09-24 13:04:12,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:04:12,710 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-24 13:04:12,716 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-24 13:04:12,758 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-24 13:04:12,782 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-24 13:04:12,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:04:12,794 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-24 13:04:12,797 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-24 13:04:12,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:04:12,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:04:12,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:04:12,855 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-24 13:04:12,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-09-24 13:04:12,970 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-24 13:04:12,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851024472] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:04:12,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 13:04:12,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 22 [2024-09-24 13:04:12,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148982790] [2024-09-24 13:04:12,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 13:04:12,971 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-24 13:04:12,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:12,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-24 13:04:12,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=257, Unknown=4, NotChecked=148, Total=506 [2024-09-24 13:04:12,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:12,972 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:12,972 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-24 13:04:12,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:12,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:12,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:12,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:13,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:13,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:13,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:13,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-24 13:04:13,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-24 13:04:13,548 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-24 13:04:13,549 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-24 13:04:13,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:13,549 INFO L85 PathProgramCache]: Analyzing trace with hash -323185154, now seen corresponding path program 1 times [2024-09-24 13:04:13,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:13,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323727806] [2024-09-24 13:04:13,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:13,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:13,643 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-24 13:04:13,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:13,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323727806] [2024-09-24 13:04:13,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323727806] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:04:13,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:04:13,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 13:04:13,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270028920] [2024-09-24 13:04:13,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:04:13,645 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 13:04:13,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:13,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 13:04:13,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 13:04:13,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:13,646 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:13,646 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-24 13:04:13,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:13,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:13,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:13,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-09-24 13:04:13,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-24 13:04:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:13,781 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-24 13:04:13,781 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-24 13:04:13,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:13,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1323347906, now seen corresponding path program 1 times [2024-09-24 13:04:13,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:13,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898253605] [2024-09-24 13:04:13,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:13,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:14,077 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-24 13:04:14,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:14,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898253605] [2024-09-24 13:04:14,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898253605] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:04:14,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543298932] [2024-09-24 13:04:14,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:14,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:04:14,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:14,079 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-24 13:04:14,080 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-24 13:04:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:14,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-24 13:04:14,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:04:14,224 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-24 13:04:14,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 11 treesize of output 11 [2024-09-24 13:04:14,328 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-24 13:04:14,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:14,380 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-24 13:04:14,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:04:14,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:04:14,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-09-24 13:04:14,459 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-24 13:04:14,586 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-24 13:04:14,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543298932] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:04:14,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 13:04:14,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2024-09-24 13:04:14,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104345370] [2024-09-24 13:04:14,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 13:04:14,587 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-24 13:04:14,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:14,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-24 13:04:14,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=472, Unknown=2, NotChecked=0, Total=552 [2024-09-24 13:04:14,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:14,588 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:14,588 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-24 13:04:14,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:14,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:14,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:14,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-09-24 13:04:14,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:14,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:14,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:14,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:14,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:14,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-24 13:04:14,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:14,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:04:14,952 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-24 13:04:15,140 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-24 13:04:15,141 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-24 13:04:15,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1233754093, now seen corresponding path program 1 times [2024-09-24 13:04:15,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:15,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636269880] [2024-09-24 13:04:15,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:15,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 13:04:15,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-24 13:04:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 13:04:15,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-24 13:04:15,192 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-24 13:04:15,192 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-24 13:04:15,192 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-24 13:04:15,193 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-09-24 13:04:15,194 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-09-24 13:04:15,194 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-24 13:04:15,194 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-09-24 13:04:15,234 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-24 13:04:15,235 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 13:04:15,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 13:04:15,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:15,237 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-24 13:04:15,239 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-24 13:04:15,240 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 13:04:15,240 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-09-24 13:04:15,241 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;@5152091, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 13:04:15,241 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 13:04:15,479 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:15,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:15,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1653505405, now seen corresponding path program 1 times [2024-09-24 13:04:15,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:15,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084509501] [2024-09-24 13:04:15,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:15,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:15,584 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-24 13:04:15,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:15,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084509501] [2024-09-24 13:04:15,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084509501] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:04:15,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:04:15,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 13:04:15,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440982919] [2024-09-24 13:04:15,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:04:15,586 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 13:04:15,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:15,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 13:04:15,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 13:04:15,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:15,587 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:15,587 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-24 13:04:15,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:15,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:15,642 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-24 13:04:15,642 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:15,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:15,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1329674543, now seen corresponding path program 1 times [2024-09-24 13:04:15,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:15,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204422729] [2024-09-24 13:04:15,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:15,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:15,695 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-24 13:04:15,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:15,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204422729] [2024-09-24 13:04:15,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204422729] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:04:15,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79903044] [2024-09-24 13:04:15,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:15,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:04:15,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:15,698 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-24 13:04:15,699 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-24 13:04:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:15,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-24 13:04:15,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:04:15,861 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-24 13:04:15,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:04:15,892 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-24 13:04:15,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79903044] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:04:15,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 13:04:15,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-24 13:04:15,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833694949] [2024-09-24 13:04:15,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 13:04:15,893 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-24 13:04:15,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:15,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-24 13:04:15,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-24 13:04:15,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:15,894 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:15,894 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-24 13:04:15,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:15,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:15,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:15,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:15,985 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-24 13:04:16,172 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-24 13:04:16,173 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:16,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:16,173 INFO L85 PathProgramCache]: Analyzing trace with hash -770286953, now seen corresponding path program 1 times [2024-09-24 13:04:16,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:16,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95885098] [2024-09-24 13:04:16,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:16,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:16,273 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-24 13:04:16,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:16,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95885098] [2024-09-24 13:04:16,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95885098] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:04:16,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:04:16,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 13:04:16,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750719297] [2024-09-24 13:04:16,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:04:16,274 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-24 13:04:16,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:16,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-24 13:04:16,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-24 13:04:16,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:16,275 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:16,275 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-24 13:04:16,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:16,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:16,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:16,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:16,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:16,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:16,417 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-24 13:04:16,417 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:16,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:16,417 INFO L85 PathProgramCache]: Analyzing trace with hash 222230507, now seen corresponding path program 1 times [2024-09-24 13:04:16,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:16,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002201654] [2024-09-24 13:04:16,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:16,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:16,526 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-24 13:04:16,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:16,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002201654] [2024-09-24 13:04:16,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002201654] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:04:16,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:04:16,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 13:04:16,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990930557] [2024-09-24 13:04:16,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:04:16,527 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 13:04:16,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:16,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 13:04:16,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 13:04:16,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:16,527 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:16,527 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-24 13:04:16,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:16,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:16,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:16,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:16,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:16,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:16,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:16,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:16,681 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-24 13:04:16,681 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:16,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:16,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1791435089, now seen corresponding path program 1 times [2024-09-24 13:04:16,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:16,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023447956] [2024-09-24 13:04:16,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:16,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:17,091 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-24 13:04:17,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:17,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023447956] [2024-09-24 13:04:17,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023447956] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:04:17,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835585318] [2024-09-24 13:04:17,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:17,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:04:17,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:17,092 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-24 13:04:17,093 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-24 13:04:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:17,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-09-24 13:04:17,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:04:17,285 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-24 13:04:17,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:17,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:17,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:17,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:17,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:17,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:17,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:17,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:17,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:17,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 13:04:17,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:17,678 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-24 13:04:17,678 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-24 13:04:17,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:17,768 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-24 13:04:17,768 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-24 13:04:17,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:17,844 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-24 13:04:17,844 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-24 13:04:17,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:17,958 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-09-24 13:04:17,958 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-24 13:04:18,297 INFO L349 Elim1Store]: treesize reduction 160, result has 30.1 percent of original size [2024-09-24 13:04:18,297 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-24 13:04:18,350 INFO L349 Elim1Store]: treesize reduction 68, result has 39.3 percent of original size [2024-09-24 13:04:18,350 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-24 13:04:18,874 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-24 13:04:18,874 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:04:18,979 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-24 13:04:18,985 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-24 13:04:18,991 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-24 13:04:18,996 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-24 13:04:19,028 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-24 13:04:20,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:04:20,041 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-24 13:04:20,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:04:20,062 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-24 13:04:20,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:04:20,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:04:20,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:04:20,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:04:20,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:04:20,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:04:20,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:04:20,345 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-24 13:04:20,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835585318] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:04:20,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 13:04:20,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 20] total 48 [2024-09-24 13:04:20,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69844147] [2024-09-24 13:04:20,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 13:04:20,346 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-09-24 13:04:20,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:20,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-09-24 13:04:20,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1628, Unknown=25, NotChecked=440, Total=2352 [2024-09-24 13:04:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:20,349 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:20,349 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-24 13:04:20,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:20,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:20,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:20,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:20,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:20,791 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_~state~0 0))) (let ((.cse14 (not (= c_~state~0 1))) (.cse19 (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 ((.cse23 (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 .cse23 |c_~#top~0.base| (store (select .cse23 |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 (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 ((.cse22 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_10))) (or (not (= (select (select (store (let ((.cse21 (store (select (store (store .cse22 |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| .cse21) |c_~#top~0.base| (store (select (store (store .cse22 |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .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 .cse22 |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0))))))) (.cse7 (or .cse19 .cse4)) (.cse8 (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 ((.cse20 (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| .cse20) |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| .cse20) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)))) .cse6)) (.cse2 (or .cse19 .cse14)) (.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) .cse7 (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 (and .cse7 .cse8) (not |c_thr1Thread2of3ForFork0_#t~switch18#1|)) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_DerPreprocessor_9 (Array Int Int))) (not (= (select (select (store (let ((.cse9 (store (select (store (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse9) |c_~#top~0.base| (store (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse9) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse6) (or (= c_~next_alloc_idx~0 0) (let ((.cse12 (+ 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 ((.cse11 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_10))) (let ((.cse10 (store (select (store (store .cse11 |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse10) |c_~#top~0.base| (store (select (store (store .cse11 |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse10) |c_~#top~0.base|) |c_~#top~0.offset| .cse12)))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_808 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_808) |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)) (not (= (select (select (store (let ((.cse13 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse13 |c_~#top~0.base| (store (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset| .cse12))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) .cse14)))) (not (= |c_thr1Thread2of3ForFork0_push_~newTop~0#1| 0)) (or .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 ((.cse15 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse15 |c_~#top~0.base| (store (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0))))) .cse8 .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)))) .cse14))) (or (= |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (not (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|))))))) is different from false [2024-09-24 13:04:21,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:21,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:21,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:21,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:21,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:04:21,034 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-24 13:04:21,222 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-24 13:04:21,222 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:21,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:21,222 INFO L85 PathProgramCache]: Analyzing trace with hash 801107341, now seen corresponding path program 2 times [2024-09-24 13:04:21,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:21,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594654198] [2024-09-24 13:04:21,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:21,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:21,404 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-24 13:04:21,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:21,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594654198] [2024-09-24 13:04:21,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594654198] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:04:21,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718177420] [2024-09-24 13:04:21,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 13:04:21,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:04:21,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:21,405 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-24 13:04:21,406 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-24 13:04:21,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 13:04:21,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 13:04:21,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-24 13:04:21,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:04:21,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-24 13:04:21,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:21,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:21,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:21,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-24 13:04:21,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:21,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:21,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:21,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:21,690 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-24 13:04:21,690 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 13:04:21,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718177420] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:04:21,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 13:04:21,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-09-24 13:04:21,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43318692] [2024-09-24 13:04:21,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:04:21,691 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 13:04:21,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:21,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 13:04:21,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-09-24 13:04:21,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:21,691 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:21,691 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-24 13:04:21,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:21,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:21,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:21,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:21,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:04:21,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:21,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:21,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:21,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:21,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:21,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:04:21,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:21,866 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-24 13:04:22,054 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-24 13:04:22,054 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:22,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:22,054 INFO L85 PathProgramCache]: Analyzing trace with hash -765518316, now seen corresponding path program 2 times [2024-09-24 13:04:22,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:22,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822169150] [2024-09-24 13:04:22,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:22,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:22,372 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-24 13:04:22,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:22,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822169150] [2024-09-24 13:04:22,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822169150] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:04:22,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669554593] [2024-09-24 13:04:22,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 13:04:22,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:04:22,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:22,374 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-24 13:04:22,375 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-24 13:04:22,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-24 13:04:22,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 13:04:22,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-24 13:04:22,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:04:22,738 INFO L349 Elim1Store]: treesize reduction 96, result has 35.6 percent of original size [2024-09-24 13:04:22,738 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-24 13:04:22,750 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-24 13:04:22,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:22,773 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-24 13:04:22,807 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-24 13:04:22,808 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-24 13:04:22,881 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-24 13:04:22,882 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-24 13:04:22,930 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-24 13:04:22,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:04:23,245 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-24 13:04:23,245 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 13:04:23,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669554593] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:04:23,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 13:04:23,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2024-09-24 13:04:23,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026558415] [2024-09-24 13:04:23,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:04:23,245 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 13:04:23,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:23,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 13:04:23,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-09-24 13:04:23,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:23,246 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:23,246 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-24 13:04:23,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:23,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:23,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:23,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:23,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:04:23,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:23,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:23,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:23,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:23,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:23,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:23,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:04:23,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:23,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:23,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-09-24 13:04:23,738 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-24 13:04:23,738 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:23,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:23,739 INFO L85 PathProgramCache]: Analyzing trace with hash 882666815, now seen corresponding path program 1 times [2024-09-24 13:04:23,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:23,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285656099] [2024-09-24 13:04:23,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:23,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:23,831 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-24 13:04:23,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:23,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285656099] [2024-09-24 13:04:23,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285656099] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:04:23,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:04:23,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 13:04:23,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724779857] [2024-09-24 13:04:23,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:04:23,832 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 13:04:23,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:23,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 13:04:23,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 13:04:23,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:23,834 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:23,834 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-24 13:04:23,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:23,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:23,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:23,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:23,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:04:23,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:23,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:23,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:04:24,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:24,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:24,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:24,080 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-09-24 13:04:24,080 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:24,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:24,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1259604423, now seen corresponding path program 1 times [2024-09-24 13:04:24,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:24,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055505540] [2024-09-24 13:04:24,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:24,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:24,206 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-24 13:04:24,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:24,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055505540] [2024-09-24 13:04:24,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055505540] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:04:24,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686490733] [2024-09-24 13:04:24,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:24,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:04:24,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:24,208 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-24 13:04:24,209 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-24 13:04:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:24,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-24 13:04:24,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:04:24,431 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-24 13:04:24,432 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:04:24,521 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-24 13:04:24,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686490733] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:04:24,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 13:04:24,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-09-24 13:04:24,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072565930] [2024-09-24 13:04:24,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 13:04:24,522 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-24 13:04:24,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:24,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-24 13:04:24,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-24 13:04:24,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:24,522 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:24,522 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-24 13:04:24,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:24,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:24,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:24,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:24,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:04:24,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:24,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:24,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:24,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:04:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 13:04:24,647 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-24 13:04:24,835 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-24 13:04:24,835 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:24,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:24,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1176978261, now seen corresponding path program 1 times [2024-09-24 13:04:24,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:24,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728596044] [2024-09-24 13:04:24,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:24,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:25,099 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-24 13:04:25,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:25,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728596044] [2024-09-24 13:04:25,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728596044] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:04:25,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62112944] [2024-09-24 13:04:25,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:25,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:04:25,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:25,101 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-24 13:04:25,103 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-24 13:04:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:25,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-24 13:04:25,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:04:25,331 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-24 13:04:25,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:25,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:25,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:25,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:25,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:25,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:25,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:25,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 13:04:25,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:25,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:25,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:25,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-24 13:04:25,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:25,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 13:04:25,716 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-24 13:04:25,716 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-24 13:04:25,865 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-24 13:04:25,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:25,915 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-24 13:04:25,916 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:04:26,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:04:26,002 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-24 13:04:26,003 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-24 13:04:26,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:04:26,555 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-24 13:04:26,570 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-24 13:04:26,587 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-24 13:04:26,603 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-24 13:04:26,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:04:26,714 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-24 13:04:26,745 INFO L349 Elim1Store]: treesize reduction 22, result has 60.0 percent of original size [2024-09-24 13:04:26,745 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-24 13:04:26,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 303 treesize of output 301 [2024-09-24 13:04:26,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:04:26,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 293 treesize of output 289 [2024-09-24 13:04:26,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:04:26,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 287 treesize of output 285 [2024-09-24 13:04:26,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:04:26,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:04:26,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:04:26,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 277 treesize of output 273 [2024-09-24 13:04:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 11 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2024-09-24 13:04:26,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62112944] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:04:26,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 13:04:26,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 37 [2024-09-24 13:04:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964627530] [2024-09-24 13:04:26,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 13:04:26,977 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-09-24 13:04:26,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:26,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-09-24 13:04:26,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=970, Unknown=23, NotChecked=268, Total=1406 [2024-09-24 13:04:26,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:26,980 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:26,980 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-24 13:04:26,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:26,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:26,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:26,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:26,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:04:26,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:26,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:26,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:26,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 13:04:26,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:27,867 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (= c_~state~0 0))) (let ((.cse11 (not (= c_~state~0 1))) (.cse17 (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))))) (.cse4 (not .cse12))) (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 ((.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))))))) (.cse5 (or .cse17 .cse12)) (.cse6 (or (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_DerPreprocessor_9 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse18 (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| .cse18) |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| .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 |c_#memory_int| |c_~#m2~0.base| v_ArrVal_811) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0)))) .cse4)) (.cse2 (or .cse17 .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) .cse5 .cse1 (or (and .cse5 .cse6) (not |c_thr1Thread2of3ForFork0_#t~switch18#1|)) (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 .cse12 (forall ((v_ArrVal_812 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (|v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| Int)) (or (not (= (select (select (store (let ((.cse13 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_812) |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse13 |c_~#top~0.base| (store (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#casret~0#1.base_21|) 0) 1) 0))))) .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 ((.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-24 13:04:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-24 13:04:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 13:04:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:04:28,601 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-24 13:04:28,789 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-24 13:04:28,790 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:28,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:28,790 INFO L85 PathProgramCache]: Analyzing trace with hash 425971427, now seen corresponding path program 1 times [2024-09-24 13:04:28,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:28,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550330029] [2024-09-24 13:04:28,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:28,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:28,873 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-24 13:04:28,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:28,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550330029] [2024-09-24 13:04:28,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550330029] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:04:28,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:04:28,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 13:04:28,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256924436] [2024-09-24 13:04:28,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:04:28,874 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 13:04:28,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:28,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 13:04:28,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 13:04:28,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:28,875 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:28,875 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-24 13:04:28,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:28,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:28,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:28,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:28,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-09-24 13:04:28,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:28,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:28,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:28,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 13:04:28,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:04:28,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:29,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:29,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:29,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:29,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:29,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-24 13:04:29,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:29,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:29,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:29,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 13:04:29,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:04:29,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:29,342 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-09-24 13:04:29,342 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:29,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:29,342 INFO L85 PathProgramCache]: Analyzing trace with hash 701199428, now seen corresponding path program 1 times [2024-09-24 13:04:29,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:29,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061579286] [2024-09-24 13:04:29,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:29,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:30,016 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-24 13:04:30,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:30,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061579286] [2024-09-24 13:04:30,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061579286] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:04:30,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172370286] [2024-09-24 13:04:30,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:30,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:04:30,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:30,018 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-24 13:04:30,019 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-24 13:04:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:30,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-24 13:04:30,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:04:30,320 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-24 13:04:30,320 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-24 13:04:30,458 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-24 13:04:30,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 16 treesize of output 11 [2024-09-24 13:04:30,521 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-24 13:04:30,522 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:04:30,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:04:30,616 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-24 13:04:30,618 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-24 13:04:30,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-09-24 13:04:30,750 INFO L349 Elim1Store]: treesize reduction 11, result has 60.7 percent of original size [2024-09-24 13:04:30,750 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-24 13:04:30,848 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-24 13:04:30,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172370286] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:04:30,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 13:04:30,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 37 [2024-09-24 13:04:30,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710508255] [2024-09-24 13:04:30,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 13:04:30,849 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-09-24 13:04:30,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:30,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-09-24 13:04:30,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1271, Unknown=2, NotChecked=0, Total=1406 [2024-09-24 13:04:30,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:30,850 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:30,850 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-24 13:04:30,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:30,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:30,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:30,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:30,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-24 13:04:30,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:30,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:30,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:30,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 13:04:30,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:04:30,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:30,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:32,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:32,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:32,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:32,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:32,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-24 13:04:32,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:32,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:32,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:32,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 13:04:32,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:04:32,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:32,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-24 13:04:32,868 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-24 13:04:33,055 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-24 13:04:33,056 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:33,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:33,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1378747720, now seen corresponding path program 1 times [2024-09-24 13:04:33,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:33,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208553878] [2024-09-24 13:04:33,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:33,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:33,580 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-24 13:04:33,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:33,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208553878] [2024-09-24 13:04:33,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208553878] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:04:33,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972595979] [2024-09-24 13:04:33,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:33,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:04:33,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:33,582 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-24 13:04:33,583 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-24 13:04:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:33,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-24 13:04:33,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:04:33,805 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-24 13:04:33,806 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-24 13:04:33,900 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-24 13:04:33,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 13:04:33,945 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-24 13:04:33,945 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:04:34,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:04:34,018 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-24 13:04:34,019 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-24 13:04:34,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-24 13:04:34,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972595979] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:04:34,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 13:04:34,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2024-09-24 13:04:34,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988925811] [2024-09-24 13:04:34,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 13:04:34,134 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-24 13:04:34,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:34,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-24 13:04:34,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=523, Unknown=2, NotChecked=0, Total=600 [2024-09-24 13:04:34,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:34,135 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:34,135 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-24 13:04:34,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:34,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:34,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:34,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:34,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-24 13:04:34,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:34,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:34,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:34,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 13:04:34,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:04:34,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:34,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-09-24 13:04:34,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-24 13:04:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 13:04:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:04:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-09-24 13:04:36,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-24 13:04:36,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-09-24 13:04:36,823 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-24 13:04:36,823 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:36,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:36,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1085853016, now seen corresponding path program 1 times [2024-09-24 13:04:36,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:36,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197928491] [2024-09-24 13:04:36,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:36,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:37,161 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-24 13:04:37,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:37,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197928491] [2024-09-24 13:04:37,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197928491] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:04:37,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675526797] [2024-09-24 13:04:37,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:37,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:04:37,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:37,164 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-24 13:04:37,165 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-24 13:04:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:37,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-09-24 13:04:37,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:04:37,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:37,628 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-24 13:04:37,628 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-24 13:04:37,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:37,714 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-24 13:04:37,714 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-24 13:04:37,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:37,784 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-24 13:04:37,784 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-24 13:04:37,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:37,816 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-24 13:04:37,817 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-24 13:04:37,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:37,855 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-24 13:04:37,855 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-24 13:04:37,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:37,883 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-24 13:04:37,883 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-24 13:04:37,971 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-09-24 13:04:37,971 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-24 13:04:37,982 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-24 13:04:37,983 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-24 13:04:37,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:04:38,034 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-24 13:04:38,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:04:38,129 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-24 13:04:38,154 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-24 13:04:38,160 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-24 13:04:38,198 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-09-24 13:04:38,198 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-24 13:04:38,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:04:38,362 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-24 13:04:38,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675526797] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:04:38,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 13:04:38,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 13] total 35 [2024-09-24 13:04:38,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88536897] [2024-09-24 13:04:38,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 13:04:38,363 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-09-24 13:04:38,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:38,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-09-24 13:04:38,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=927, Unknown=7, NotChecked=192, Total=1260 [2024-09-24 13:04:38,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:38,364 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:38,364 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-24 13:04:38,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:38,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:38,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:38,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:38,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-24 13:04:38,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:38,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:38,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:38,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-24 13:04:38,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:04:38,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:38,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-09-24 13:04:38,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-09-24 13:04:38,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-24 13:04:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-24 13:04:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:04:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-09-24 13:04:41,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-24 13:04:41,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-09-24 13:04:41,034 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-24 13:04:41,220 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-24 13:04:41,220 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:41,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:41,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1994314252, now seen corresponding path program 1 times [2024-09-24 13:04:41,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:41,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524075256] [2024-09-24 13:04:41,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:41,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:41,360 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-24 13:04:41,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:41,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524075256] [2024-09-24 13:04:41,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524075256] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:04:41,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:04:41,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 13:04:41,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066469306] [2024-09-24 13:04:41,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:04:41,361 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 13:04:41,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:41,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 13:04:41,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 13:04:41,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:41,362 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:41,362 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-24 13:04:41,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:41,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:41,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:41,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:41,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-24 13:04:41,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:41,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:41,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:41,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-24 13:04:41,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:04:41,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:41,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2024-09-24 13:04:41,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-24 13:04:41,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-09-24 13:04:41,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:42,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:42,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:42,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:42,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:42,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-24 13:04:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:04:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:04:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2024-09-24 13:04:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-24 13:04:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-09-24 13:04:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:42,184 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-09-24 13:04:42,185 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:42,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:42,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1384830022, now seen corresponding path program 1 times [2024-09-24 13:04:42,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:42,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820924242] [2024-09-24 13:04:42,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:42,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:43,262 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-24 13:04:43,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:43,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820924242] [2024-09-24 13:04:43,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820924242] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:04:43,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424160032] [2024-09-24 13:04:43,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:43,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:04:43,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:43,264 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-24 13:04:43,265 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-24 13:04:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:43,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-24 13:04:43,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:04:43,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:43,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:43,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:43,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:43,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:43,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 13:04:43,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:43,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:43,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:43,821 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-24 13:04:43,821 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-24 13:04:43,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:43,862 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-24 13:04:43,862 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-24 13:04:43,868 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-24 13:04:43,868 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-24 13:04:44,014 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-24 13:04:44,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:04:44,077 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-24 13:04:44,077 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:04:44,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:04:44,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-09-24 13:04:44,154 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-24 13:04:44,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:04:44,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:04:44,267 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-24 13:04:44,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-09-24 13:04:44,385 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 32 proven. 34 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-24 13:04:44,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424160032] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:04:44,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 13:04:44,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 34 [2024-09-24 13:04:44,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194113635] [2024-09-24 13:04:44,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 13:04:44,386 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-09-24 13:04:44,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:44,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-09-24 13:04:44,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1052, Unknown=4, NotChecked=0, Total=1190 [2024-09-24 13:04:44,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:44,386 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:44,387 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-24 13:04:44,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:44,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:44,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:44,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:44,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-24 13:04:44,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:44,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:44,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:44,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:04:44,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:04:44,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:44,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2024-09-24 13:04:44,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-24 13:04:44,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-09-24 13:04:44,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:44,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:46,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:46,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-24 13:04:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:04:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:04:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-09-24 13:04:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-24 13:04:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-09-24 13:04:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-24 13:04:46,894 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-24 13:04:47,081 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-24 13:04:47,081 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:47,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:47,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2018876800, now seen corresponding path program 2 times [2024-09-24 13:04:47,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:47,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917206553] [2024-09-24 13:04:47,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:47,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:47,445 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-24 13:04:47,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:47,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917206553] [2024-09-24 13:04:47,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917206553] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:04:47,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056485209] [2024-09-24 13:04:47,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 13:04:47,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:04:47,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:47,446 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-24 13:04:47,447 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-24 13:04:47,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 13:04:47,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 13:04:47,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-24 13:04:47,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:04:47,880 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-24 13:04:47,880 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-24 13:04:47,903 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-24 13:04:47,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:04:48,085 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-24 13:04:48,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056485209] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:04:48,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 13:04:48,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 27 [2024-09-24 13:04:48,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422370469] [2024-09-24 13:04:48,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 13:04:48,086 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-24 13:04:48,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:48,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-24 13:04:48,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=644, Unknown=1, NotChecked=0, Total=756 [2024-09-24 13:04:48,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:48,086 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:48,086 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-24 13:04:48,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:48,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:48,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:48,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:48,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-24 13:04:48,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:48,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:48,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:48,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:04:48,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:04:48,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:48,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 122 states. [2024-09-24 13:04:48,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-24 13:04:48,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-09-24 13:04:48,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:48,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-24 13:04:48,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-24 13:04:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:04:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:04:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-09-24 13:04:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-24 13:04:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-09-24 13:04:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-24 13:04:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-24 13:04:51,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-09-24 13:04:51,312 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-24 13:04:51,312 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:04:51,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:04:51,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1087457335, now seen corresponding path program 1 times [2024-09-24 13:04:51,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:04:51,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503963403] [2024-09-24 13:04:51,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:51,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:04:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:51,681 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-24 13:04:51,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:04:51,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503963403] [2024-09-24 13:04:51,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503963403] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:04:51,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009082235] [2024-09-24 13:04:51,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:04:51,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:04:51,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:04:51,684 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-24 13:04:51,685 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-24 13:04:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:04:51,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-09-24 13:04:51,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:04:52,159 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-24 13:04:52,159 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-24 13:04:52,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:52,201 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-24 13:04:52,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 27 treesize of output 29 [2024-09-24 13:04:52,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:52,268 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-24 13:04:52,268 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-24 13:04:52,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:52,437 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-24 13:04:52,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:04:52,439 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-24 13:04:52,487 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2024-09-24 13:04:52,487 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-24 13:04:52,499 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-24 13:04:52,511 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-24 13:04:52,511 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-24 13:04:52,536 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-24 13:04:52,536 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-24 13:04:52,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:04:52,541 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-24 13:04:52,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:04:52,648 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-24 13:04:52,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-24 13:04:52,701 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-24 13:04:52,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:04:54,917 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-24 13:04:54,952 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-24 13:04:54,981 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-09-24 13:04:54,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 68 [2024-09-24 13:04:54,988 INFO L349 Elim1Store]: treesize reduction 3, result has 72.7 percent of original size [2024-09-24 13:04:54,988 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-24 13:04:54,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:04:54,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:04:54,995 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-24 13:04:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2024-09-24 13:04:55,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009082235] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:04:55,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 13:04:55,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17, 12] total 33 [2024-09-24 13:04:55,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402869130] [2024-09-24 13:04:55,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 13:04:55,043 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-24 13:04:55,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:04:55,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-24 13:04:55,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=868, Unknown=17, NotChecked=122, Total=1122 [2024-09-24 13:04:55,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:55,044 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:04:55,044 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-24 13:04:55,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:55,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:55,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:55,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:55,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-24 13:04:55,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:55,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:55,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:04:55,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:04:55,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:04:55,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:04:55,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-09-24 13:04:55,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-24 13:04:55,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2024-09-24 13:04:55,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:04:55,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-24 13:04:55,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-09-24 13:04:55,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:04:57,816 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-24 13:05:02,002 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-24 13:05:04,034 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-24 13:05:08,198 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-24 13:05:12,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 13:05:16,276 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-24 13:05:18,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 13:05:20,284 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-24 13:05:22,299 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-24 13:05:28,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 13:05:29,512 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (select .cse5 0)) (.cse4 (select .cse5 |c_~#top~0.offset|)) (.cse3 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (and (= |c_~#m~0.offset| 0) (or (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| |c_~#top~0.base|) (= .cse0 3)) (= |c_~#top~0.offset| 0) (<= |c_~#m~0.base| 3) (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_2535 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2535))) (or (let ((.cse1 (select .cse2 |c_~#top~0.base|))) (= (select .cse1 |c_~#top~0.offset|) (select (select (store (store .cse2 |c_~#top~0.base| (store .cse1 |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 .cse2 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1)))) (= (select .cse3 0) 1) (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse0) (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse4) (= 3 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|) (or (= |c_~#m~0.offset| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (not (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| |c_~#m~0.base|))) (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 0) (<= 4 |c_~#top~0.base|) (forall ((v_DerPreprocessor_30 (Array Int Int))) (= .cse4 (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse5 |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 .cse3 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1)))) is different from false [2024-09-24 13:05:31,557 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-24 13:05:39,766 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-24 13:05:41,769 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-24 13:05:43,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 13:05:45,785 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-24 13:05:47,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-24 13:05:49,798 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-24 13:05:51,802 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-24 13:05:53,808 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-24 13:05:55,830 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-24 13:05:57,832 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-24 13:05:59,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 13:06:01,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 13:06:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:06:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:06:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:06:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:06:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-24 13:06:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:06:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:06:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:06:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:06:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:06:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:06:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-09-24 13:06:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-24 13:06:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-09-24 13:06:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:06:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-24 13:06:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-24 13:06:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-09-24 13:06:11,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-09-24 13:06:11,876 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-24 13:06:11,876 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:06:11,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:06:11,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1402148267, now seen corresponding path program 1 times [2024-09-24 13:06:11,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:06:11,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755640143] [2024-09-24 13:06:11,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:06:11,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:06:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:06:12,097 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-24 13:06:12,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:06:12,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755640143] [2024-09-24 13:06:12,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755640143] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:06:12,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99020656] [2024-09-24 13:06:12,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:06:12,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:06:12,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:06:12,100 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-24 13:06:12,103 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-24 13:06:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:06:12,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-24 13:06:12,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:06:12,303 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-24 13:06:12,323 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-24 13:06:12,323 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-24 13:06:12,362 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-09-24 13:06:12,362 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-24 13:06:12,365 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-24 13:06:12,368 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-24 13:06:12,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:06:12,384 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-24 13:06:12,430 INFO L349 Elim1Store]: treesize reduction 82, result has 30.5 percent of original size [2024-09-24 13:06:12,430 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-24 13:06:12,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:06:12,476 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-24 13:06:12,480 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-24 13:06:12,523 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-09-24 13:06:12,523 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-24 13:06:12,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:06:12,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:06:12,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:06:12,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:06:12,551 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-09-24 13:06:12,552 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-24 13:06:12,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-09-24 13:06:12,613 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-24 13:06:12,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:06:12,657 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_40 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| Int)) (or (= (select v_DerPreprocessor_40 |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_40) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1))) is different from false [2024-09-24 13:06:12,690 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-24 13:06:12,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:06:12,709 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-24 13:06:12,756 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2024-09-24 13:06:12,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99020656] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:06:12,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 13:06:12,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 22 [2024-09-24 13:06:12,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102752629] [2024-09-24 13:06:12,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 13:06:12,756 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-24 13:06:12,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:06:12,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-24 13:06:12,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=321, Unknown=2, NotChecked=74, Total=462 [2024-09-24 13:06:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:06:12,757 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:06:12,757 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-24 13:06:12,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:06:12,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:06:12,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:06:12,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:06:12,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-24 13:06:12,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:06:12,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:06:12,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:06:12,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:06:12,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:06:12,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:06:12,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-09-24 13:06:12,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-24 13:06:12,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-09-24 13:06:12,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:06:12,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-24 13:06:12,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-09-24 13:06:12,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2024-09-24 13:06:12,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:06:15,378 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-24 13:06:17,490 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-24 13:06:19,593 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-24 13:06:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:06:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:06:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:06:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:06:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-24 13:06:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:06:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:06:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:06:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:06:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:06:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:06:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-09-24 13:06:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-24 13:06:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-09-24 13:06:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:06:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-24 13:06:20,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-24 13:06:20,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-09-24 13:06:20,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-24 13:06:20,179 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-24 13:06:20,367 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-24 13:06:20,367 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:06:20,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:06:20,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1345921391, now seen corresponding path program 1 times [2024-09-24 13:06:20,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:06:20,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63373711] [2024-09-24 13:06:20,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:06:20,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:06:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:06:22,307 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-24 13:06:22,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:06:22,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63373711] [2024-09-24 13:06:22,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63373711] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:06:22,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912185070] [2024-09-24 13:06:22,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:06:22,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:06:22,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:06:22,309 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-24 13:06:22,310 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-24 13:06:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:06:22,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-09-24 13:06:22,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:06:22,702 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-24 13:06:22,702 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-24 13:06:23,039 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-24 13:06:23,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 13:06:23,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:06:23,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:06:23,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:06:23,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 13:06:23,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:06:23,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:06:23,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:06:23,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:06:23,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:06:23,723 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-09-24 13:06:23,723 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-24 13:06:23,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:06:23,888 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-24 13:06:23,888 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-24 13:06:24,160 INFO L349 Elim1Store]: treesize reduction 46, result has 37.0 percent of original size [2024-09-24 13:06:24,160 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-24 13:06:24,439 INFO L349 Elim1Store]: treesize reduction 126, result has 26.7 percent of original size [2024-09-24 13:06:24,439 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-24 13:06:24,588 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-24 13:06:24,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:06:24,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:06:24,766 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-24 13:06:24,766 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:06:24,931 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-24 13:06:24,968 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-24 13:06:27,041 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-24 13:06:30,848 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-24 13:06:31,916 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-24 13:06:32,187 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-24 13:06:32,424 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-24 13:06:32,853 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-24 13:06:33,046 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-24 13:06:33,765 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-24 13:06:34,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:06:34,304 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-24 13:06:34,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 3438 treesize of output 3338 [2024-09-24 13:06:34,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:06:34,593 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-24 13:06:34,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:06:34,643 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-24 13:06:34,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:06:34,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:06:34,736 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-24 13:06:34,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:06:34,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 90 treesize of output 88 [2024-09-24 13:06:38,417 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2024-09-24 13:06:38,418 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-24 13:06:38,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:06:38,474 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-24 13:06:38,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:06:38,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:06:38,589 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-24 13:06:38,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:06:38,681 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-24 13:06:38,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:06:38,747 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-24 13:06:38,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:06:47,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:06:47,751 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-24 13:06:47,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 6 treesize of output 4 [2024-09-24 13:06:47,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:06:47,793 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-24 13:06:48,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:06:48,925 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-24 13:06:48,963 INFO L349 Elim1Store]: treesize reduction 3, result has 72.7 percent of original size [2024-09-24 13:06:48,965 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-24 13:06:49,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:06:49,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:06:49,031 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-24 13:06:49,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:06:49,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:06:49,045 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-24 13:06:49,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:06:49,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:06:49,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 152 [2024-09-24 13:06:49,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:06:49,272 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-24 13:06:49,277 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-09-24 13:06:49,277 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-24 13:06:49,281 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-24 13:06:49,309 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2024-09-24 13:06:49,309 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-24 13:06:49,358 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-24 13:06:49,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:06:49,378 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-24 13:06:49,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:06:49,501 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-24 13:06:49,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:06:49,547 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-24 13:06:49,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:06:49,595 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-24 13:06:49,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:06:51,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:06:54,557 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-24 13:06:54,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912185070] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:06:54,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 13:06:54,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 26] total 77 [2024-09-24 13:06:54,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643162737] [2024-09-24 13:06:54,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 13:06:54,558 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2024-09-24 13:06:54,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 13:06:54,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2024-09-24 13:06:54,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=4252, Unknown=71, NotChecked=1410, Total=6006 [2024-09-24 13:06:54,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:06:54,560 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:06:54,560 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-24 13:06:54,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:06:54,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:06:54,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:06:54,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:06:54,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-24 13:06:54,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:06:54,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:06:54,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:06:54,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:06:54,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:06:54,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:06:54,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-09-24 13:06:54,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-24 13:06:54,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-09-24 13:06:54,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:06:54,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-24 13:06:54,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-09-24 13:06:54,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-09-24 13:06:54,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-24 13:06:54,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:07:18,231 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-24 13:07:20,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-24 13:07:26,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-24 13:07:54,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:07:54,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:07:54,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:07:54,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:07:54,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-24 13:07:54,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:07:54,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:07:54,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:07:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:07:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-24 13:07:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:07:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-09-24 13:07:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-24 13:07:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-09-24 13:07:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:07:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-24 13:07:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-24 13:07:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-09-24 13:07:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-24 13:07:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-09-24 13:07:54,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-09-24 13:07:54,787 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-24 13:07:54,788 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:07:54,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:07:54,788 INFO L85 PathProgramCache]: Analyzing trace with hash 92829193, now seen corresponding path program 1 times [2024-09-24 13:07:54,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 13:07:54,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393791979] [2024-09-24 13:07:54,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:07:54,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 13:07:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:07:55,646 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-24 13:07:55,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 13:07:55,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393791979] [2024-09-24 13:07:55,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393791979] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 13:07:55,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348728424] [2024-09-24 13:07:55,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:07:55,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 13:07:55,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:07:55,648 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-24 13:07:55,649 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-24 13:07:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:07:55,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-09-24 13:07:55,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:07:56,171 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-24 13:07:56,171 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-24 13:07:56,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-09-24 13:07:56,278 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-24 13:07:56,278 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-24 13:07:56,332 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-24 13:07:56,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:07:56,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:07:56,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:07:56,526 INFO L349 Elim1Store]: treesize reduction 36, result has 21.7 percent of original size [2024-09-24 13:07:56,526 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-24 13:07:56,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:07:56,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:07:56,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:07:56,610 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-09-24 13:07:56,610 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-24 13:07:56,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:07:56,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:07:56,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:07:56,847 INFO L349 Elim1Store]: treesize reduction 28, result has 39.1 percent of original size [2024-09-24 13:07:56,847 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-24 13:07:56,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 5 treesize of output 3 [2024-09-24 13:07:56,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:07:56,866 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-24 13:07:56,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:07:56,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:07:56,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:07:56,898 INFO L349 Elim1Store]: treesize reduction 61, result has 4.7 percent of original size [2024-09-24 13:07:56,898 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-24 13:07:56,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:07:57,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:07:57,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:07:57,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:07:57,156 INFO L349 Elim1Store]: treesize reduction 168, result has 21.5 percent of original size [2024-09-24 13:07:57,156 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-24 13:07:57,164 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-24 13:07:57,237 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-24 13:07:57,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-09-24 13:07:57,317 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-09-24 13:07:57,317 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-24 13:07:57,520 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-24 13:07:57,520 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:07:57,737 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-24 13:07:58,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:07:58,481 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-24 13:07:58,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:07:58,551 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-24 13:08:04,493 INFO L349 Elim1Store]: treesize reduction 195, result has 83.8 percent of original size [2024-09-24 13:08:04,493 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-24 13:08:05,091 INFO L349 Elim1Store]: treesize reduction 775, result has 15.0 percent of original size [2024-09-24 13:08:05,091 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-24 13:08:05,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:08:05,647 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-24 13:08:05,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:08:05,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:08:05,962 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-24 13:08:06,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:08:06,124 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-24 13:08:06,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:08:06,282 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-24 13:08:06,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:08:06,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:08:06,588 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-24 13:08:06,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:08:06,780 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-24 13:08:06,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:08:06,949 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-24 13:08:07,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:08:07,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1166 treesize of output 1167 [2024-09-24 13:08:07,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:08:07,283 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-24 13:08:07,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:08:07,454 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-24 13:08:07,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:08:07,627 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-24 13:08:07,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:08:07,817 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-24 13:08:07,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:08:07,994 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-24 13:08:08,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:08:08,182 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-24 13:08:08,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:08:08,366 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-24 13:08:08,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:08:08,581 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-24 13:08:08,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:08:08,784 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-24 13:08:09,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:08:09,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1088 treesize of output 1089 [2024-09-24 13:09:47,194 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-24 13:09:47,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-09-24 13:09:47,195 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-09-24 13:09:47,209 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-24 13:09:47,396 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-24 13:09:47,396 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-24 13:09:47,401 INFO L158 Benchmark]: Toolchain (without parser) took 341167.76ms. Allocated memory was 176.2MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 141.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-09-24 13:09:47,401 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 13:09:47,401 INFO L158 Benchmark]: Witness Parser took 0.09ms. Allocated memory is still 176.2MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 13:09:47,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.16ms. Allocated memory is still 176.2MB. Free memory was 140.5MB in the beginning and 115.9MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-09-24 13:09:47,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.22ms. Allocated memory is still 176.2MB. Free memory was 115.9MB in the beginning and 113.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 13:09:47,402 INFO L158 Benchmark]: Boogie Preprocessor took 40.73ms. Allocated memory is still 176.2MB. Free memory was 113.3MB in the beginning and 111.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 13:09:47,402 INFO L158 Benchmark]: RCFGBuilder took 628.16ms. Allocated memory is still 176.2MB. Free memory was 111.2MB in the beginning and 93.1MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-09-24 13:09:47,402 INFO L158 Benchmark]: TraceAbstraction took 340057.93ms. Allocated memory was 176.2MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 92.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-09-24 13:09:47,402 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.13ms. Allocated memory is still 109.1MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.09ms. Allocated memory is still 176.2MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.16ms. Allocated memory is still 176.2MB. Free memory was 140.5MB in the beginning and 115.9MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.22ms. Allocated memory is still 176.2MB. Free memory was 115.9MB in the beginning and 113.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.73ms. Allocated memory is still 176.2MB. Free memory was 113.3MB in the beginning and 111.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 628.16ms. Allocated memory is still 176.2MB. Free memory was 111.2MB in the beginning and 93.1MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 340057.93ms. Allocated memory was 176.2MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 92.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. 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: 98, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 42, dependent conditional: 0, dependent unconditional: 42, 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: 98, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 42, dependent conditional: 0, dependent unconditional: 42, 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: 39, independent: 32, independent conditional: 0, independent unconditional: 32, 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.0s, 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: 39, independent: 32, independent conditional: 0, independent unconditional: 32, 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: 263, independent: 146, independent conditional: 3, independent unconditional: 143, dependent: 118, dependent conditional: 24, dependent unconditional: 94, 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.3s, 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: 263, independent: 146, independent conditional: 3, independent unconditional: 143, dependent: 118, dependent conditional: 24, dependent unconditional: 94, 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-24 13:09:47,456 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-24 13:09:47,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Ended with exit code 0 [2024-09-24 13:09:47,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Ended with exit code 0 [2024-09-24 13:09:48,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with 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_longest-1.i ./goblint.2024-09-02_08-21-23.files/protection-local/26_stack_cas_longest-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-dev-e94c40d-m [2024-09-24 13:09:49,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 13:09:49,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-09-24 13:09:49,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 13:09:49,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 13:09:49,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 13:09:49,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 13:09:49,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 13:09:49,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 13:09:49,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 13:09:49,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 13:09:49,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 13:09:49,945 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 13:09:49,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 13:09:49,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 13:09:49,946 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 13:09:49,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 13:09:49,947 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 13:09:49,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 13:09:49,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 13:09:49,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 13:09:49,950 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-24 13:09:49,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 13:09:49,950 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-24 13:09:49,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 13:09:49,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 13:09:49,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 13:09:49,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 13:09:49,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 13:09:49,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 13:09:49,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 13:09:49,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-24 13:09:49,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 13:09:49,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 13:09:49,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 13:09:49,952 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-24 13:09:49,952 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-24 13:09:49,952 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-24 13:09:49,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 13:09:49,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-24 13:09:49,953 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-24 13:09:49,953 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-24 13:09:49,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-24 13:09:49,954 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-24 13:09:50,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 13:09:50,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 13:09:50,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 13:09:50,212 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-24 13:09:50,213 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-24 13:09:50,213 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_longest-1.yml/witness.yml [2024-09-24 13:09:50,251 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 13:09:50,251 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 13:09:50,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-1.i [2024-09-24 13:09:51,450 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 13:09:51,668 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 13:09:51,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-1.i [2024-09-24 13:09:51,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fe76099f5/505bcbd16a0348938223ff54c60f514b/FLAG80f4a7be0 [2024-09-24 13:09:52,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fe76099f5/505bcbd16a0348938223ff54c60f514b [2024-09-24 13:09:52,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 13:09:52,016 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-24 13:09:52,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 13:09:52,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 13:09:52,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 13:09:52,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 01:09:50" (1/2) ... [2024-09-24 13:09:52,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7b8311 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 01:09:52, skipping insertion in model container [2024-09-24 13:09:52,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 01:09:50" (1/2) ... [2024-09-24 13:09:52,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2fcca50f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 01:09:52, skipping insertion in model container [2024-09-24 13:09:52,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 01:09:52" (2/2) ... [2024-09-24 13:09:52,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7b8311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 01:09:52, skipping insertion in model container [2024-09-24 13:09:52,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 01:09:52" (2/2) ... [2024-09-24 13:09:52,053 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-24 13:09:52,054 INFO L1541 ArrayList]: Location invariant before [L751-L751] (m == 0 || m == 1) && (m2 == 0 || m2 == 1) [2024-09-24 13:09:52,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 13:09:52,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 13:09:52,305 INFO L200 MainTranslator]: Completed pre-run Start Parsing Local [2024-09-24 13:09:52,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 13:09:52,400 INFO L204 MainTranslator]: Completed translation [2024-09-24 13:09:52,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 01:09:52 WrapperNode [2024-09-24 13:09:52,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 13:09:52,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 13:09:52,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 13:09:52,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 13:09:52,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 01:09:52" (1/1) ... [2024-09-24 13:09:52,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 01:09:52" (1/1) ... [2024-09-24 13:09:52,436 INFO L138 Inliner]: procedures = 183, calls = 51, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 197 [2024-09-24 13:09:52,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 13:09:52,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 13:09:52,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 13:09:52,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 13:09:52,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 01:09:52" (1/1) ... [2024-09-24 13:09:52,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 01:09:52" (1/1) ... [2024-09-24 13:09:52,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 01:09:52" (1/1) ... [2024-09-24 13:09:52,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 01:09:52" (1/1) ... [2024-09-24 13:09:52,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 01:09:52" (1/1) ... [2024-09-24 13:09:52,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 01:09:52" (1/1) ... [2024-09-24 13:09:52,465 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 01:09:52" (1/1) ... [2024-09-24 13:09:52,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 01:09:52" (1/1) ... [2024-09-24 13:09:52,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 13:09:52,470 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 13:09:52,470 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 13:09:52,470 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 13:09:52,472 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 01:09:52" (1/1) ... [2024-09-24 13:09:52,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-24 13:09:52,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:09:52,496 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-24 13:09:52,499 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-24 13:09:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-09-24 13:09:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-09-24 13:09:52,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-09-24 13:09:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-24 13:09:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 13:09:52,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-24 13:09:52,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-24 13:09:52,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-09-24 13:09:52,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-09-24 13:09:52,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-09-24 13:09:52,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-24 13:09:52,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 13:09:52,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 13:09:52,537 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-24 13:09:52,659 INFO L242 CfgBuilder]: Building ICFG [2024-09-24 13:09:52,661 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 13:09:52,943 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-24 13:09:52,943 INFO L291 CfgBuilder]: Performing block encoding [2024-09-24 13:09:53,151 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 13:09:53,152 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-24 13:09:53,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 01:09:53 BoogieIcfgContainer [2024-09-24 13:09:53,152 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 13:09:53,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 13:09:53,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 13:09:53,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 13:09:53,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 01:09:50" (1/4) ... [2024-09-24 13:09:53,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743a2f1c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 24.09 01:09:53, skipping insertion in model container [2024-09-24 13:09:53,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 01:09:52" (2/4) ... [2024-09-24 13:09:53,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743a2f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 01:09:53, skipping insertion in model container [2024-09-24 13:09:53,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 01:09:52" (3/4) ... [2024-09-24 13:09:53,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743a2f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 01:09:53, skipping insertion in model container [2024-09-24 13:09:53,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 01:09:53" (4/4) ... [2024-09-24 13:09:53,159 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longest-1.i [2024-09-24 13:09:53,171 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 13:09:53,171 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-24 13:09:53,171 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-24 13:09:53,211 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-24 13:09:53,239 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 13:09:53,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 13:09:53,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:09:53,241 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-24 13:09:53,242 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-24 13:09:53,267 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 13:09:53,276 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-09-24 13:09:53,280 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;@8ea5e9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 13:09:53,280 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 13:09:53,380 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:09:53,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:09:53,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1114168855, now seen corresponding path program 1 times [2024-09-24 13:09:53,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:09:53,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487150884] [2024-09-24 13:09:53,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:09:53,393 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-24 13:09:53,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:09:53,416 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-24 13:09:53,417 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-24 13:09:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:09:53,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-24 13:09:53,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:09:53,592 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-24 13:09:53,594 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 13:09:53,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:09:53,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487150884] [2024-09-24 13:09:53,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487150884] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:09:53,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:09:53,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 13:09:53,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522985288] [2024-09-24 13:09:53,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:09:53,601 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 13:09:53,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:09:53,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 13:09:53,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 13:09:53,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:09:53,623 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:09:53,624 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-24 13:09:53,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:09:53,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:09:53,672 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-24 13:09:53,871 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-24 13:09:53,872 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:09:53,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:09:53,872 INFO L85 PathProgramCache]: Analyzing trace with hash -148017800, now seen corresponding path program 1 times [2024-09-24 13:09:53,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:09:53,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618509843] [2024-09-24 13:09:53,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:09:53,873 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-24 13:09:53,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:09:53,877 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-24 13:09:53,878 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-24 13:09:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:09:53,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-24 13:09:53,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:09:54,046 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-24 13:09:54,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:09:54,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:09:54,244 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-24 13:09:54,244 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 13:09:54,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:09:54,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618509843] [2024-09-24 13:09:54,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618509843] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:09:54,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:09:54,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 13:09:54,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180551258] [2024-09-24 13:09:54,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:09:54,246 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 13:09:54,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:09:54,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 13:09:54,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-24 13:09:54,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:09:54,247 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:09:54,247 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-24 13:09:54,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:09:54,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:09:54,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:09:54,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:09:54,328 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 (4)] Forceful destruction successful, exit code 0 [2024-09-24 13:09:54,523 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-24 13:09:54,524 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:09:54,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:09:54,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1592448670, now seen corresponding path program 1 times [2024-09-24 13:09:54,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:09:54,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770984112] [2024-09-24 13:09:54,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:09:54,525 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-24 13:09:54,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:09:54,528 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-24 13:09:54,528 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-24 13:09:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:09:54,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-24 13:09:54,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:09:54,638 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-24 13:09:54,649 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-24 13:09:54,660 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-24 13:09:54,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:09:54,667 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-24 13:09:54,685 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-24 13:09:54,686 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 13:09:54,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:09:54,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770984112] [2024-09-24 13:09:54,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770984112] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:09:54,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:09:54,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 13:09:54,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175776550] [2024-09-24 13:09:54,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:09:54,688 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 13:09:54,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:09:54,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 13:09:54,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 13:09:54,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:09:54,689 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:09:54,689 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-24 13:09:54,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:09:54,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:09:54,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:09:54,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:09:54,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:09:54,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:09:54,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-09-24 13:09:55,024 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-24 13:09:55,025 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:09:55,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:09:55,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1754051290, now seen corresponding path program 1 times [2024-09-24 13:09:55,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:09:55,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199431670] [2024-09-24 13:09:55,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:09:55,029 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-24 13:09:55,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:09:55,033 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-24 13:09:55,034 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-24 13:09:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:09:55,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-24 13:09:55,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:09:55,159 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-24 13:09:55,159 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:09:55,217 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-24 13:09:55,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:09:55,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199431670] [2024-09-24 13:09:55,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199431670] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:09:55,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 13:09:55,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-09-24 13:09:55,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926207191] [2024-09-24 13:09:55,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 13:09:55,218 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 13:09:55,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:09:55,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 13:09:55,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-24 13:09:55,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:09:55,219 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:09:55,219 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-24 13:09:55,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:09:55,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:09:55,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:09:55,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:09:55,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:09:55,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:09:55,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:09:55,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:09:55,304 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 (6)] Forceful destruction successful, exit code 0 [2024-09-24 13:09:55,499 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-24 13:09:55,500 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:09:55,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:09:55,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2130591545, now seen corresponding path program 1 times [2024-09-24 13:09:55,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:09:55,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970681909] [2024-09-24 13:09:55,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:09:55,501 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-24 13:09:55,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:09:55,503 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-24 13:09:55,504 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-24 13:09:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:09:55,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-24 13:09:55,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:09:55,688 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-24 13:09:55,688 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-24 13:09:55,806 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-24 13:09:55,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-24 13:09:55,835 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-24 13:09:55,835 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:09:55,910 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-24 13:09:55,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:09:55,941 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-24 13:09:55,944 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-24 13:09:56,124 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-24 13:09:56,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:09:56,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970681909] [2024-09-24 13:09:56,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970681909] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:09:56,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 13:09:56,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-09-24 13:09:56,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382801169] [2024-09-24 13:09:56,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 13:09:56,125 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-24 13:09:56,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:09:56,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-24 13:09:56,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2024-09-24 13:09:56,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:09:56,126 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:09:56,126 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-24 13:09:56,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:09:56,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:09:56,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:09:56,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:09:56,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:09:56,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:09:56,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:09:56,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:09:56,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:09:56,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 13:09:56,454 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 1 remaining) [2024-09-24 13:09:56,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-09-24 13:09:56,658 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-24 13:09:56,664 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-09-24 13:09:56,665 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-09-24 13:09:56,667 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 13:09:56,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 13:09:56,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:09:56,669 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-24 13:09:56,670 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-24 13:09:56,672 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 13:09:56,672 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-24 13:09:56,672 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;@8ea5e9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 13:09:56,672 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 13:09:56,733 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-24 13:09:56,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:09:56,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1614565434, now seen corresponding path program 1 times [2024-09-24 13:09:56,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:09:56,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250178040] [2024-09-24 13:09:56,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:09:56,735 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-24 13:09:56,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:09:56,737 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-24 13:09:56,739 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-24 13:09:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:09:56,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-24 13:09:56,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:09:56,813 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-24 13:09:56,813 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 13:09:56,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:09:56,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250178040] [2024-09-24 13:09:56,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250178040] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:09:56,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:09:56,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 13:09:56,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241313387] [2024-09-24 13:09:56,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:09:56,817 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 13:09:56,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:09:56,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 13:09:56,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 13:09:56,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:09:56,818 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:09:56,818 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-24 13:09:56,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:09:56,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:09:56,846 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-24 13:09:57,046 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-24 13:09:57,046 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-24 13:09:57,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:09:57,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1917162261, now seen corresponding path program 1 times [2024-09-24 13:09:57,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:09:57,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973116384] [2024-09-24 13:09:57,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:09:57,047 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-24 13:09:57,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:09:57,048 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-24 13:09:57,049 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-24 13:09:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 13:09:57,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-24 13:09:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 13:09:57,161 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-09-24 13:09:57,161 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-24 13:09:57,162 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-24 13:09:57,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-09-24 13:09:57,365 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-24 13:09:57,366 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1] [2024-09-24 13:09:57,366 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-09-24 13:09:57,367 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-24 13:09:57,367 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-09-24 13:09:57,400 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-24 13:09:57,401 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 13:09:57,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 13:09:57,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:09:57,403 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-24 13:09:57,404 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-24 13:09:57,410 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 13:09:57,410 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-24 13:09:57,410 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;@8ea5e9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 13:09:57,411 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 13:09:57,670 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-24 13:09:57,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:09:57,670 INFO L85 PathProgramCache]: Analyzing trace with hash -826269901, now seen corresponding path program 1 times [2024-09-24 13:09:57,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:09:57,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774340576] [2024-09-24 13:09:57,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:09:57,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-24 13:09:57,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:09:57,673 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-24 13:09:57,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 (12)] Waiting until timeout for monitored process [2024-09-24 13:09:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:09:57,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-24 13:09:57,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:09:57,785 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-24 13:09:57,786 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 13:09:57,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:09:57,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774340576] [2024-09-24 13:09:57,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774340576] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:09:57,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:09:57,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 13:09:57,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966874876] [2024-09-24 13:09:57,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:09:57,786 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 13:09:57,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:09:57,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 13:09:57,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 13:09:57,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:09:57,787 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:09:57,787 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-24 13:09:57,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:09:57,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:09:57,879 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 (12)] Ended with exit code 0 [2024-09-24 13:09:58,077 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-24 13:09:58,077 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-24 13:09:58,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:09:58,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1039106021, now seen corresponding path program 1 times [2024-09-24 13:09:58,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:09:58,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763032642] [2024-09-24 13:09:58,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:09:58,078 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-24 13:09:58,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:09:58,080 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-24 13:09:58,080 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-24 13:09:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:09:58,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-24 13:09:58,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:09:58,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-24 13:09:58,218 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-24 13:09:58,218 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 13:09:58,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:09:58,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763032642] [2024-09-24 13:09:58,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763032642] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:09:58,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:09:58,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 13:09:58,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770229872] [2024-09-24 13:09:58,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:09:58,219 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-24 13:09:58,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:09:58,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-24 13:09:58,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-24 13:09:58,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:09:58,220 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:09:58,220 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-24 13:09:58,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:09:58,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:00,261 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-24 13:10:00,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:00,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:00,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 (13)] Ended with exit code 0 [2024-09-24 13:10:00,527 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-24 13:10:00,527 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-24 13:10:00,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:10:00,527 INFO L85 PathProgramCache]: Analyzing trace with hash -210511263, now seen corresponding path program 1 times [2024-09-24 13:10:00,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:10:00,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813104061] [2024-09-24 13:10:00,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:10:00,528 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-24 13:10:00,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:10:00,529 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-24 13:10:00,530 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-24 13:10:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:10:00,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-24 13:10:00,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:10:00,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-24 13:10:00,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 13:10:00,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-09-24 13:10:00,838 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-24 13:10:00,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:10:00,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:10:00,976 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-24 13:10:00,985 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m2~0.offset| (_ BitVec 32))) (or (not (= (_ bv0 32) (select v_arrayElimArr_4 |~#m2~0.offset|))) (= (_ bv0 32) (select (select (store |c_#memory_int| |c_~#m2~0.base| v_arrayElimArr_4) |c_~#m~0.base|) |c_~#m~0.offset|)))) (or (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (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_6) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_214) |c_~#top~0.base| v_DerPreprocessor_6) |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-24 13:10:01,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:10:01,081 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-24 13:10:01,084 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-24 13:10:01,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:10:01,093 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-24 13:10:01,095 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-24 13:10:01,097 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-24 13:10:01,192 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-24 13:10:01,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:10:01,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813104061] [2024-09-24 13:10:01,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813104061] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:10:01,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 13:10:01,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-09-24 13:10:01,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046319281] [2024-09-24 13:10:01,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 13:10:01,193 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-24 13:10:01,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:10:01,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-24 13:10:01,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=94, Unknown=1, NotChecked=20, Total=156 [2024-09-24 13:10:01,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:01,194 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:10:01,194 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-24 13:10:01,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:01,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:01,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:03,452 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-24 13:10:03,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:03,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:03,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:03,531 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-24 13:10:03,727 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-24 13:10:03,727 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-24 13:10:03,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:10:03,728 INFO L85 PathProgramCache]: Analyzing trace with hash -240740414, now seen corresponding path program 1 times [2024-09-24 13:10:03,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:10:03,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657874177] [2024-09-24 13:10:03,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:10:03,728 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-24 13:10:03,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:10:03,731 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-24 13:10:03,731 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-24 13:10:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:10:03,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-24 13:10:03,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:10:03,863 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-09-24 13:10:03,863 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-24 13:10:03,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-09-24 13:10:03,878 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-24 13:10:03,903 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-24 13:10:03,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:10:03,916 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-24 13:10:03,916 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 13:10:03,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:10:03,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657874177] [2024-09-24 13:10:03,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657874177] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:10:03,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:10:03,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 13:10:03,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997183986] [2024-09-24 13:10:03,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:10:03,917 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 13:10:03,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:10:03,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 13:10:03,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 13:10:03,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:03,917 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:10:03,917 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-24 13:10:03,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:03,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:03,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:03,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:04,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:04,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:04,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:04,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:04,117 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-24 13:10:04,314 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-24 13:10:04,314 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-24 13:10:04,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:10:04,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1541764542, now seen corresponding path program 1 times [2024-09-24 13:10:04,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:10:04,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466611360] [2024-09-24 13:10:04,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:10:04,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-24 13:10:04,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:10:04,316 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-24 13:10:04,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 (16)] Waiting until timeout for monitored process [2024-09-24 13:10:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:10:04,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-24 13:10:04,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:10:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 13:10:04,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:10:04,511 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-24 13:10:04,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:10:04,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466611360] [2024-09-24 13:10:04,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466611360] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:10:04,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 13:10:04,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-09-24 13:10:04,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592769428] [2024-09-24 13:10:04,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 13:10:04,511 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 13:10:04,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:10:04,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 13:10:04,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-24 13:10:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:04,512 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:10:04,512 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-24 13:10:04,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:04,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:04,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:04,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:04,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:04,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:04,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:04,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:04,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:04,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:04,603 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-24 13:10:04,799 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-24 13:10:04,799 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-24 13:10:04,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:10:04,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2137440580, now seen corresponding path program 1 times [2024-09-24 13:10:04,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:10:04,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364906277] [2024-09-24 13:10:04,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:10:04,800 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-24 13:10:04,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:10:04,801 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-24 13:10:04,802 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-24 13:10:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:10:04,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-24 13:10:04,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:10:04,973 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-24 13:10:04,973 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-24 13:10:05,082 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-24 13:10:05,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 13:10:05,130 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-24 13:10:05,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:10:05,214 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-24 13:10:05,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:10:05,236 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-24 13:10:05,238 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-24 13:10:05,396 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-24 13:10:05,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:10:05,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364906277] [2024-09-24 13:10:05,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364906277] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:10:05,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 13:10:05,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-09-24 13:10:05,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145843457] [2024-09-24 13:10:05,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 13:10:05,396 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-24 13:10:05,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:10:05,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-24 13:10:05,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-09-24 13:10:05,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:05,397 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:10:05,397 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-24 13:10:05,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:05,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:05,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:05,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:05,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:05,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:05,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:05,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:05,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:05,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:05,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:05,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:10:05,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-09-24 13:10:06,120 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-24 13:10:06,120 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-24 13:10:06,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:10:06,121 INFO L85 PathProgramCache]: Analyzing trace with hash 460945972, now seen corresponding path program 2 times [2024-09-24 13:10:06,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:10:06,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231654106] [2024-09-24 13:10:06,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 13:10:06,121 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-24 13:10:06,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:10:06,122 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-24 13:10:06,123 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-24 13:10:06,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 13:10:06,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 13:10:06,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-24 13:10:06,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:10:06,297 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-24 13:10:06,297 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-24 13:10:06,443 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-24 13:10:06,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:10:06,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:10:06,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:10:06,501 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-24 13:10:06,501 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:10:06,573 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-24 13:10:06,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:10:06,597 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-24 13:10:06,598 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-24 13:10:06,826 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-24 13:10:06,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:10:06,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231654106] [2024-09-24 13:10:06,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231654106] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:10:06,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 13:10:06,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-09-24 13:10:06,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840722488] [2024-09-24 13:10:06,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 13:10:06,827 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-24 13:10:06,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:10:06,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-24 13:10:06,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=166, Unknown=9, NotChecked=26, Total=240 [2024-09-24 13:10:06,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:06,827 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:10:06,828 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-24 13:10:06,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:06,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:06,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:06,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:06,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:06,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:10:06,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:09,189 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-24 13:10:09,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:09,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:09,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:09,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:09,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:09,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 13:10:09,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-24 13:10:09,246 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-24 13:10:09,441 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-24 13:10:09,441 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-24 13:10:09,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:10:09,442 INFO L85 PathProgramCache]: Analyzing trace with hash -956094227, now seen corresponding path program 1 times [2024-09-24 13:10:09,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:10:09,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1198806736] [2024-09-24 13:10:09,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:10:09,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-24 13:10:09,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:10:09,443 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-24 13:10:09,445 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-24 13:10:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 13:10:09,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-24 13:10:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 13:10:09,640 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-09-24 13:10:09,640 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-24 13:10:09,641 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-24 13:10:09,646 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-24 13:10:09,841 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-24 13:10:09,842 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-09-24 13:10:09,842 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-09-24 13:10:09,842 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-24 13:10:09,842 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-09-24 13:10:09,883 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-24 13:10:09,886 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 13:10:09,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 13:10:09,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 13:10:09,887 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-24 13:10:09,888 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-24 13:10:09,891 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 13:10:09,892 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-09-24 13:10:09,893 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;@8ea5e9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 13:10:09,893 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 13:10:10,357 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:10:10,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:10:10,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2126375043, now seen corresponding path program 1 times [2024-09-24 13:10:10,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:10:10,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089422372] [2024-09-24 13:10:10,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:10:10,358 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-24 13:10:10,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:10:10,361 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-24 13:10:10,362 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-24 13:10:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:10:10,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-24 13:10:10,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:10:10,499 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-24 13:10:10,499 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 13:10:10,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:10:10,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089422372] [2024-09-24 13:10:10,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089422372] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:10:10,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:10:10,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 13:10:10,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341071133] [2024-09-24 13:10:10,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:10:10,500 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 13:10:10,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:10:10,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 13:10:10,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 13:10:10,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:10,500 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:10:10,500 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-24 13:10:10,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:10,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:10,580 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-24 13:10:10,775 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-24 13:10:10,776 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:10:10,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:10:10,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1980207569, now seen corresponding path program 1 times [2024-09-24 13:10:10,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:10:10,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554902636] [2024-09-24 13:10:10,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:10:10,776 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-24 13:10:10,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:10:10,777 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-24 13:10:10,778 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-24 13:10:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:10:10,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-24 13:10:10,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:10:10,927 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-24 13:10:10,949 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-24 13:10:10,949 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 13:10:10,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:10:10,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554902636] [2024-09-24 13:10:10,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554902636] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:10:10,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:10:10,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 13:10:10,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908509219] [2024-09-24 13:10:10,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:10:10,949 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-24 13:10:10,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:10:10,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-24 13:10:10,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-24 13:10:10,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:10,950 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:10:10,950 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-24 13:10:10,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:10,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:12,977 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-24 13:10:15,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 13:10:17,100 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-24 13:10:19,233 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-24 13:10:19,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:19,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:19,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-09-24 13:10:19,481 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-24 13:10:19,482 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:10:19,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:10:19,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1145783191, now seen corresponding path program 1 times [2024-09-24 13:10:19,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:10:19,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313402320] [2024-09-24 13:10:19,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:10:19,482 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-24 13:10:19,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:10:19,484 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-24 13:10:19,485 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-24 13:10:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:10:19,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-24 13:10:19,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:10:19,633 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-24 13:10:19,633 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:10:19,709 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-24 13:10:19,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:10:19,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313402320] [2024-09-24 13:10:19,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313402320] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:10:19,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 13:10:19,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-09-24 13:10:19,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316932534] [2024-09-24 13:10:19,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 13:10:19,710 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 13:10:19,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:10:19,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 13:10:19,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-24 13:10:19,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:19,711 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:10:19,711 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-24 13:10:19,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:19,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:19,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:19,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:19,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:19,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:10:19,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-09-24 13:10:20,074 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-24 13:10:20,074 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:10:20,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:10:20,075 INFO L85 PathProgramCache]: Analyzing trace with hash 455569771, now seen corresponding path program 1 times [2024-09-24 13:10:20,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:10:20,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571562340] [2024-09-24 13:10:20,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:10:20,075 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-24 13:10:20,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:10:20,076 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-24 13:10:20,077 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-24 13:10:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:10:20,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-24 13:10:20,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:10:20,207 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-24 13:10:20,212 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-24 13:10:20,220 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-24 13:10:20,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:10:20,225 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-24 13:10:20,238 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-24 13:10:20,238 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 13:10:20,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:10:20,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571562340] [2024-09-24 13:10:20,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571562340] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:10:20,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:10:20,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 13:10:20,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758857009] [2024-09-24 13:10:20,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:10:20,238 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 13:10:20,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:10:20,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 13:10:20,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 13:10:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:20,239 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:10:20,239 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-24 13:10:20,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:20,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:20,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:10:20,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:20,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:20,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:20,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:10:20,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:20,497 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-24 13:10:20,692 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-24 13:10:20,692 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:10:20,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:10:20,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1522923375, now seen corresponding path program 1 times [2024-09-24 13:10:20,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:10:20,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270946308] [2024-09-24 13:10:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:10:20,693 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-24 13:10:20,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:10:20,694 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-24 13:10:20,695 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-24 13:10:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:10:20,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-24 13:10:20,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:10:20,919 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-24 13:10:20,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:10:21,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:10:21,034 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-24 13:10:21,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:10:21,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:10:21,182 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-24 13:10:21,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:10:21,326 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-24 13:10:21,328 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-24 13:10:21,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 89 [2024-09-24 13:10:21,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:10:21,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:10:21,378 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-24 13:10:21,382 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-24 13:10:21,468 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-24 13:10:21,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:10:21,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270946308] [2024-09-24 13:10:21,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270946308] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:10:21,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 13:10:21,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-09-24 13:10:21,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504933835] [2024-09-24 13:10:21,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 13:10:21,469 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-24 13:10:21,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:10:21,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-24 13:10:21,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=105, Unknown=7, NotChecked=0, Total=156 [2024-09-24 13:10:21,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:21,470 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:10:21,470 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-24 13:10:21,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:21,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:21,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:10:21,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:21,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:22,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:22,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:22,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:10:22,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:22,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:22,060 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 (25)] Forceful destruction successful, exit code 0 [2024-09-24 13:10:22,256 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-24 13:10:22,256 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:10:22,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:10:22,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1452080061, now seen corresponding path program 1 times [2024-09-24 13:10:22,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:10:22,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574326667] [2024-09-24 13:10:22,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:10:22,257 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-24 13:10:22,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:10:22,258 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-24 13:10:22,258 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-24 13:10:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:10:22,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-24 13:10:22,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:10:22,435 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-09-24 13:10:22,435 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-24 13:10:22,446 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-24 13:10:22,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:10:22,464 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-24 13:10:22,473 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-09-24 13:10:22,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-09-24 13:10:22,489 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-24 13:10:22,489 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 13:10:22,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:10:22,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574326667] [2024-09-24 13:10:22,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574326667] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:10:22,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:10:22,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 13:10:22,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775260571] [2024-09-24 13:10:22,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:10:22,490 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 13:10:22,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:10:22,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 13:10:22,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 13:10:22,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:22,491 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:10:22,491 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-24 13:10:22,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:22,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:22,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:10:22,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:22,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:22,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:22,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:22,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:22,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:10:22,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:22,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:22,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:22,854 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-24 13:10:23,050 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-24 13:10:23,050 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:10:23,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:10:23,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1179436776, now seen corresponding path program 1 times [2024-09-24 13:10:23,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:10:23,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037984833] [2024-09-24 13:10:23,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:10:23,051 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-24 13:10:23,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:10:23,052 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-24 13:10:23,053 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-24 13:10:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:10:23,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-24 13:10:23,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:10:23,271 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-24 13:10:23,271 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-24 13:10:23,389 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-24 13:10:23,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:10:23,437 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-24 13:10:23,437 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:10:23,510 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-24 13:10:23,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:10:23,529 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-24 13:10:23,531 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-24 13:10:23,687 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-24 13:10:23,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:10:23,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037984833] [2024-09-24 13:10:23,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037984833] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:10:23,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 13:10:23,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-09-24 13:10:23,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614369290] [2024-09-24 13:10:23,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 13:10:23,688 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-24 13:10:23,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:10:23,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-24 13:10:23,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-09-24 13:10:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:23,689 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:10:23,689 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-24 13:10:23,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:23,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:23,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:10:23,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:23,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:23,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:23,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:24,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:24,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:24,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:10:24,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:24,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:24,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:24,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:10:24,293 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-24 13:10:24,488 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-24 13:10:24,488 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:10:24,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:10:24,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1258041184, now seen corresponding path program 2 times [2024-09-24 13:10:24,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:10:24,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26207710] [2024-09-24 13:10:24,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 13:10:24,489 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-24 13:10:24,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:10:24,490 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-24 13:10:24,491 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-24 13:10:24,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 13:10:24,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 13:10:24,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-24 13:10:24,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:10:24,771 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-24 13:10:24,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-24 13:10:24,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-09-24 13:10:24,837 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-24 13:10:24,837 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 13:10:24,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:10:24,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26207710] [2024-09-24 13:10:24,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26207710] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:10:24,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:10:24,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 13:10:24,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165742713] [2024-09-24 13:10:24,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:10:24,838 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 13:10:24,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:10:24,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 13:10:24,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-24 13:10:24,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:24,838 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:10:24,838 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-24 13:10:24,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:24,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:24,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:10:24,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:24,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:24,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:24,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:10:24,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:10:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:10:25,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:25,238 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-24 13:10:25,433 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-24 13:10:25,433 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:10:25,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:10:25,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1390433366, now seen corresponding path program 1 times [2024-09-24 13:10:25,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:10:25,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29630539] [2024-09-24 13:10:25,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:10:25,435 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-24 13:10:25,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:10:25,435 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-24 13:10:25,436 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-24 13:10:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:10:25,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-24 13:10:25,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:10:25,676 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-24 13:10:25,676 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:10:25,825 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-24 13:10:25,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:10:25,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29630539] [2024-09-24 13:10:25,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29630539] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:10:25,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 13:10:25,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-09-24 13:10:25,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159751871] [2024-09-24 13:10:25,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 13:10:25,826 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-24 13:10:25,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:10:25,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-24 13:10:25,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-09-24 13:10:25,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:25,827 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:10:25,827 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-24 13:10:25,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:25,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:25,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:10:25,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:25,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:25,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:25,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:10:25,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:25,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:26,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:26,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:26,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:10:26,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:26,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:26,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:26,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:10:26,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:26,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 13:10:26,096 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-24 13:10:26,291 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-24 13:10:26,291 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:10:26,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:10:26,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1311039028, now seen corresponding path program 1 times [2024-09-24 13:10:26,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:10:26,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503871595] [2024-09-24 13:10:26,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:10:26,292 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-24 13:10:26,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:10:26,294 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-24 13:10:26,295 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-24 13:10:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:10:26,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-24 13:10:26,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:10:26,749 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-24 13:10:26,750 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-24 13:10:26,860 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-24 13:10:26,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:10:27,142 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-24 13:10:27,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:10:27,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503871595] [2024-09-24 13:10:27,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503871595] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:10:27,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 13:10:27,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2024-09-24 13:10:27,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950693625] [2024-09-24 13:10:27,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 13:10:27,143 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-24 13:10:27,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:10:27,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-24 13:10:27,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-09-24 13:10:27,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:27,144 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:10:27,144 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-24 13:10:27,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:27,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:27,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:10:27,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:27,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:27,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:27,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:10:27,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:27,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 13:10:27,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:28,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:28,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:28,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:10:28,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:28,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:28,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:28,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:10:28,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:28,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 13:10:28,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-24 13:10:28,021 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-24 13:10:28,217 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-24 13:10:28,217 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:10:28,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:10:28,217 INFO L85 PathProgramCache]: Analyzing trace with hash 585131588, now seen corresponding path program 2 times [2024-09-24 13:10:28,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:10:28,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174504457] [2024-09-24 13:10:28,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 13:10:28,218 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-24 13:10:28,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:10:28,219 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-24 13:10:28,219 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-24 13:10:28,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 13:10:28,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 13:10:28,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-24 13:10:28,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:10:28,509 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-24 13:10:28,509 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-24 13:10:28,654 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-24 13:10:28,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:10:28,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:10:28,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-24 13:10:28,758 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-24 13:10:28,758 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:10:28,842 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1019) |c_~#top~0.base|) |c_~#top~0.offset|)))) is different from false [2024-09-24 13:10:28,872 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-24 13:10:28,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:10:28,887 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-24 13:10:28,892 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-24 13:10:29,123 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-24 13:10:29,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:10:29,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174504457] [2024-09-24 13:10:29,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174504457] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:10:29,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 13:10:29,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-09-24 13:10:29,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467050132] [2024-09-24 13:10:29,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 13:10:29,125 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-24 13:10:29,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:10:29,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-24 13:10:29,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=255, Unknown=3, NotChecked=66, Total=380 [2024-09-24 13:10:29,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:29,126 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:10:29,126 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-24 13:10:29,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:29,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:29,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:10:29,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:29,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:29,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:29,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:10:29,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:29,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 13:10:29,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-09-24 13:10:29,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:32,423 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-24 13:10:32,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:32,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:32,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:10:32,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:32,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:32,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:32,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:10:32,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:32,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 13:10:32,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-24 13:10:32,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:10:32,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 (31)] Ended with exit code 0 [2024-09-24 13:10:32,755 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-24 13:10:32,755 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:10:32,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:10:32,755 INFO L85 PathProgramCache]: Analyzing trace with hash 741122395, now seen corresponding path program 1 times [2024-09-24 13:10:32,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:10:32,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479972367] [2024-09-24 13:10:32,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:10:32,756 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-24 13:10:32,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:10:32,757 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-24 13:10:32,757 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-24 13:10:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:10:32,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-24 13:10:32,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:10:33,381 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-24 13:10:33,381 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-24 13:10:33,490 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-24 13:10:33,490 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-24 13:10:33,658 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-24 13:10:33,659 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-24 13:10:33,779 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-24 13:10:33,779 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-24 13:10:33,987 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-09-24 13:10:33,988 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-24 13:10:34,004 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-24 13:10:34,004 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-24 13:10:34,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:10:34,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:10:34,113 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-24 13:10:34,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:10:34,140 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1101 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1101) |c_~#top~0.base|) |c_~#top~0.offset|)))) is different from false [2024-09-24 13:10:34,194 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-24 13:10:34,214 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-24 13:10:35,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:10:35,018 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-24 13:10:35,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:10:35,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:10:35,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:10:35,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 403 treesize of output 401 [2024-09-24 13:10:35,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:10:35,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:10:35,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:10:35,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:10:35,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 385 treesize of output 383 [2024-09-24 13:10:35,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:10:35,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:10:35,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:10:35,733 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-24 13:10:35,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:10:35,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479972367] [2024-09-24 13:10:35,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479972367] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:10:35,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 13:10:35,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2024-09-24 13:10:35,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767695585] [2024-09-24 13:10:35,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 13:10:35,734 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-24 13:10:35,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:10:35,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-24 13:10:35,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=725, Unknown=19, NotChecked=174, Total=1056 [2024-09-24 13:10:35,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:35,735 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:10:35,735 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-24 13:10:35,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:35,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:35,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:10:35,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:35,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:35,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:35,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:10:35,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:35,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 13:10:35,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-24 13:10:35,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:10:35,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:10:36,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:10:36,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:10:36,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:10:36,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:36,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:10:36,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:36,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:10:36,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:10:36,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 13:10:36,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-24 13:10:36,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:10:36,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-24 13:10:36,981 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-24 13:10:37,176 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-24 13:10:37,176 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:10:37,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:10:37,177 INFO L85 PathProgramCache]: Analyzing trace with hash -877004733, now seen corresponding path program 1 times [2024-09-24 13:10:37,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:10:37,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852811031] [2024-09-24 13:10:37,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:10:37,177 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-24 13:10:37,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:10:37,178 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-24 13:10:37,179 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-24 13:10:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:10:37,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-24 13:10:37,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:10:37,447 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-09-24 13:10:37,447 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-24 13:10:37,701 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-09-24 13:10:37,701 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-24 13:10:37,707 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-24 13:10:37,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:10:37,723 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-24 13:10:37,730 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-24 13:10:37,830 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-09-24 13:10:37,830 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-24 13:10:38,019 INFO L349 Elim1Store]: treesize reduction 4, result has 90.2 percent of original size [2024-09-24 13:10:38,019 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-24 13:10:38,028 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-24 13:10:38,224 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-24 13:10:38,322 INFO L378 Elim1Store]: Elim1 eliminated variable 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-24 13:10:38,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:10:38,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:10:38,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:10:38,422 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-24 13:10:38,422 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:10:38,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:10:38,492 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-24 13:10:38,499 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-24 13:10:38,578 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m~0.offset| (_ BitVec 32)) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_27 |~#m~0.offset|) (_ bv0 32))) (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#m~0.base| v_arrayElimArr_27) |c_~#m2~0.base|) |c_~#m2~0.offset|))))) (or (forall ((|~#m~0.offset| (_ BitVec 32)) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1166 (_ BitVec 32))) (or (not (= (select v_arrayElimArr_27 |~#m~0.offset|) (_ bv0 32))) (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_1166)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_28) |c_~#m~0.base| v_arrayElimArr_27) |c_~#m2~0.base|) |c_~#m2~0.offset|)))) (not .cse0))))) is different from false [2024-09-24 13:10:38,732 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-09-24 13:10:38,732 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-24 13:10:38,735 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-24 13:10:38,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:10:38,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:10:38,751 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-24 13:10:39,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:10:39,417 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-24 13:10:39,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:10:39,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:10:39,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:10:39,518 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-24 13:10:39,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 146 treesize of output 138 [2024-09-24 13:10:39,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:10:39,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:10:39,657 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-24 13:10:39,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:10:39,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 12 treesize of output 10 [2024-09-24 13:11:15,320 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-24 13:11:15,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:11:15,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852811031] [2024-09-24 13:11:15,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852811031] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:11:15,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 13:11:15,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2024-09-24 13:11:15,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124075887] [2024-09-24 13:11:15,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 13:11:15,321 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-24 13:11:15,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:11:15,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-24 13:11:15,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=343, Unknown=14, NotChecked=78, Total=506 [2024-09-24 13:11:15,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:11:15,322 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:11:15,322 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-24 13:11:15,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:11:15,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:11:15,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:15,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:15,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:11:15,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:15,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:15,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:15,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 13:11:15,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-24 13:11:15,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:15,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-09-24 13:11:15,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:11:19,034 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-24 13:11:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:11:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:11:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:11:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 13:11:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-24 13:11:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-24 13:11:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-24 13:11:20,681 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-24 13:11:20,876 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-24 13:11:20,877 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:11:20,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:11:20,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1897379409, now seen corresponding path program 1 times [2024-09-24 13:11:20,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:11:20,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731278817] [2024-09-24 13:11:20,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:11:20,877 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-24 13:11:20,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:11:20,878 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-24 13:11:20,879 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-24 13:11:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:11:21,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-24 13:11:21,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:11:21,062 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-24 13:11:21,067 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-24 13:11:21,074 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-24 13:11:21,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:11:21,079 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-24 13:11:21,095 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-24 13:11:21,096 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 13:11:21,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:11:21,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731278817] [2024-09-24 13:11:21,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731278817] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:11:21,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:11:21,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 13:11:21,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390066083] [2024-09-24 13:11:21,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:11:21,096 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 13:11:21,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:11:21,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 13:11:21,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 13:11:21,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:11:21,097 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:11:21,097 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-24 13:11:21,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:11:21,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:11:21,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:21,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:21,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:11:21,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:21,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:21,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:21,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 13:11:21,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-24 13:11:21,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:21,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-24 13:11:21,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-24 13:11:21,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:11:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:11:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:11:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:11:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 13:11:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-24 13:11:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-24 13:11:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-24 13:11:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:21,702 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-24 13:11:21,898 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-24 13:11:21,898 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:11:21,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:11:21,898 INFO L85 PathProgramCache]: Analyzing trace with hash -460996992, now seen corresponding path program 1 times [2024-09-24 13:11:21,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:11:21,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674753950] [2024-09-24 13:11:21,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:11:21,899 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-24 13:11:21,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:11:21,900 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-24 13:11:21,900 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-24 13:11:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:11:22,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-24 13:11:22,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:11:22,451 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-24 13:11:22,451 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-24 13:11:22,482 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-24 13:11:22,482 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:11:22,799 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-24 13:11:22,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:11:22,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674753950] [2024-09-24 13:11:22,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674753950] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:11:22,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 13:11:22,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2024-09-24 13:11:22,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984890050] [2024-09-24 13:11:22,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 13:11:22,800 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-24 13:11:22,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:11:22,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-24 13:11:22,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=338, Unknown=1, NotChecked=0, Total=420 [2024-09-24 13:11:22,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:11:22,801 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:11:22,801 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-24 13:11:22,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:11:22,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:11:22,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:22,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:22,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:11:22,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:22,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:22,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:22,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-24 13:11:22,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-09-24 13:11:22,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:22,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-24 13:11:22,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-09-24 13:11:22,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:22,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:11:24,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:11:24,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:11:24,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:24,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:24,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:11:24,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:24,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:24,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:24,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 13:11:24,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-24 13:11:24,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:24,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-24 13:11:24,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-09-24 13:11:24,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:24,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-24 13:11:24,832 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-24 13:11:25,026 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-24 13:11:25,026 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:11:25,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:11:25,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1192799301, now seen corresponding path program 1 times [2024-09-24 13:11:25,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:11:25,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421162413] [2024-09-24 13:11:25,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:11:25,027 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-24 13:11:25,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:11:25,028 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-24 13:11:25,029 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-24 13:11:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:11:25,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-24 13:11:25,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:11:25,404 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-24 13:11:25,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:11:25,410 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-24 13:11:25,413 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-24 13:11:25,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2024-09-24 13:11:25,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:11:25,421 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-24 13:11:25,459 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-24 13:11:25,460 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-24 13:11:25,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 13:11:25,513 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-24 13:11:25,513 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 13:11:25,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:11:25,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421162413] [2024-09-24 13:11:25,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421162413] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 13:11:25,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 13:11:25,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-24 13:11:25,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40870753] [2024-09-24 13:11:25,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 13:11:25,514 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-24 13:11:25,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:11:25,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-24 13:11:25,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-24 13:11:25,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:11:25,514 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:11:25,514 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-24 13:11:25,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:11:25,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:11:25,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:25,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:25,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:11:25,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:25,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:25,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:25,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-24 13:11:25,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-24 13:11:25,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:25,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-24 13:11:25,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-09-24 13:11:25,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:25,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-09-24 13:11:25,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:11:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:11:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:11:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:11:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 13:11:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-24 13:11:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-24 13:11:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-09-24 13:11:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-24 13:11:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-24 13:11:26,369 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-24 13:11:26,564 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-24 13:11:26,564 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:11:26,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:11:26,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1349471029, now seen corresponding path program 1 times [2024-09-24 13:11:26,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:11:26,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632530513] [2024-09-24 13:11:26,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 13:11:26,565 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-24 13:11:26,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:11:26,566 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-24 13:11:26,566 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-24 13:11:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 13:11:26,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-24 13:11:26,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:11:26,975 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-24 13:11:27,170 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-24 13:11:27,182 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-24 13:11:27,182 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-24 13:11:27,226 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-24 13:11:27,226 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-24 13:11:27,277 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-24 13:11:27,277 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-24 13:11:27,371 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-09-24 13:11:27,371 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-24 13:11:27,558 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-24 13:11:27,566 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-24 13:11:27,572 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-24 13:11:27,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:11:27,789 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-09-24 13:11:27,789 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-24 13:11:27,822 INFO L349 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2024-09-24 13:11:27,822 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-24 13:11:27,828 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-24 13:11:27,833 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-24 13:11:27,886 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-24 13:11:27,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:11:27,928 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-24 13:11:28,060 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-24 13:11:29,148 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-24 13:11:29,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:11:29,151 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-24 13:11:29,155 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-24 13:11:29,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:11:29,163 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-24 13:11:29,167 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-24 13:11:29,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:11:29,175 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-24 13:11:29,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:11:29,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:11:29,580 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-24 13:11:29,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:11:29,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632530513] [2024-09-24 13:11:29,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632530513] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:11:29,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 13:11:29,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2024-09-24 13:11:29,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972524340] [2024-09-24 13:11:29,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 13:11:29,580 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-24 13:11:29,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:11:29,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-24 13:11:29,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=647, Unknown=19, NotChecked=106, Total=870 [2024-09-24 13:11:29,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:11:29,581 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:11:29,581 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-24 13:11:29,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:11:29,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:11:29,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:29,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:29,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:11:29,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:29,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:29,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:29,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-24 13:11:29,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-24 13:11:29,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:29,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-24 13:11:29,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-09-24 13:11:29,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:29,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-24 13:11:29,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-24 13:11:29,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:11:34,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 13:11:35,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:11:35,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:11:35,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:35,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:35,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:11:35,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:35,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:35,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:35,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 13:11:35,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-24 13:11:35,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:35,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-24 13:11:35,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-09-24 13:11:35,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:35,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-24 13:11:35,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-24 13:11:35,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-24 13:11:35,635 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-24 13:11:35,829 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-24 13:11:35,830 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:11:35,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:11:35,830 INFO L85 PathProgramCache]: Analyzing trace with hash 116354577, now seen corresponding path program 2 times [2024-09-24 13:11:35,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:11:35,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101152861] [2024-09-24 13:11:35,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 13:11:35,830 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-24 13:11:35,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:11:35,831 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-24 13:11:35,832 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-24 13:11:36,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 13:11:36,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 13:11:36,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-24 13:11:36,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:11:36,178 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-24 13:11:36,360 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-24 13:11:36,360 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-24 13:11:36,395 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-24 13:11:36,402 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-24 13:11:36,408 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-24 13:11:36,413 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-24 13:11:36,480 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2024-09-24 13:11:36,480 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-24 13:11:36,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:11:36,489 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-24 13:11:36,494 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-24 13:11:36,533 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-24 13:11:36,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:11:36,648 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-24 13:11:36,683 INFO L349 Elim1Store]: treesize reduction 37, result has 28.8 percent of original size [2024-09-24 13:11:36,683 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-24 13:11:36,886 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-24 13:11:36,918 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-24 13:11:36,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:11:36,970 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-24 13:11:36,995 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-24 13:11:37,266 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse6 (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select .cse5 |c_~#top~0.offset|)))) (let ((.cse0 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (.cse1 (not .cse6))) (and (or .cse0 (and (or .cse1 (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse3 (store (select .cse4 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse2 (store .cse4 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse3))) (or (= (select (select .cse2 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)))))))) (or .cse6 (forall ((v_DerPreprocessor_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse7 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_55))) (or (= (_ bv1 32) (select (select .cse7 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (select (select (store (store .cse7 |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32)))))))) (or (not .cse0) (and (or (forall ((|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_52 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_52))) (or (= (_ bv1 32) (select (select .cse8 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (select (select (store .cse8 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32))))) .cse6) (or (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| v_DerPreprocessor_53)))) (store .cse10 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse10 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))))) (or (= (_ bv1 32) (select (select (store .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse9 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53))))) .cse1))))))) is different from false [2024-09-24 13:11:37,477 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-24 13:11:37,718 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (and (or (not .cse0) (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 ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (store .cse3 |c_~#top~0.base| (store (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))))) (store .cse2 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse2 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))))) (or (= (_ bv1 32) (select (select .cse1 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (= (select (select (store .cse1 |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)))))) (or .cse0 (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 ((.cse4 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse7 (store .cse4 |c_~#top~0.base| (store (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse5 (store (select .cse7 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse6 (store .cse7 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse5))) (or (= (_ bv1 32) (select (select (store (store (store .cse4 |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 .cse6 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (= (_ bv1 32) (select (select .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))))))))) is different from false [2024-09-24 13:11:52,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 13:11:52,648 INFO L349 Elim1Store]: treesize reduction 49, result has 40.2 percent of original size [2024-09-24 13:11:52,649 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-24 13:11:52,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:11:52,711 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-24 13:11:52,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 169 [2024-09-24 13:11:52,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:11:52,771 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-24 13:11:52,840 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-09-24 13:11:52,841 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-24 13:11:52,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:11:52,879 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-24 13:11:52,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:11:52,970 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-24 13:11:53,079 INFO L349 Elim1Store]: treesize reduction 50, result has 39.0 percent of original size [2024-09-24 13:11:53,079 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-24 13:11:53,143 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-09-24 13:11:53,143 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-24 13:11:53,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 690 treesize of output 668 [2024-09-24 13:11:53,221 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-09-24 13:11:53,221 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-24 13:11:53,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:11:53,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:11:53,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:11:56,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-24 13:11:58,069 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-24 13:11:58,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:11:58,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101152861] [2024-09-24 13:11:58,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101152861] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:11:58,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 13:11:58,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-09-24 13:11:58,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710050058] [2024-09-24 13:11:58,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 13:11:58,070 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-24 13:11:58,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:11:58,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-24 13:11:58,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=452, Unknown=25, NotChecked=240, Total=812 [2024-09-24 13:11:58,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:11:58,071 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:11:58,071 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-24 13:11:58,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:11:58,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:11:58,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:58,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:58,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:11:58,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:58,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:58,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:11:58,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-24 13:11:58,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-24 13:11:58,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:11:58,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-24 13:11:58,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-09-24 13:11:58,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:11:58,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-24 13:11:58,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-24 13:11:58,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-09-24 13:11:58,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:12:03,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 13:12:05,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 13:12:19,627 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-24 13:12:49,025 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-24 13:12:56,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 13:13:08,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 13:13:20,839 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|))) (.cse19 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (let ((.cse0 (not .cse19)) (.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 .cse0 (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 ((.cse16 (let ((.cse17 (let ((.cse18 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (store .cse18 |c_~#top~0.base| (store (select .cse18 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))))) (store .cse17 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse17 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))))) (or (= (_ bv1 32) (select (select .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse16 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (= (select (select (store .cse16 |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)))))) (or .cse19 (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 ((.cse21 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_57))) (let ((.cse23 (let ((.cse24 (store .cse21 |c_~#m~0.base| v_ArrVal_1566))) (store .cse24 |c_~#top~0.base| (store (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54))))) (let ((.cse22 (store (select .cse23 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse20 (store .cse23 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| .cse22))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|))) (not (= (select (select .cse20 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (not (= (_ bv0 32) (select (select .cse21 |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| .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|)) (= (_ bv1 32) (select (select .cse20 |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 ((.cse29 (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 ((.cse27 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_58) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse29))) (let ((.cse28 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse29) |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| (store (select (store .cse27 |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse25 (store (select .cse28 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse26 (store .cse28 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_39| .cse25))) (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| .cse25) |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 .cse26 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (= (_ bv1 32) (select (select .cse26 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse27 |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))))))))) .cse15))) (or .cse19 (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 ((.cse32 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_57))) (let ((.cse33 (let ((.cse34 (store .cse32 |c_~#m~0.base| v_ArrVal_1566))) (store .cse34 |c_~#top~0.base| (store (select .cse34 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54))))) (let ((.cse30 (store (select .cse33 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse31 (store .cse33 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse30))) (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| .cse30) |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 .cse31 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse31 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (not (= (_ bv0 32) (select (select .cse32 |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 ((.cse39 (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 ((.cse37 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_58) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse39))) (let ((.cse38 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse39) |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| (store (select (store .cse37 |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse36 (store (select .cse38 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse35 (store .cse38 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse36))) (or (not (= v_DerPreprocessor_54 (select (select .cse35 |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| .cse36) |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 .cse35 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse37 |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 ((.cse41 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_56))) (let ((.cse45 (store .cse41 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse42 (store (select .cse45 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse44 (store .cse45 |c_~#top~0.base| .cse42))) (let ((.cse43 (store (select .cse44 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse40 (store .cse44 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse43))) (or (not (= (select (select .cse40 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (not (= (_ bv0 32) (select (select .cse41 |c_~#m~0.base|) |c_~#m~0.offset|))) (= (_ bv1 32) (select (select .cse40 |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| .cse42) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse43) |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 ((.cse49 (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 ((.cse51 (store .cse49 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse47 (store (select .cse51 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse50 (store .cse51 |c_~#top~0.base| .cse47))) (let ((.cse48 (store (select .cse50 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse46 (store .cse50 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse48))) (or (= (_ bv1 32) (select (select .cse46 |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| .cse47) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse48) |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 .cse49 |c_~#m~0.base|) |c_~#m~0.offset|))) (not (= (select (select .cse46 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)))))))))) .cse15))) (or .cse19 (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 ((.cse52 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse55 (store .cse52 |c_~#top~0.base| (store (select .cse52 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse53 (store (select .cse55 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse54 (store .cse55 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse53))) (or (= (_ bv1 32) (select (select (store (store (store .cse52 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse53) |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 .cse54 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (= (_ bv1 32) (select (select .cse54 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))))))))))) is different from true [2024-09-24 13:13:33,857 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-24 13:13:37,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-24 13:13:39,682 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-24 13:13:43,693 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-24 13:13:50,386 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse10 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse21 |c_~#top~0.offset|))) (.cse1 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (let ((.cse0 (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (_ bv0 32)))) (.cse2 (not .cse1)) (.cse22 (not .cse10))) (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 (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 ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (store .cse5 |c_~#top~0.base| (store (select .cse5 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))))) (store .cse4 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse4 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))))) (or (= (_ bv1 32) (select (select .cse3 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (= (select (select (store .cse3 |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)))))) (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 ((.cse6 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse9 (store .cse6 |c_~#top~0.base| (store (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse7 (store (select .cse9 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse8 (store .cse9 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse7))) (or (= (_ bv1 32) (select (select (store (store (store .cse6 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse7) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (= (_ bv1 32) (select (select .cse8 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))) (not (= (select (select |c_#memory_int| |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))) (= (_ bv1 32) |c_thr1Thread3of3ForFork0_push_#t~mem13#1|) (or .cse1 (and (or .cse10 (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 ((.cse13 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_57))) (let ((.cse14 (let ((.cse15 (store .cse13 |c_~#m~0.base| v_ArrVal_1566))) (store .cse15 |c_~#top~0.base| (store (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54))))) (let ((.cse11 (store (select .cse14 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse12 (store .cse14 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse11))) (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| .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 .cse12 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse12 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (not (= (_ bv0 32) (select (select .cse13 |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 ((.cse20 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse21 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse18 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_58) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse20))) (let ((.cse19 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse20) |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| (store (select (store .cse18 |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse17 (store (select .cse19 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse16 (store .cse19 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse17))) (or (not (= v_DerPreprocessor_54 (select (select .cse16 |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| .cse17) |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 .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse18 |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))))))))) .cse22))) (or .cse2 (and (or .cse10 (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 ((.cse24 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_56))) (let ((.cse28 (store .cse24 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse25 (store (select .cse28 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse27 (store .cse28 |c_~#top~0.base| .cse25))) (let ((.cse26 (store (select .cse27 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse23 (store .cse27 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse26))) (or (not (= (select (select .cse23 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (not (= (_ bv0 32) (select (select .cse24 |c_~#m~0.base|) |c_~#m~0.offset|))) (= (_ bv1 32) (select (select .cse23 |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|))))))))))) (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 ((.cse32 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse21 |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 .cse32 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse30 (store (select .cse34 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse33 (store .cse34 |c_~#top~0.base| .cse30))) (let ((.cse31 (store (select .cse33 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse29 (store .cse33 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse31))) (or (= (_ bv1 32) (select (select .cse29 |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| .cse30) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse31) |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 .cse32 |c_~#m~0.base|) |c_~#m~0.offset|))) (not (= (select (select .cse29 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)))))))))) .cse22))))))) is different from true [2024-09-24 13:13:54,133 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-24 13:13:56,501 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse10 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse21 |c_~#top~0.offset|))) (.cse1 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (let ((.cse0 (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (_ bv0 32)))) (.cse2 (not .cse1)) (.cse22 (not .cse10))) (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 (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 ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (store .cse5 |c_~#top~0.base| (store (select .cse5 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))))) (store .cse4 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse4 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))))) (or (= (_ bv1 32) (select (select .cse3 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (= (select (select (store .cse3 |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)))))) (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 ((.cse6 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse9 (store .cse6 |c_~#top~0.base| (store (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse7 (store (select .cse9 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse8 (store .cse9 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse7))) (or (= (_ bv1 32) (select (select (store (store (store .cse6 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse7) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (= (_ bv1 32) (select (select .cse8 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))) (not (= (select (select |c_#memory_int| |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))) (or .cse1 (and (or .cse10 (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 ((.cse13 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_57))) (let ((.cse14 (let ((.cse15 (store .cse13 |c_~#m~0.base| v_ArrVal_1566))) (store .cse15 |c_~#top~0.base| (store (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54))))) (let ((.cse11 (store (select .cse14 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse12 (store .cse14 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse11))) (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| .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 .cse12 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse12 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (not (= (_ bv0 32) (select (select .cse13 |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 ((.cse20 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse21 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse18 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_58) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse20))) (let ((.cse19 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse20) |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| (store (select (store .cse18 |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse17 (store (select .cse19 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse16 (store .cse19 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse17))) (or (not (= v_DerPreprocessor_54 (select (select .cse16 |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| .cse17) |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 .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse18 |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))))))))) .cse22))) (or .cse2 (and (or .cse10 (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 ((.cse24 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_56))) (let ((.cse28 (store .cse24 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse25 (store (select .cse28 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse27 (store .cse28 |c_~#top~0.base| .cse25))) (let ((.cse26 (store (select .cse27 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse23 (store .cse27 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse26))) (or (not (= (select (select .cse23 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (not (= (_ bv0 32) (select (select .cse24 |c_~#m~0.base|) |c_~#m~0.offset|))) (= (_ bv1 32) (select (select .cse23 |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|))))))))))) (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 ((.cse32 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse21 |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 .cse32 |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse30 (store (select .cse34 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))) (let ((.cse33 (store .cse34 |c_~#top~0.base| .cse30))) (let ((.cse31 (store (select .cse33 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse29 (store .cse33 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse31))) (or (= (_ bv1 32) (select (select .cse29 |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| .cse30) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse31) |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 .cse32 |c_~#m~0.base|) |c_~#m~0.offset|))) (not (= (select (select .cse29 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)))))))))) .cse22))))))) is different from true [2024-09-24 13:14:01,599 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-24 13:14:15,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:14:15,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:14:15,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:14:15,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:14:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:14:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:14:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:14:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:14:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 13:14:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-24 13:14:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:14:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-24 13:14:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-09-24 13:14:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:14:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-24 13:14:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-24 13:14:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-24 13:14:15,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-09-24 13:14:15,010 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-24 13:14:15,205 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-24 13:14:15,205 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-09-24 13:14:15,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 13:14:15,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1422240575, now seen corresponding path program 2 times [2024-09-24 13:14:15,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 13:14:15,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906074109] [2024-09-24 13:14:15,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 13:14:15,206 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-24 13:14:15,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-24 13:14:15,207 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-24 13:14:15,207 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-24 13:14:15,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-24 13:14:15,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 13:14:15,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-24 13:14:15,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 13:14:16,768 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-24 13:14:16,923 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2024-09-24 13:14:16,923 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-24 13:14:17,498 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-24 13:14:17,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 13:14:21,514 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse9 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (or (and (or (= (select (select |c_#memory_int| |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (= (_ bv1 32) (select (select (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32))) |c_~#m~0.base|) |c_~#m~0.offset|)))) (forall ((v_DerPreprocessor_61 (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_DerPreprocessor_61)))) (store .cse1 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse1 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (= |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (= (_ bv0 32) .cse0) (= (_ bv1 32) .cse0)))) (forall ((v_DerPreprocessor_60 (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse3 (select (select (let ((.cse4 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_DerPreprocessor_60)))) (store .cse4 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse4 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (= (_ bv1 32) .cse3) (= |c_~#top~0.base| |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (= (_ bv0 32) .cse3)))) (forall ((v_DerPreprocessor_62 (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse5 (select (select (let ((.cse6 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_DerPreprocessor_62)))) (store .cse6 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse6 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) |c_~#m2~0.base|) |c_~#m2~0.offset|))) (or (= |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (= .cse5 (_ bv0 32)) (= .cse5 (_ bv1 32))))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (= (_ bv1 32) (select (select (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32))) |c_~#m2~0.base|) |c_~#m2~0.offset|))) (= (select (select |c_#memory_int| |c_~#m2~0.base|) |c_~#m2~0.offset|) (_ bv0 32))) (forall ((v_DerPreprocessor_63 (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse7 (select (select (let ((.cse8 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_DerPreprocessor_63)))) (store .cse8 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse8 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) |c_~#m2~0.base|) |c_~#m2~0.offset|))) (or (= .cse7 (_ bv1 32)) (= |c_~#top~0.base| |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (= .cse7 (_ bv0 32)))))) (not .cse9)) (or .cse9 (and (forall ((v_DerPreprocessor_64 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32))) (let ((.cse10 (select (select (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_64) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (= .cse10 (_ bv0 32)) (= .cse10 (_ bv1 32))))) (not (= (_ bv1 32) (select v_DerPreprocessor_64 |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))) (forall ((v_DerPreprocessor_64 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32))) (let ((.cse11 (select (select (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_64) |c_~#m2~0.base|) |c_~#m2~0.offset|))) (or (= (_ bv1 32) .cse11) (= (_ bv0 32) .cse11)))) (not (= (_ bv1 32) (select v_DerPreprocessor_64 |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))) is different from false [2024-09-24 13:14:21,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 13:14:21,594 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-24 13:14:22,337 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 1 not checked. [2024-09-24 13:14:22,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 13:14:22,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906074109] [2024-09-24 13:14:22,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906074109] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 13:14:22,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 13:14:22,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2024-09-24 13:14:22,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666104142] [2024-09-24 13:14:22,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 13:14:22,338 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-24 13:14:22,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 13:14:22,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-24 13:14:22,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=4, NotChecked=20, Total=156 [2024-09-24 13:14:22,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:14:22,338 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 13:14:22,339 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 10.666666666666666) internal successors, (128), 12 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 13:14:22,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 13:14:22,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 13:14:22,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:14:22,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:14:22,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 13:14:22,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:14:22,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:14:22,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 13:14:22,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-24 13:14:22,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-24 13:14:22,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-24 13:14:22,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-24 13:14:22,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-09-24 13:14:22,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 13:14:22,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-09-24 13:14:22,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-24 13:14:22,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-24 13:14:22,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-09-24 13:14:22,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 13:14:27,681 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-24 13:14:29,960 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-24 13:14:33,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 13:14:40,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-24 13:14:57,558 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-24 13:15:13,948 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-24 13:15:16,074 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-24 13:15:19,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 13:15:26,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 13:15:44,875 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-24 13:16:03,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 13:16:10,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 13:16:12,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 13:16:13,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 13:16:19,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 13:16:21,744 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (let ((.cse1 (not .cse5))) (let ((.cse0 (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|))) .cse5) (or .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 (and (or .cse1 (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 ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (store .cse4 |c_~#top~0.base| (store (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))))) (store .cse3 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))))) (or (= (_ bv1 32) (select (select .cse2 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (= (select (select (store .cse2 |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)))))) (or .cse5 (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 ((.cse6 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse9 (store .cse6 |c_~#top~0.base| (store (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse7 (store (select .cse9 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse8 (store .cse9 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse7))) (or (= (_ bv1 32) (select (select (store (store (store .cse6 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse7) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (= (_ bv1 32) (select (select .cse8 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))) (not (= (select (select |c_#memory_int| |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))) (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-24 13:16:24,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 13:16:36,257 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-24 13:16:42,511 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-24 13:17:11,509 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-24 13:17:14,621 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-24 13:17:16,146 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-24 13:17:18,690 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-24 13:17:22,496 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|))))) (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-24 13:17:22,724 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-24 13:17:25,176 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-24 13:17:28,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-24 13:17:57,413 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-24 13:17:59,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 13:18:03,400 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