./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-08-20_10-08-36.files/protection-local/26_stack_cas_longest-1.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da67795f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-1.i ./goblint.2024-08-20_10-08-36.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.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.goblint-eval-da67795-m [2024-08-27 01:47:50,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-27 01:47:50,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-27 01:47:50,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-27 01:47:50,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-27 01:47:50,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-27 01:47:50,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-27 01:47:50,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-27 01:47:50,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-27 01:47:50,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-27 01:47:50,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-27 01:47:50,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-27 01:47:50,592 INFO L153 SettingsManager]: * Use SBE=true [2024-08-27 01:47:50,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-27 01:47:50,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-27 01:47:50,593 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-27 01:47:50,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-27 01:47:50,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-27 01:47:50,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-27 01:47:50,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-27 01:47:50,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-27 01:47:50,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-27 01:47:50,597 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-27 01:47:50,597 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-27 01:47:50,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-27 01:47:50,598 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-27 01:47:50,598 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-27 01:47:50,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-27 01:47:50,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-27 01:47:50,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-27 01:47:50,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-27 01:47:50,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-27 01:47:50,599 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-27 01:47:50,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-27 01:47:50,599 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-27 01:47:50,599 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-27 01:47:50,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-27 01:47:50,600 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-27 01:47:50,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-27 01:47:50,600 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-27 01:47:50,603 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-27 01:47:50,603 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-27 01:47:50,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-08-27 01:47:50,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-27 01:47:50,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-27 01:47:50,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-27 01:47:50,822 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-27 01:47:50,822 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-27 01:47:50,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-20_10-08-36.files/protection-local/26_stack_cas_longest-1.yml/witness.yml [2024-08-27 01:47:50,933 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-27 01:47:50,933 INFO L274 PluginConnector]: CDTParser initialized [2024-08-27 01:47:50,933 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-08-27 01:47:52,224 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-27 01:47:52,426 INFO L384 CDTParser]: Found 1 translation units. [2024-08-27 01:47:52,426 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-1.i [2024-08-27 01:47:52,441 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/58c95c69e/251170dce7a148d882a7fc526bcfda22/FLAG3e6f4689f [2024-08-27 01:47:52,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/58c95c69e/251170dce7a148d882a7fc526bcfda22 [2024-08-27 01:47:52,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-27 01:47:52,459 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-27 01:47:52,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-27 01:47:52,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-27 01:47:52,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-27 01:47:52,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 01:47:50" (1/2) ... [2024-08-27 01:47:52,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17fa484b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:47:52, skipping insertion in model container [2024-08-27 01:47:52,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 01:47:50" (1/2) ... [2024-08-27 01:47:52,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@61f0fefa and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:47:52, skipping insertion in model container [2024-08-27 01:47:52,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 01:47:52" (2/2) ... [2024-08-27 01:47:52,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17fa484b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:47:52, skipping insertion in model container [2024-08-27 01:47:52,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 01:47:52" (2/2) ... [2024-08-27 01:47:52,468 INFO L85 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-27 01:47:52,486 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-08-27 01:47:52,487 INFO L1541 ArrayList]: Location invariant before [L751-L751] (m == 0 || m == 1) && (m2 == 0 || m2 == 1) [2024-08-27 01:47:52,513 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-27 01:47:52,792 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-27 01:47:52,800 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-08-27 01:47:52,853 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-27 01:47:52,885 INFO L206 MainTranslator]: Completed translation [2024-08-27 01:47:52,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:47:52 WrapperNode [2024-08-27 01:47:52,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-27 01:47:52,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-27 01:47:52,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-27 01:47:52,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-27 01:47:52,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:47:52" (1/1) ... [2024-08-27 01:47:52,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:47:52" (1/1) ... [2024-08-27 01:47:52,935 INFO L138 Inliner]: procedures = 179, calls = 51, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 200 [2024-08-27 01:47:52,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-27 01:47:52,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-27 01:47:52,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-27 01:47:52,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-27 01:47:52,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:47:52" (1/1) ... [2024-08-27 01:47:52,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:47:52" (1/1) ... [2024-08-27 01:47:52,951 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:47:52" (1/1) ... [2024-08-27 01:47:52,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:47:52" (1/1) ... [2024-08-27 01:47:52,959 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:47:52" (1/1) ... [2024-08-27 01:47:52,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:47:52" (1/1) ... [2024-08-27 01:47:52,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:47:52" (1/1) ... [2024-08-27 01:47:52,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:47:52" (1/1) ... [2024-08-27 01:47:52,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-27 01:47:52,974 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-27 01:47:52,975 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-27 01:47:52,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-27 01:47:52,975 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:47:52" (1/1) ... [2024-08-27 01:47:52,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-27 01:47:52,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:53,007 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-08-27 01:47:53,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-08-27 01:47:53,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-08-27 01:47:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-08-27 01:47:53,047 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-08-27 01:47:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-08-27 01:47:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-08-27 01:47:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-27 01:47:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-27 01:47:53,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-27 01:47:53,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-27 01:47:53,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-08-27 01:47:53,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-27 01:47:53,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-27 01:47:53,051 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-08-27 01:47:53,176 INFO L242 CfgBuilder]: Building ICFG [2024-08-27 01:47:53,178 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-27 01:47:53,418 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-08-27 01:47:53,419 INFO L291 CfgBuilder]: Performing block encoding [2024-08-27 01:47:53,695 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-27 01:47:53,696 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-08-27 01:47:53,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 01:47:53 BoogieIcfgContainer [2024-08-27 01:47:53,696 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-27 01:47:53,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-27 01:47:53,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-27 01:47:53,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-27 01:47:53,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 01:47:50" (1/4) ... [2024-08-27 01:47:53,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da5a4ff and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.08 01:47:53, skipping insertion in model container [2024-08-27 01:47:53,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 01:47:52" (2/4) ... [2024-08-27 01:47:53,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da5a4ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 01:47:53, skipping insertion in model container [2024-08-27 01:47:53,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:47:52" (3/4) ... [2024-08-27 01:47:53,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da5a4ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 01:47:53, skipping insertion in model container [2024-08-27 01:47:53,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 01:47:53" (4/4) ... [2024-08-27 01:47:53,705 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longest-1.i [2024-08-27 01:47:53,726 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-27 01:47:53,727 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-27 01:47:53,727 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-27 01:47:53,776 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-27 01:47:53,808 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:47:53,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 01:47:53,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:53,810 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-27 01:47:53,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-08-27 01:47:53,845 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 01:47:53,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-08-27 01:47:53,864 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@39e7f696, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:47:53,865 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-27 01:47:54,004 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:47:54,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:54,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1521780113, now seen corresponding path program 1 times [2024-08-27 01:47:54,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:54,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442816737] [2024-08-27 01:47:54,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:54,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:54,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:54,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442816737] [2024-08-27 01:47:54,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442816737] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:47:54,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:47:54,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 01:47:54,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105834125] [2024-08-27 01:47:54,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:47:54,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 01:47:54,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:54,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 01:47:54,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 01:47:54,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:54,346 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:54,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:47:54,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:54,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:54,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-27 01:47:54,393 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:47:54,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:54,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1823734536, now seen corresponding path program 1 times [2024-08-27 01:47:54,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:54,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485348291] [2024-08-27 01:47:54,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:54,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:54,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:54,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485348291] [2024-08-27 01:47:54,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485348291] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:47:54,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562643868] [2024-08-27 01:47:54,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:54,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:54,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:54,871 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:47:54,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-08-27 01:47:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:54,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-27 01:47:54,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:47:55,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 01:47:55,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:55,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:47:55,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:55,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-08-27 01:47:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:55,205 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:47:55,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562643868] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:47:55,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-27 01:47:55,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2024-08-27 01:47:55,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353282018] [2024-08-27 01:47:55,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:47:55,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:47:55,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:55,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:47:55,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-08-27 01:47:55,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:55,208 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:55,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:47:55,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:55,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:55,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:55,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:55,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-08-27 01:47:55,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-08-27 01:47:55,480 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:47:55,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:55,481 INFO L85 PathProgramCache]: Analyzing trace with hash 925778014, now seen corresponding path program 1 times [2024-08-27 01:47:55,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:55,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881237295] [2024-08-27 01:47:55,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:55,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:47:55,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:55,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881237295] [2024-08-27 01:47:55,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881237295] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:47:55,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:47:55,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 01:47:55,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850386007] [2024-08-27 01:47:55,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:47:55,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:47:55,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:55,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:47:55,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:47:55,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:55,597 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:55,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:47:55,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:55,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:55,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:55,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:55,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:55,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:55,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-27 01:47:55,710 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:47:55,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:55,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1291862496, now seen corresponding path program 1 times [2024-08-27 01:47:55,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:55,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242878899] [2024-08-27 01:47:55,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:55,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:55,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:55,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242878899] [2024-08-27 01:47:55,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242878899] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:47:55,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772800920] [2024-08-27 01:47:55,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:55,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:55,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:55,817 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:47:55,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-08-27 01:47:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:55,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-27 01:47:55,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:47:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:55,972 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:47:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:56,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772800920] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:47:56,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:47:56,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-08-27 01:47:56,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400507599] [2024-08-27 01:47:56,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:47:56,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-27 01:47:56,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:56,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-27 01:47:56,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-08-27 01:47:56,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:56,028 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:56,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:47:56,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:56,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:56,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:56,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:56,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:56,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:56,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:56,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:56,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-08-27 01:47:56,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:56,284 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:47:56,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:56,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1650478471, now seen corresponding path program 1 times [2024-08-27 01:47:56,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:56,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17617887] [2024-08-27 01:47:56,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:56,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:56,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:56,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17617887] [2024-08-27 01:47:56,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17617887] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:47:56,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095753707] [2024-08-27 01:47:56,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:56,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:56,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:56,706 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:47:56,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-08-27 01:47:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:56,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 23 conjunts are in the unsatisfiable core [2024-08-27 01:47:56,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:47:56,879 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 01:47:56,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-27 01:47:56,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:47:57,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 16 treesize of output 11 [2024-08-27 01:47:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:57,066 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:47:57,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:47:57,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-08-27 01:47:57,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-08-27 01:47:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:57,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095753707] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:47:57,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:47:57,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2024-08-27 01:47:57,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274819107] [2024-08-27 01:47:57,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:47:57,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-08-27 01:47:57,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:57,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-08-27 01:47:57,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=467, Unknown=2, NotChecked=0, Total=552 [2024-08-27 01:47:57,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:57,357 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:57,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:47:57,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:57,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:57,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:57,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:57,358 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:57,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-27 01:47:57,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 1 remaining) [2024-08-27 01:47:57,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-08-27 01:47:57,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:57,943 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-08-27 01:47:57,944 INFO L308 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-08-27 01:47:57,946 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:47:57,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 01:47:57,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:57,947 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-27 01:47:57,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-08-27 01:47:57,950 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 01:47:57,951 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-27 01:47:57,951 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@39e7f696, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:47:57,951 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-27 01:47:57,998 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:47:57,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:57,999 INFO L85 PathProgramCache]: Analyzing trace with hash -837336820, now seen corresponding path program 1 times [2024-08-27 01:47:57,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:57,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509424045] [2024-08-27 01:47:57,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:57,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:58,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:58,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509424045] [2024-08-27 01:47:58,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509424045] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:47:58,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:47:58,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 01:47:58,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944225057] [2024-08-27 01:47:58,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:47:58,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 01:47:58,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:58,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 01:47:58,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 01:47:58,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:58,025 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:58,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:47:58,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:58,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:58,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-27 01:47:58,048 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:47:58,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:58,048 INFO L85 PathProgramCache]: Analyzing trace with hash -828712491, now seen corresponding path program 1 times [2024-08-27 01:47:58,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:58,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812207871] [2024-08-27 01:47:58,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:58,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 01:47:58,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-27 01:47:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 01:47:58,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-27 01:47:58,082 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-27 01:47:58,083 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-27 01:47:58,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-27 01:47:58,084 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-08-27 01:47:58,087 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-08-27 01:47:58,087 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-27 01:47:58,087 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-08-27 01:47:58,122 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-27 01:47:58,124 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:47:58,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 01:47:58,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:58,127 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-27 01:47:58,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-08-27 01:47:58,132 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 01:47:58,132 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-27 01:47:58,133 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@39e7f696, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:47:58,133 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-27 01:47:58,315 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:47:58,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:58,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1218277817, now seen corresponding path program 1 times [2024-08-27 01:47:58,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:58,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762601293] [2024-08-27 01:47:58,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:58,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:47:58,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:58,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762601293] [2024-08-27 01:47:58,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762601293] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:47:58,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:47:58,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 01:47:58,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360713447] [2024-08-27 01:47:58,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:47:58,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 01:47:58,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:58,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 01:47:58,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 01:47:58,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:58,362 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:58,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:47:58,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:58,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:58,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-08-27 01:47:58,402 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:47:58,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:58,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1105059173, now seen corresponding path program 1 times [2024-08-27 01:47:58,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:58,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874082790] [2024-08-27 01:47:58,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:58,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:58,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:58,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:58,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874082790] [2024-08-27 01:47:58,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874082790] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:47:58,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166105852] [2024-08-27 01:47:58,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:58,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:58,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:58,455 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:47:58,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-08-27 01:47:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:58,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-27 01:47:58,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:47:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:58,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:47:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:58,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166105852] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:47:58,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:47:58,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-08-27 01:47:58,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058088814] [2024-08-27 01:47:58,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:47:58,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-27 01:47:58,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:58,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-27 01:47:58,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-08-27 01:47:58,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:58,629 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:58,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:47:58,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:58,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:58,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:58,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:58,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-08-27 01:47:58,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-08-27 01:47:58,871 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:47:58,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash -904601861, now seen corresponding path program 1 times [2024-08-27 01:47:58,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:58,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877515231] [2024-08-27 01:47:58,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:58,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:47:58,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:58,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877515231] [2024-08-27 01:47:58,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877515231] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:47:58,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:47:58,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 01:47:58,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364500432] [2024-08-27 01:47:58,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:47:58,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-27 01:47:58,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:47:58,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-27 01:47:58,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-27 01:47:58,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:58,998 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:47:58,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:47:58,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:58,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:59,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:47:59,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:47:59,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:59,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:47:59,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-08-27 01:47:59,057 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:47:59,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:47:59,059 INFO L85 PathProgramCache]: Analyzing trace with hash -999344735, now seen corresponding path program 1 times [2024-08-27 01:47:59,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:47:59,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315312416] [2024-08-27 01:47:59,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:59,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:47:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:59,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:47:59,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315312416] [2024-08-27 01:47:59,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315312416] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:47:59,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2849671] [2024-08-27 01:47:59,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:47:59,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:47:59,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:47:59,272 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:47:59,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-08-27 01:47:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:47:59,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 29 conjunts are in the unsatisfiable core [2024-08-27 01:47:59,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:47:59,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 01:47:59,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:59,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:47:59,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:47:59,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-08-27 01:47:59,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:47:59,650 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:47:59,757 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~state~0 0))) (and (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array Int Int)) (|~#m2~0.offset| Int)) (= (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_4))) (store .cse1 |c_~#m2~0.base| (store (select .cse1 |c_~#m2~0.base|) |~#m2~0.offset| 0))) |c_~#m~0.base|) |c_~#m~0.offset|) 0))) (or (forall ((|~#m2~0.offset| Int)) (= 0 (select (select (store |c_#memory_int| |c_~#m2~0.base| (store (select |c_#memory_int| |c_~#m2~0.base|) |~#m2~0.offset| 0)) |c_~#m~0.base|) |c_~#m~0.offset|))) .cse0))) is different from false [2024-08-27 01:47:59,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:47:59,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2024-08-27 01:47:59,789 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~state~0 0))) (and (or (forall ((v_arrayElimArr_3 (Array Int Int)) (|~#m2~0.offset| Int)) (or (not (= (select v_arrayElimArr_3 |~#m2~0.offset|) 0)) (= (select (select (store |c_#memory_int| |c_~#m2~0.base| v_arrayElimArr_3) |c_~#m~0.base|) |c_~#m~0.offset|) 0))) .cse0) (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_354 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_4) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_354) |c_~#top~0.base| v_DerPreprocessor_4) |c_~#m2~0.base|) |~#m2~0.offset| 0)) |c_~#m~0.base|) |c_~#m~0.offset|)))))) is different from false [2024-08-27 01:47:59,847 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread1of2ForFork0_push_~newTop~0#1| 0) (let ((.cse0 (= c_~state~0 0))) (and (or (forall ((v_arrayElimArr_3 (Array Int Int)) (|~#m2~0.offset| Int)) (or (not (= (select v_arrayElimArr_3 |~#m2~0.offset|) 0)) (= (select (select (store |c_#memory_int| |c_~#m2~0.base| v_arrayElimArr_3) |c_~#m~0.base|) |c_~#m~0.offset|) 0))) .cse0) (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_354 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_4) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_354) |c_~#top~0.base| v_DerPreprocessor_4) |c_~#m2~0.base|) |~#m2~0.offset| 0)) |c_~#m~0.base|) |c_~#m~0.offset|))))))) is different from false [2024-08-27 01:47:59,868 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread1of2ForFork0_index_malloc_~curr_alloc_idx~0#1| 0) (let ((.cse0 (= c_~state~0 0))) (and (or (forall ((v_arrayElimArr_3 (Array Int Int)) (|~#m2~0.offset| Int)) (or (not (= (select v_arrayElimArr_3 |~#m2~0.offset|) 0)) (= (select (select (store |c_#memory_int| |c_~#m2~0.base| v_arrayElimArr_3) |c_~#m~0.base|) |c_~#m~0.offset|) 0))) .cse0) (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array Int Int)) (|~#m2~0.offset| Int) (v_ArrVal_354 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_4) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_354) |c_~#top~0.base| v_DerPreprocessor_4) |c_~#m2~0.base|) |~#m2~0.offset| 0)) |c_~#m~0.base|) |c_~#m~0.offset|))))))) is different from false [2024-08-27 01:47:59,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:47:59,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2024-08-27 01:47:59,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 194 [2024-08-27 01:47:59,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 88 [2024-08-27 01:47:59,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2024-08-27 01:47:59,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:47:59,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-08-27 01:47:59,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-08-27 01:48:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-08-27 01:48:00,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2849671] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:48:00,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:48:00,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 22 [2024-08-27 01:48:00,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309936284] [2024-08-27 01:48:00,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:48:00,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-08-27 01:48:00,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:00,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-08-27 01:48:00,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=257, Unknown=4, NotChecked=148, Total=506 [2024-08-27 01:48:00,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:00,079 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:00,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.652173913043478) internal successors, (84), 22 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:00,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:00,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:00,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:00,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:00,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:00,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:00,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:00,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-27 01:48:00,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-08-27 01:48:00,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:00,798 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:48:00,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:00,799 INFO L85 PathProgramCache]: Analyzing trace with hash -323185154, now seen corresponding path program 1 times [2024-08-27 01:48:00,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:00,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779031013] [2024-08-27 01:48:00,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:00,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 01:48:00,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:00,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779031013] [2024-08-27 01:48:00,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779031013] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:48:00,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:48:00,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 01:48:00,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883898845] [2024-08-27 01:48:00,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:48:00,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:48:00,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:00,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:48:00,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:48:00,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:00,921 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:00,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:00,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:00,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:00,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:00,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-27 01:48:00,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:01,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:01,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:01,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:01,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-27 01:48:01,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:01,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-08-27 01:48:01,130 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:48:01,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:01,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1323347906, now seen corresponding path program 1 times [2024-08-27 01:48:01,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:01,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436012630] [2024-08-27 01:48:01,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:01,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:48:01,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:01,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436012630] [2024-08-27 01:48:01,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436012630] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:01,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774253415] [2024-08-27 01:48:01,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:01,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:01,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:01,501 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:48:01,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-08-27 01:48:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:01,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 23 conjunts are in the unsatisfiable core [2024-08-27 01:48:01,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:01,664 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 01:48:01,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-27 01:48:01,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:48:01,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:48:01,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:48:01,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:01,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-08-27 01:48:01,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-08-27 01:48:02,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:48:02,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774253415] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:48:02,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:48:02,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2024-08-27 01:48:02,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71746712] [2024-08-27 01:48:02,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:48:02,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-08-27 01:48:02,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:02,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-08-27 01:48:02,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=472, Unknown=2, NotChecked=0, Total=552 [2024-08-27 01:48:02,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:02,089 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:02,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.041666666666667) internal successors, (97), 23 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:02,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:02,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:02,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:02,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-27 01:48:02,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:02,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:02,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:02,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:02,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:02,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-27 01:48:02,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:02,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:02,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-08-27 01:48:02,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:02,683 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:48:02,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:02,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1233754093, now seen corresponding path program 1 times [2024-08-27 01:48:02,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:02,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434524755] [2024-08-27 01:48:02,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:02,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 01:48:02,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-27 01:48:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 01:48:02,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-27 01:48:02,734 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-27 01:48:02,734 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-27 01:48:02,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-08-27 01:48:02,735 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-08-27 01:48:02,735 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-08-27 01:48:02,735 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-27 01:48:02,735 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-08-27 01:48:02,766 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-27 01:48:02,768 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:48:02,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 01:48:02,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:02,770 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-27 01:48:02,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2024-08-27 01:48:02,773 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 01:48:02,773 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-08-27 01:48:02,773 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@39e7f696, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:48:02,773 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-27 01:48:03,100 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:03,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:03,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1653505405, now seen corresponding path program 1 times [2024-08-27 01:48:03,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:03,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814028489] [2024-08-27 01:48:03,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:03,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-27 01:48:03,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:03,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814028489] [2024-08-27 01:48:03,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814028489] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:48:03,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:48:03,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 01:48:03,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395882401] [2024-08-27 01:48:03,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:48:03,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 01:48:03,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:03,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 01:48:03,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 01:48:03,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:03,173 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:03,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:03,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:03,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:03,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-08-27 01:48:03,232 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:03,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:03,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1329674543, now seen corresponding path program 1 times [2024-08-27 01:48:03,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:03,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740960591] [2024-08-27 01:48:03,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:03,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:03,282 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:48:03,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:03,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740960591] [2024-08-27 01:48:03,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740960591] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:03,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537986808] [2024-08-27 01:48:03,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:03,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:03,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:03,285 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:48:03,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-08-27 01:48:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:03,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-27 01:48:03,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:03,453 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:48:03,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:48:03,485 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:48:03,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537986808] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:48:03,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:48:03,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-08-27 01:48:03,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196810786] [2024-08-27 01:48:03,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:48:03,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-27 01:48:03,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:03,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-27 01:48:03,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-08-27 01:48:03,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:03,487 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:03,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:03,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:03,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:03,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:03,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:03,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-08-27 01:48:03,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:03,770 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:03,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:03,770 INFO L85 PathProgramCache]: Analyzing trace with hash -770286953, now seen corresponding path program 1 times [2024-08-27 01:48:03,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:03,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85625004] [2024-08-27 01:48:03,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:03,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-27 01:48:03,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:03,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85625004] [2024-08-27 01:48:03,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85625004] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:48:03,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:48:03,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 01:48:03,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26958936] [2024-08-27 01:48:03,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:48:03,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-27 01:48:03,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:03,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-27 01:48:03,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-27 01:48:03,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:03,896 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:03,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:03,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:03,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:03,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:04,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:04,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:04,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:04,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-08-27 01:48:04,041 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:04,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:04,042 INFO L85 PathProgramCache]: Analyzing trace with hash 222230507, now seen corresponding path program 1 times [2024-08-27 01:48:04,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:04,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823351091] [2024-08-27 01:48:04,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:04,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:04,129 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-27 01:48:04,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:04,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823351091] [2024-08-27 01:48:04,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823351091] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:48:04,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:48:04,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 01:48:04,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322119126] [2024-08-27 01:48:04,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:48:04,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:48:04,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:04,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:48:04,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:48:04,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:04,132 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:04,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:04,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:04,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:04,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:04,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:04,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:04,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:04,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:04,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:04,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-08-27 01:48:04,288 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:04,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:04,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1791435089, now seen corresponding path program 1 times [2024-08-27 01:48:04,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:04,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720789647] [2024-08-27 01:48:04,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:04,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-08-27 01:48:04,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:04,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720789647] [2024-08-27 01:48:04,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720789647] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:04,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210613723] [2024-08-27 01:48:04,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:04,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:04,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:04,776 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:48:04,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-08-27 01:48:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:04,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 57 conjunts are in the unsatisfiable core [2024-08-27 01:48:04,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:05,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 01:48:05,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:05,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:05,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:05,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:05,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:05,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:05,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:05,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:05,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:05,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:05,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:05,509 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:05,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2024-08-27 01:48:05,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:05,601 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:05,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-08-27 01:48:05,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:05,693 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:05,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-08-27 01:48:05,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:05,820 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-08-27 01:48:05,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 35 treesize of output 45 [2024-08-27 01:48:06,207 INFO L349 Elim1Store]: treesize reduction 160, result has 30.1 percent of original size [2024-08-27 01:48:06,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 70 treesize of output 117 [2024-08-27 01:48:06,257 INFO L349 Elim1Store]: treesize reduction 68, result has 39.3 percent of original size [2024-08-27 01:48:06,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 84 treesize of output 109 [2024-08-27 01:48:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:48:06,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:48:06,953 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (Array Int Int)) (|~#m2~0.offset| Int)) (not (= 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#m2~0.base| (store (select |c_#memory_int| |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|)))) is different from false [2024-08-27 01:48:06,962 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (Array Int Int)) (|~#m2~0.offset| Int)) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#m2~0.base| (store (select |c_#memory_int| |c_~#m2~0.base|) |~#m2~0.offset| 0)))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-08-27 01:48:06,967 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int)) (not (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815))) (store .cse1 |c_~#m2~0.base| (store (select .cse1 |c_~#m2~0.base|) |~#m2~0.offset| 0))))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-08-27 01:48:06,973 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int)) (not (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815))) (store .cse1 |c_~#m2~0.base| (store (select .cse1 |c_~#m2~0.base|) |~#m2~0.offset| 0))))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-08-27 01:48:07,010 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~state~0 0))) (and (or (not .cse0) (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int) (v_DerPreprocessor_9 (Array Int Int))) (not (= (select (select (store (let ((.cse2 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_9) |c_~#m~0.base| v_ArrVal_815))) (let ((.cse1 (store (select .cse2 |c_~#m2~0.base|) |~#m2~0.offset| 0))) (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815) |c_~#m2~0.base| .cse1) |c_~#top~0.base| (store (select (store .cse2 |c_~#m2~0.base| .cse1) |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0)))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (or .cse0 (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|~#m2~0.offset| Int)) (not (= (select (select (store (let ((.cse3 (let ((.cse4 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_815))) (store .cse4 |c_~#m2~0.base| (store (select .cse4 |c_~#m2~0.base|) |~#m2~0.offset| 0))))) (store .cse3 |c_~#top~0.base| (store (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) is different from false [2024-08-27 01:48:08,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:08,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 8 [2024-08-27 01:48:08,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:08,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 520 treesize of output 534 [2024-08-27 01:48:08,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 343 treesize of output 339 [2024-08-27 01:48:08,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 339 treesize of output 337 [2024-08-27 01:48:08,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 337 treesize of output 329 [2024-08-27 01:48:08,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 329 treesize of output 327 [2024-08-27 01:48:08,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 327 treesize of output 319 [2024-08-27 01:48:08,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 319 treesize of output 317 [2024-08-27 01:48:08,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 317 treesize of output 313 [2024-08-27 01:48:08,954 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:48:08,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210613723] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:48:08,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:48:08,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 20] total 48 [2024-08-27 01:48:08,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249653295] [2024-08-27 01:48:08,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:48:08,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-08-27 01:48:08,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:08,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-08-27 01:48:08,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1628, Unknown=25, NotChecked=440, Total=2352 [2024-08-27 01:48:08,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:08,964 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:08,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.36734693877551) internal successors, (165), 48 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:08,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:08,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:08,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:08,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:08,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:09,433 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-08-27 01:48:09,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:09,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:09,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:09,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:09,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:09,710 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-08-27 01:48:09,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:09,899 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:09,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:09,899 INFO L85 PathProgramCache]: Analyzing trace with hash 801107341, now seen corresponding path program 2 times [2024-08-27 01:48:09,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:09,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841272798] [2024-08-27 01:48:09,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:09,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:10,112 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-27 01:48:10,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:10,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841272798] [2024-08-27 01:48:10,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841272798] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:10,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972046617] [2024-08-27 01:48:10,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 01:48:10,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:10,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:10,118 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:48:10,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-08-27 01:48:10,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-27 01:48:10,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 01:48:10,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-27 01:48:10,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:10,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 01:48:10,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:10,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:10,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:10,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:10,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:10,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:10,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:10,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-08-27 01:48:10,450 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-27 01:48:10,450 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:48:10,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972046617] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:48:10,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-27 01:48:10,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-08-27 01:48:10,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747529715] [2024-08-27 01:48:10,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:48:10,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:48:10,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:10,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:48:10,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-08-27 01:48:10,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:10,452 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:10,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:10,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:10,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:10,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:10,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:10,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:10,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:10,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:10,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:10,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:10,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:10,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:10,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:10,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-08-27 01:48:10,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:10,866 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:10,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:10,866 INFO L85 PathProgramCache]: Analyzing trace with hash -765518316, now seen corresponding path program 2 times [2024-08-27 01:48:10,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:10,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648937287] [2024-08-27 01:48:10,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:10,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:48:11,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:11,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648937287] [2024-08-27 01:48:11,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648937287] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:11,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918819120] [2024-08-27 01:48:11,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 01:48:11,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:11,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:11,306 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:48:11,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-08-27 01:48:11,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-08-27 01:48:11,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 01:48:11,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 21 conjunts are in the unsatisfiable core [2024-08-27 01:48:11,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:11,756 INFO L349 Elim1Store]: treesize reduction 96, result has 35.6 percent of original size [2024-08-27 01:48:11,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 67 treesize of output 120 [2024-08-27 01:48:11,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-08-27 01:48:11,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:11,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-27 01:48:11,827 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-08-27 01:48:11,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2024-08-27 01:48:11,868 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-08-27 01:48:11,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 26 [2024-08-27 01:48:11,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2024-08-27 01:48:11,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-27 01:48:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-08-27 01:48:12,179 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:48:12,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918819120] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:48:12,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-27 01:48:12,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2024-08-27 01:48:12,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897436778] [2024-08-27 01:48:12,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:48:12,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:48:12,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:12,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:48:12,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-08-27 01:48:12,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:12,181 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:12,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:12,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:12,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:12,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:12,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:12,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:12,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:12,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:12,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-08-27 01:48:12,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:12,671 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:12,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:12,671 INFO L85 PathProgramCache]: Analyzing trace with hash 882666815, now seen corresponding path program 1 times [2024-08-27 01:48:12,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:12,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817835037] [2024-08-27 01:48:12,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:12,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:12,858 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-08-27 01:48:12,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:12,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817835037] [2024-08-27 01:48:12,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817835037] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:48:12,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:48:12,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 01:48:12,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233003340] [2024-08-27 01:48:12,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:48:12,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:48:12,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:12,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:48:12,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:48:12,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:12,859 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:12,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:12,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:12,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:12,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:12,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:12,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:12,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:12,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:12,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:13,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:13,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:13,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:13,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:13,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:13,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:13,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:13,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:13,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-08-27 01:48:13,308 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:13,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:13,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1259604423, now seen corresponding path program 1 times [2024-08-27 01:48:13,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:13,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593100360] [2024-08-27 01:48:13,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:13,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 01:48:13,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:13,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593100360] [2024-08-27 01:48:13,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593100360] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:13,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059221824] [2024-08-27 01:48:13,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:13,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:13,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:13,518 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:48:13,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-08-27 01:48:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:13,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 6 conjunts are in the unsatisfiable core [2024-08-27 01:48:13,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 01:48:13,786 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:48:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 01:48:13,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059221824] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:48:13,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:48:13,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-08-27 01:48:13,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176170898] [2024-08-27 01:48:13,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:48:13,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-27 01:48:13,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:13,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-27 01:48:13,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-08-27 01:48:13,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:13,893 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:13,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.846153846153847) internal successors, (167), 12 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:13,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:13,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:13,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:13,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:13,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:13,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:13,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:13,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:13,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:14,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:48:14,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-08-27 01:48:14,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:14,252 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:14,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:14,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1176978261, now seen corresponding path program 1 times [2024-08-27 01:48:14,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:14,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624708624] [2024-08-27 01:48:14,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:14,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:14,581 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-08-27 01:48:14,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:14,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624708624] [2024-08-27 01:48:14,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624708624] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:14,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192372539] [2024-08-27 01:48:14,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:14,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:14,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:14,584 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:48:14,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-08-27 01:48:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:14,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 54 conjunts are in the unsatisfiable core [2024-08-27 01:48:14,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:14,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 01:48:14,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:14,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:14,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:14,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:15,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:15,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:15,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:15,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-08-27 01:48:15,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:15,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:15,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:15,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:15,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:15,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:15,349 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 01:48:15,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-08-27 01:48:15,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:48:15,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:48:15,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:48:15,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:15,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-08-27 01:48:15,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-08-27 01:48:15,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-08-27 01:48:16,359 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (not (= c_~next_alloc_idx~0 0)))) (and (or (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0)))) (forall ((v_DerPreprocessor_16 (Array Int Int)) (v_prenex_124 (Array Int Int))) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_prenex_124) |c_~#top~0.base|) 0) 1) 0)))) (not (= c_~state~0 0))) (or (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0)))) (forall ((v_ArrVal_1347 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1347) |c_~#top~0.base|) 0) 1) 0)))) (not (= c_~state~0 1))))) (= |c_thr1Thread1of3ForFork0_push_~newTop~0#1| 0)) is different from false [2024-08-27 01:48:16,383 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (not (= c_~next_alloc_idx~0 0)))) (and (or (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0)))) (forall ((v_DerPreprocessor_16 (Array Int Int)) (v_prenex_124 (Array Int Int))) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_prenex_124) |c_~#top~0.base|) 0) 1) 0)))) (not (= c_~state~0 0))) (or (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0)))) (forall ((v_ArrVal_1347 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_1347) |c_~#top~0.base|) 0) 1) 0)))) (not (= c_~state~0 1))))) (= |c_thr1Thread1of3ForFork0_index_malloc_~curr_alloc_idx~0#1| 0)) is different from false [2024-08-27 01:48:16,408 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread1of3ForFork0_index_malloc_~curr_alloc_idx~0#1| 0) (let ((.cse0 (not (= c_~next_alloc_idx~0 0)))) (and (or (not (= c_~state~0 0)) (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0)))) (forall ((v_DerPreprocessor_16 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_prenex_124 (Array Int Int))) (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_prenex_124) |c_~#top~0.base|) 0) 1) 0))))) (or (and (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (not (= 0 (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#m2~0.base| v_ArrVal_1347) |c_~#top~0.base|) 0) 1)))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0))) .cse0)) (not (= c_~state~0 1)))))) is different from false [2024-08-27 01:48:16,432 WARN L854 $PredicateComparison]: unable to prove that (or (= c_~next_alloc_idx~0 0) (let ((.cse0 (not (= (+ c_~next_alloc_idx~0 2) 0)))) (and (or (not (= c_~state~0 1)) (and (forall ((v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (not (= 0 (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#m2~0.base| v_ArrVal_1347) |c_~#top~0.base|) 0) 1)))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (not (= (+ (select (select (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0))) .cse0))) (or (not (= c_~state~0 0)) (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27| Int) (v_ArrVal_1347 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_ArrVal_1341 (Array Int Int))) (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_ArrVal_1347) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_27|) 0) 1) 0)))) (forall ((v_DerPreprocessor_16 (Array Int Int)) (v_ArrVal_1341 (Array Int Int)) (v_prenex_124 (Array Int Int))) (not (= (+ (select (select (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1341) |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| v_prenex_124) |c_~#top~0.base|) 0) 1) 0)))))))) is different from false [2024-08-27 01:48:16,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:16,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 8 [2024-08-27 01:48:16,620 INFO L349 Elim1Store]: treesize reduction 22, result has 60.0 percent of original size [2024-08-27 01:48:16,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 558 treesize of output 566 [2024-08-27 01:48:16,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 303 treesize of output 301 [2024-08-27 01:48:16,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 293 [2024-08-27 01:48:16,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 293 treesize of output 289 [2024-08-27 01:48:16,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 289 treesize of output 287 [2024-08-27 01:48:16,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 287 treesize of output 285 [2024-08-27 01:48:16,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 281 [2024-08-27 01:48:16,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 281 treesize of output 279 [2024-08-27 01:48:16,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 277 [2024-08-27 01:48:16,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 277 treesize of output 273 [2024-08-27 01:48:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 11 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2024-08-27 01:48:16,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192372539] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:48:16,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:48:16,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 37 [2024-08-27 01:48:16,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323100044] [2024-08-27 01:48:16,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:48:16,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-08-27 01:48:16,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:16,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-08-27 01:48:16,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=970, Unknown=23, NotChecked=268, Total=1406 [2024-08-27 01:48:16,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:16,938 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:16,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.2894736842105265) internal successors, (201), 37 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:16,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:16,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:16,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:16,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:16,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:16,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:16,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:16,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:16,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:48:16,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:17,974 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-08-27 01:48:18,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-27 01:48:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:48:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:18,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-08-27 01:48:19,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-08-27 01:48:19,052 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:19,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:19,052 INFO L85 PathProgramCache]: Analyzing trace with hash 425971427, now seen corresponding path program 1 times [2024-08-27 01:48:19,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:19,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601960733] [2024-08-27 01:48:19,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:19,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:19,196 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-08-27 01:48:19,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:19,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601960733] [2024-08-27 01:48:19,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601960733] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:48:19,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:48:19,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 01:48:19,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847761609] [2024-08-27 01:48:19,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:48:19,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:48:19,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:19,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:48:19,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:48:19,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:19,199 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:19,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:19,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:19,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:19,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:19,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:19,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-27 01:48:19,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:19,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:19,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:19,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:48:19,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:19,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:19,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:19,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:19,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:19,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:19,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:19,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:19,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:19,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:19,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:48:19,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:19,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:19,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-08-27 01:48:19,784 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:19,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:19,784 INFO L85 PathProgramCache]: Analyzing trace with hash 701199428, now seen corresponding path program 1 times [2024-08-27 01:48:19,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:19,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620108841] [2024-08-27 01:48:19,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:19,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:48:20,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:20,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620108841] [2024-08-27 01:48:20,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620108841] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:20,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153444558] [2024-08-27 01:48:20,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:20,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:20,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:20,611 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:48:20,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-08-27 01:48:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:20,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 30 conjunts are in the unsatisfiable core [2024-08-27 01:48:20,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:21,000 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 01:48:21,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-08-27 01:48:21,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:48:21,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:21,248 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:48:21,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:48:21,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:21,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-08-27 01:48:21,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-08-27 01:48:21,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-08-27 01:48:21,532 INFO L349 Elim1Store]: treesize reduction 11, result has 60.7 percent of original size [2024-08-27 01:48:21,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 39 [2024-08-27 01:48:21,658 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:48:21,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153444558] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:48:21,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:48:21,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 37 [2024-08-27 01:48:21,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326712842] [2024-08-27 01:48:21,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:48:21,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-08-27 01:48:21,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:21,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-08-27 01:48:21,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1271, Unknown=2, NotChecked=0, Total=1406 [2024-08-27 01:48:21,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:21,661 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:21,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.684210526315789) internal successors, (216), 37 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:21,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:21,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:21,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:21,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:21,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:21,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:21,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:21,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:21,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:48:21,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:21,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:21,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:48:24,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:24,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:24,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-08-27 01:48:24,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-08-27 01:48:24,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-08-27 01:48:24,481 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:24,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:24,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1378747720, now seen corresponding path program 1 times [2024-08-27 01:48:24,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:24,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117714161] [2024-08-27 01:48:24,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:24,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:25,020 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 01:48:25,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:25,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117714161] [2024-08-27 01:48:25,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117714161] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:25,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438203837] [2024-08-27 01:48:25,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:25,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:25,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:25,022 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:48:25,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-08-27 01:48:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:25,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 23 conjunts are in the unsatisfiable core [2024-08-27 01:48:25,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:25,300 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 01:48:25,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-27 01:48:25,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:48:25,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:48:25,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:48:25,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:25,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-08-27 01:48:25,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-08-27 01:48:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:48:25,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438203837] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:48:25,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:48:25,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2024-08-27 01:48:25,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586435252] [2024-08-27 01:48:25,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:48:25,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-08-27 01:48:25,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:25,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-08-27 01:48:25,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=523, Unknown=2, NotChecked=0, Total=600 [2024-08-27 01:48:25,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:25,680 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:25,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.96) internal successors, (174), 24 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:25,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:25,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:25,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:25,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:25,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:25,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:25,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:25,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:25,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:48:25,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:25,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:25,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-08-27 01:48:25,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:29,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:48:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-08-27 01:48:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-08-27 01:48:29,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-08-27 01:48:29,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-08-27 01:48:29,227 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:29,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:29,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1085853016, now seen corresponding path program 1 times [2024-08-27 01:48:29,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:29,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582615925] [2024-08-27 01:48:29,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:29,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-27 01:48:29,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:29,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582615925] [2024-08-27 01:48:29,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582615925] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:29,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589060162] [2024-08-27 01:48:29,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:29,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:29,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:29,766 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:48:29,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-08-27 01:48:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:29,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 40 conjunts are in the unsatisfiable core [2024-08-27 01:48:30,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:30,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:30,415 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:30,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2024-08-27 01:48:30,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:30,500 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:30,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-08-27 01:48:30,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:30,594 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:30,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-08-27 01:48:30,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:30,629 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:30,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-08-27 01:48:30,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:30,686 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:30,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-08-27 01:48:30,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:30,762 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:30,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-08-27 01:48:30,903 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-08-27 01:48:30,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 35 [2024-08-27 01:48:30,920 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-08-27 01:48:30,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 26 [2024-08-27 01:48:30,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-08-27 01:48:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:48:30,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:48:31,113 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1853 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1853))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_push_~newTop~0#1|))) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-08-27 01:48:31,143 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1853 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1853))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_index_malloc_~curr_alloc_idx~0#1|))) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-08-27 01:48:31,150 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1853 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1853))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-08-27 01:48:31,196 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-08-27 01:48:31,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 68 [2024-08-27 01:48:31,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2024-08-27 01:48:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2024-08-27 01:48:31,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589060162] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:48:31,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:48:31,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 13] total 35 [2024-08-27 01:48:31,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825293693] [2024-08-27 01:48:31,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:48:31,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-08-27 01:48:31,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:31,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-08-27 01:48:31,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=927, Unknown=7, NotChecked=192, Total=1260 [2024-08-27 01:48:31,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:31,381 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:31,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.388888888888889) internal successors, (266), 35 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:31,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:31,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:31,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:31,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:31,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:31,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:31,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:31,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:31,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:48:31,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:31,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:31,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-08-27 01:48:31,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-08-27 01:48:31,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:35,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-27 01:48:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:35,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-08-27 01:48:35,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:48:35,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-08-27 01:48:35,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-08-27 01:48:35,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-08-27 01:48:35,208 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:35,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:35,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1994314252, now seen corresponding path program 1 times [2024-08-27 01:48:35,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:35,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389479417] [2024-08-27 01:48:35,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:35,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-08-27 01:48:35,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:35,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389479417] [2024-08-27 01:48:35,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389479417] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:48:35,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:48:35,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-27 01:48:35,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047822201] [2024-08-27 01:48:35,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:48:35,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 01:48:35,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:35,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 01:48:35,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 01:48:35,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:35,353 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:35,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-27 01:48:35,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:35,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:35,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2024-08-27 01:48:35,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:48:35,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-08-27 01:48:35,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:36,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:36,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:36,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:36,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:36,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:36,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:36,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:36,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:36,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:36,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:36,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:36,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2024-08-27 01:48:36,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:48:36,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-08-27 01:48:36,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:36,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-08-27 01:48:36,489 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:36,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:36,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1384830022, now seen corresponding path program 1 times [2024-08-27 01:48:36,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:36,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442660597] [2024-08-27 01:48:36,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:36,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-08-27 01:48:37,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:37,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442660597] [2024-08-27 01:48:37,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442660597] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:37,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546523666] [2024-08-27 01:48:37,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:37,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:37,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:37,535 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:48:37,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-08-27 01:48:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:37,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 29 conjunts are in the unsatisfiable core [2024-08-27 01:48:37,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:38,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:38,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:38,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:38,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:38,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:38,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:38,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:38,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:48:38,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:38,199 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:38,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2024-08-27 01:48:38,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:38,255 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:38,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-08-27 01:48:38,263 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 01:48:38,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-08-27 01:48:38,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:48:38,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-08-27 01:48:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 48 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-27 01:48:38,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:48:38,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:38,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-08-27 01:48:38,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-08-27 01:48:38,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-08-27 01:48:38,735 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2187 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2187) |c_~#top~0.base|) 0) 1) 0))) is different from false [2024-08-27 01:48:38,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:38,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2024-08-27 01:48:38,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-08-27 01:48:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 32 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2024-08-27 01:48:38,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546523666] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:48:38,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:48:38,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 34 [2024-08-27 01:48:38,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084588354] [2024-08-27 01:48:38,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:48:38,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-08-27 01:48:38,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:38,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-08-27 01:48:38,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=992, Unknown=3, NotChecked=64, Total=1190 [2024-08-27 01:48:38,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:38,916 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:38,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.142857142857142) internal successors, (285), 34 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:38,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:38,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:38,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:38,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:38,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:38,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:38,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:38,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:38,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:38,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:38,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:38,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2024-08-27 01:48:38,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:48:38,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-08-27 01:48:38,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:38,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-08-27 01:48:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:48:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-08-27 01:48:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:42,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:48:42,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-08-27 01:48:42,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:42,501 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:42,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:42,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2018876800, now seen corresponding path program 2 times [2024-08-27 01:48:42,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:42,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761773188] [2024-08-27 01:48:42,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:42,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-27 01:48:42,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:42,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761773188] [2024-08-27 01:48:42,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761773188] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:42,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015965455] [2024-08-27 01:48:42,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 01:48:42,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:42,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:42,856 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:48:42,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-08-27 01:48:43,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-27 01:48:43,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 01:48:43,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 28 conjunts are in the unsatisfiable core [2024-08-27 01:48:43,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:43,427 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-08-27 01:48:43,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-08-27 01:48:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:48:43,461 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:48:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:48:43,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015965455] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:48:43,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:48:43,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 27 [2024-08-27 01:48:43,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065479804] [2024-08-27 01:48:43,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:48:43,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-08-27 01:48:43,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:43,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-08-27 01:48:43,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=644, Unknown=1, NotChecked=0, Total=756 [2024-08-27 01:48:43,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:43,744 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:43,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.25) internal successors, (231), 27 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:43,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:43,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:43,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:43,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:43,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:43,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:43,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:43,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:43,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:43,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:43,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:43,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 122 states. [2024-08-27 01:48:43,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:48:43,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-08-27 01:48:43,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:43,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:48:43,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:47,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-08-27 01:48:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-08-27 01:48:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-08-27 01:48:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:47,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:48:47,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-27 01:48:47,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-08-27 01:48:47,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:47,474 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:48:47,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:48:47,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1087457335, now seen corresponding path program 1 times [2024-08-27 01:48:47,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:48:47,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006018044] [2024-08-27 01:48:47,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:47,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:48:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-08-27 01:48:47,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:48:47,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006018044] [2024-08-27 01:48:47,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006018044] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:48:47,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593970736] [2024-08-27 01:48:47,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:48:47,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:48:47,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:48:47,731 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:48:47,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-08-27 01:48:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:48:47,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 39 conjunts are in the unsatisfiable core [2024-08-27 01:48:47,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:48:48,319 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-08-27 01:48:48,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-08-27 01:48:48,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:48,368 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:48,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 29 [2024-08-27 01:48:48,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:48,434 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:48:48,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2024-08-27 01:48:48,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:48,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2024-08-27 01:48:48,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:48:48,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2024-08-27 01:48:48,706 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2024-08-27 01:48:48,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 77 [2024-08-27 01:48:48,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-08-27 01:48:48,760 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-08-27 01:48:48,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 27 [2024-08-27 01:48:48,787 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-27 01:48:48,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2024-08-27 01:48:48,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:48,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 15 treesize of output 19 [2024-08-27 01:48:48,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:48,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 145 [2024-08-27 01:48:48,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 01:48:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:48:48,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:48:51,061 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse0 |c_~#top~0.offset|)))) (and (or (forall ((v_DerPreprocessor_30 (Array Int Int))) (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#top~0.base|) |c_~#top~0.offset|))) (not .cse1)) (or .cse1 (forall ((v_DerPreprocessor_29 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#top~0.base|) |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|)))))) is different from false [2024-08-27 01:48:51,220 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_2535 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2535))) (or (let ((.cse0 (select .cse1 |c_~#top~0.base|))) (= (select .cse0 |c_~#top~0.offset|) (select (select (store (store .cse1 |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_30) |c_~#top~0.base|) |c_~#top~0.offset|))) (= (select (select .cse1 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1)))) is different from false [2024-08-27 01:48:51,389 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-08-27 01:48:51,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 2 case distinctions, treesize of input 114 treesize of output 68 [2024-08-27 01:48:51,396 INFO L349 Elim1Store]: treesize reduction 3, result has 72.7 percent of original size [2024-08-27 01:48:51,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 93 [2024-08-27 01:48:51,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-08-27 01:48:51,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:48:51,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-08-27 01:48:51,509 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2024-08-27 01:48:51,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593970736] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:48:51,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:48:51,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17, 12] total 33 [2024-08-27 01:48:51,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845938173] [2024-08-27 01:48:51,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:48:51,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-08-27 01:48:51,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:48:51,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-08-27 01:48:51,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=851, Unknown=35, NotChecked=122, Total=1122 [2024-08-27 01:48:51,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:51,511 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:48:51,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.882352941176471) internal successors, (234), 33 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:48:51,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:51,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:51,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:51,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:51,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:48:51,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:51,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:51,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:48:51,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:48:51,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:48:51,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:48:51,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-08-27 01:48:51,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-08-27 01:48:51,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2024-08-27 01:48:51,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:48:51,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:48:51,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-27 01:48:51,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:48:54,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:48:57,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:01,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:05,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:09,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:11,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:13,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:15,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:19,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:23,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:24,383 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse3 (select .cse7 |c_~#top~0.offset|))) (let ((.cse0 (select .cse7 0)) (.cse1 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse3)) (.cse2 (forall ((v_DerPreprocessor_30 (Array Int Int))) (= .cse3 (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse7 |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|)))) (.cse6 (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) (or (not .cse1) .cse2) (or (forall ((v_DerPreprocessor_29 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#top~0.base|) |c_~#top~0.offset|) .cse3)) .cse1) (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_2535 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2535))) (or (let ((.cse4 (select .cse5 |c_~#top~0.base|))) (= (select .cse4 |c_~#top~0.offset|) (select (select (store (store .cse5 |c_~#top~0.base| (store .cse4 |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 .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1)))) (= (select .cse6 0) 1) (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse0) .cse1 (= 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|) .cse2 (= (select .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1))))) is different from false [2024-08-27 01:49:26,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:32,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:36,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:38,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:40,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:42,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:44,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:46,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:48,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:50,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:52,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:54,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:56,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:49:58,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:50:08,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:50:08,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:50:08,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:50:08,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:50:08,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:50:08,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:50:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:50:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:50:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:50:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:50:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:50:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-08-27 01:50:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-08-27 01:50:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-08-27 01:50:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:50:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:50:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-27 01:50:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-08-27 01:50:08,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-08-27 01:50:09,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-08-27 01:50:09,126 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:50:09,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:50:09,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1402148267, now seen corresponding path program 1 times [2024-08-27 01:50:09,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:50:09,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251491844] [2024-08-27 01:50:09,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:50:09,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:50:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:50:09,340 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-27 01:50:09,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:50:09,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251491844] [2024-08-27 01:50:09,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251491844] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:50:09,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749916355] [2024-08-27 01:50:09,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:50:09,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:50:09,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:50:09,343 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:50:09,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-08-27 01:50:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:50:09,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 19 conjunts are in the unsatisfiable core [2024-08-27 01:50:09,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:50:09,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-27 01:50:09,652 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 01:50:09,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-27 01:50:09,702 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-08-27 01:50:09,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2024-08-27 01:50:09,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-08-27 01:50:09,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-08-27 01:50:09,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:50:09,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 14 [2024-08-27 01:50:09,801 INFO L349 Elim1Store]: treesize reduction 82, result has 30.5 percent of original size [2024-08-27 01:50:09,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 68 treesize of output 139 [2024-08-27 01:50:09,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:50:09,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-27 01:50:09,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-08-27 01:50:09,918 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-08-27 01:50:09,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 71 [2024-08-27 01:50:09,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-27 01:50:09,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-27 01:50:09,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-27 01:50:09,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:50:09,957 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-08-27 01:50:09,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 38 [2024-08-27 01:50:09,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-27 01:50:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 01:50:10,039 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:50:10,172 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_40 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| Int)) (or (= (select v_DerPreprocessor_40 |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_40) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1))) is different from false [2024-08-27 01:50:10,206 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|))) (and (or (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (or (= (select v_DerPreprocessor_40 |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_41) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_40) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1))) .cse0) (or (not .cse0) (forall ((v_DerPreprocessor_40 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_2681 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (or (= (select v_DerPreprocessor_40 |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_2681))) (store .cse1 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse1 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_40) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))) is different from false [2024-08-27 01:50:10,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:10,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-08-27 01:50:10,298 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2024-08-27 01:50:10,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749916355] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:50:10,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:50:10,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 22 [2024-08-27 01:50:10,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66994568] [2024-08-27 01:50:10,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:50:10,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-08-27 01:50:10,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:50:10,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-08-27 01:50:10,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=321, Unknown=2, NotChecked=74, Total=462 [2024-08-27 01:50:10,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:50:10,301 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:50:10,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 22 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:50:10,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:50:10,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:50:10,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:50:10,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:50:10,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:50:10,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:50:10,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:50:10,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:50:10,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:50:10,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:50:10,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:50:10,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-08-27 01:50:10,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-08-27 01:50:10,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2024-08-27 01:50:10,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:50:10,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:50:10,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-27 01:50:10,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2024-08-27 01:50:10,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:50:13,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:50:15,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:50:17,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:50:18,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:50:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:50:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:50:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:50:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:50:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:50:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:50:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:50:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:50:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:50:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:50:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-08-27 01:50:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-08-27 01:50:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-08-27 01:50:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:50:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:50:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-27 01:50:18,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-08-27 01:50:18,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-08-27 01:50:18,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-08-27 01:50:18,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-08-27 01:50:18,250 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:50:18,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:50:18,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1345921391, now seen corresponding path program 1 times [2024-08-27 01:50:18,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:50:18,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924826453] [2024-08-27 01:50:18,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:50:18,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:50:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:50:20,404 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:50:20,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:50:20,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924826453] [2024-08-27 01:50:20,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924826453] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:50:20,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849274164] [2024-08-27 01:50:20,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:50:20,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:50:20,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:50:20,407 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:50:20,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-08-27 01:50:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:50:20,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 75 conjunts are in the unsatisfiable core [2024-08-27 01:50:20,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:50:20,855 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 01:50:20,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-27 01:50:21,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:50:21,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:50:21,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:50:21,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:50:21,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:50:21,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:50:21,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:50:21,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:50:21,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:50:21,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:50:22,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:50:22,035 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-08-27 01:50:22,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2024-08-27 01:50:22,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:50:22,171 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:50:22,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-08-27 01:50:22,487 INFO L349 Elim1Store]: treesize reduction 46, result has 37.0 percent of original size [2024-08-27 01:50:22,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 46 [2024-08-27 01:50:22,818 INFO L349 Elim1Store]: treesize reduction 126, result has 26.7 percent of original size [2024-08-27 01:50:22,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 115 treesize of output 153 [2024-08-27 01:50:22,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2024-08-27 01:50:22,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:50:22,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:50:23,147 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:50:23,147 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:50:23,357 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse4 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse5 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse4 |c_~#top~0.offset|)))) (and (or (let ((.cse2 (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (and (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse0 (store (select .cse2 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse1 (select (store .cse2 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse0) |c_~#top~0.base|))) (or (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse0) |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|))))))) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse3 (store .cse2 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse2 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1)))) (or (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|)) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse3 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))) (not .cse5)) (or .cse5 (and (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse6 (select .cse7 |c_~#top~0.base|))) (or (not (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select .cse6 |c_~#top~0.offset|))) (not (= (select (select (store (store .cse7 |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse8 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|)))))))))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-08-27 01:50:23,778 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse9 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (select .cse9 |c_~#top~0.offset|))) (let ((.cse4 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse1))) (and (or (and (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse0 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse1 (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|))))) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse3 (select .cse2 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse2 |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse1 (select .cse3 |c_~#top~0.offset|)))))))) .cse4) (or (not .cse4) (let ((.cse7 (store |c_#memory_int| |c_~#top~0.base| (store .cse9 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (and (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse5 (store (select .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse6 (select (store .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base|))) (or (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| |c_thr1Thread3of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= .cse1 (select .cse6 |c_~#top~0.offset|))))))) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse8 (store .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1)))) (or (= .cse1 (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|)) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse8 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))))))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-08-27 01:50:24,884 WARN L854 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse4 (select .cse3 |c_~#top~0.base|))) (let ((.cse0 (select .cse4 |c_~#top~0.offset|))) (or (not (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse0)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse1 (let ((.cse2 (store .cse3 |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (store .cse2 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse2 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse1 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (= .cse0 (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|)))))))))) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse10 (select .cse7 |c_~#top~0.base|))) (let ((.cse5 (select .cse10 |c_~#top~0.offset|))) (or (not (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse5)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse9 (store .cse7 |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse8 (store (select .cse9 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse6 (select (store .cse9 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#top~0.base|))) (or (not (= .cse5 (select .cse6 |c_~#top~0.offset|))) (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| c_~next_alloc_idx~0)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))))))) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse11 (select (select .cse14 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse11) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse12 (store .cse14 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse13 (select .cse12 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse12 |c_~#top~0.base| (store .cse13 |c_~#top~0.offset| c_~next_alloc_idx~0)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse11 (select .cse13 |c_~#top~0.offset|))))))))))) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse15 (select (select .cse17 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse16 (store .cse17 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (= .cse15 (select (select .cse16 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select (store .cse16 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse15)))))) (forall ((|~#m~0.offset| Int)) (not (= (select (select |c_#memory_int| |c_~#m~0.base|) |~#m~0.offset|) 0))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-08-27 01:50:27,013 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse22 (= c_~state~0 0))) (and (or (and (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse4 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse3 (store .cse4 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse2 (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse0 (store .cse3 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse1 (select .cse0 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse0 |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse1 |c_~#top~0.offset|) .cse2)))))) (= (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|) .cse2))))) (not (= (+ (select (select .cse4 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)))) (not (= (select (select .cse4 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse8 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse7 (store .cse8 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse6 (select (select .cse7 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse5 (store .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse5 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse5 |c_~#top~0.base|) |c_~#top~0.offset|) .cse6)))) (= (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|) .cse6))))) (not (= (+ (select (select .cse8 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)))) (not (= (select (select .cse8 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse9 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse9 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse13 (store .cse9 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse14 (select .cse13 |c_~#top~0.base|))) (let ((.cse10 (select .cse14 |c_~#top~0.offset|))) (or (not (= (select (select .cse9 |c_~#top~0.base|) |c_~#top~0.offset|) .cse10)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse11 (let ((.cse12 (store .cse13 |c_~#top~0.base| (store .cse14 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (store .cse12 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse12 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse11 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (= (select (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset|) .cse10))))))))))) (not (= (select (select .cse9 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse15 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse15 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse17 (store .cse15 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse21 (select .cse17 |c_~#top~0.base|))) (let ((.cse16 (select .cse21 |c_~#top~0.offset|))) (or (not (= (select (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset|) .cse16)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse20 (store .cse17 |c_~#top~0.base| (store .cse21 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse18 (store (select .cse20 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse19 (select (store .cse20 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse18) |c_~#top~0.base|))) (or (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse17 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse18) |c_~#top~0.base| (store .cse19 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= (select .cse19 |c_~#top~0.offset|) .cse16)))))))))))))) (not (= (select (select .cse15 |c_~#m~0.base|) |~#m~0.offset|) 0)))))) .cse22) (or (and (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_prenex_225 Int) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224))) (let ((.cse27 (select (store .cse23 |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse24 (select .cse27 |c_~#top~0.offset|)) (.cse25 (let ((.cse26 (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse27 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (store .cse26 v_prenex_225 (store (select .cse26 v_prenex_225) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (not (= (select (select .cse23 |c_~#m~0.base|) v_prenex_229) 0)) (not (= (+ (select (select .cse23 v_prenex_226) 0) 1) 0)) (not (= .cse24 (select (select .cse23 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select (store .cse25 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse24 (select (select .cse25 |c_~#top~0.base|) |c_~#top~0.offset|))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse28 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847))) (let ((.cse31 (store .cse28 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse30 (select (select .cse31 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse29 (store .cse31 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (+ 1 (select (select .cse28 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0)) 0)) (= (select (select .cse29 |c_~#top~0.base|) |c_~#top~0.offset|) .cse30) (not (= (select (select .cse28 |c_~#m~0.base|) |~#m~0.offset|) 0)) (= (select (select .cse28 |c_~#top~0.base|) |c_~#top~0.offset|) .cse30) (not (= (select (select (store .cse29 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))) (forall ((v_prenex_218 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse33 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (let ((.cse35 (store .cse33 |c_~#m~0.base| v_prenex_221))) (let ((.cse32 (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse34 (select (store .cse35 v_prenex_219 v_prenex_222) |c_~#top~0.base|))) (or (= .cse32 (select (select .cse33 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (+ (select (select .cse33 v_prenex_220) 0) 1) 0)) (not (= (select (select (store (store (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse34 |c_~#top~0.offset| c_~next_alloc_idx~0)) v_prenex_220 v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse32 (select .cse34 |c_~#top~0.offset|))) (not (= (select (select .cse33 |c_~#m~0.base|) v_prenex_223) 0))))))) (forall ((v_prenex_235 Int) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230))) (let ((.cse39 (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse42 (select (store .cse36 |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse41 (store .cse39 |c_~#top~0.base| (store .cse42 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse40 (store (select .cse41 v_prenex_231) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse37 (select .cse42 |c_~#top~0.offset|)) (.cse38 (select (store .cse41 v_prenex_231 .cse40) |c_~#top~0.base|))) (or (not (= (select (select .cse36 |c_~#m~0.base|) v_prenex_235) 0)) (not (= .cse37 (select (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= .cse37 (select .cse38 |c_~#top~0.offset|))) (not (= (+ (select (select .cse36 v_prenex_232) 0) 1) 0)) (not (= (select (select (store (store (store .cse39 v_prenex_231 .cse40) |c_~#top~0.base| (store .cse38 |c_~#top~0.offset| c_~next_alloc_idx~0)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))))) (not .cse22)))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-08-27 01:50:28,166 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= c_~state~0 0))) (and (or (not .cse0) (and (forall ((v_prenex_235 Int) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230))) (let ((.cse4 (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse7 (select (store .cse1 |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse6 (store .cse4 |c_~#top~0.base| (store .cse7 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (let ((.cse5 (store (select .cse6 v_prenex_231) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse2 (select .cse7 |c_~#top~0.offset|)) (.cse3 (select (store .cse6 v_prenex_231 .cse5) |c_~#top~0.base|))) (or (not (= (select (select .cse1 |c_~#m~0.base|) v_prenex_235) 0)) (not (= .cse2 (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= .cse2 (select .cse3 |c_~#top~0.offset|))) (not (= (+ (select (select .cse1 v_prenex_232) 0) 1) 0)) (not (= (select (select (store (store (store .cse4 v_prenex_231 .cse5) |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| c_~next_alloc_idx~0)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))) (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_prenex_225 Int) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224))) (let ((.cse12 (select (store .cse8 |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse9 (select .cse12 |c_~#top~0.offset|)) (.cse10 (let ((.cse11 (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse12 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (store .cse11 v_prenex_225 (store (select .cse11 v_prenex_225) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (not (= (select (select .cse8 |c_~#m~0.base|) v_prenex_229) 0)) (not (= (+ (select (select .cse8 v_prenex_226) 0) 1) 0)) (not (= .cse9 (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|))) (= .cse9 (select (select .cse10 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select (store .cse10 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847))) (let ((.cse16 (store .cse13 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse15 (select (select .cse16 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse14 (store .cse16 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (+ 1 (select (select .cse13 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0)) 0)) (= (select (select .cse14 |c_~#top~0.base|) |c_~#top~0.offset|) .cse15) (not (= (select (select .cse13 |c_~#m~0.base|) |~#m~0.offset|) 0)) (= (select (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset|) .cse15) (not (= (select (select (store .cse14 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))) (forall ((v_prenex_218 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (let ((.cse20 (store .cse18 |c_~#m~0.base| v_prenex_221))) (let ((.cse17 (select (select .cse20 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse19 (select (store .cse20 v_prenex_219 v_prenex_222) |c_~#top~0.base|))) (or (= .cse17 (select (select .cse18 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (+ (select (select .cse18 v_prenex_220) 0) 1) 0)) (not (= (select (select (store (store (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse19 |c_~#top~0.offset| c_~next_alloc_idx~0)) v_prenex_220 v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse17 (select .cse19 |c_~#top~0.offset|))) (not (= (select (select .cse18 |c_~#m~0.base|) v_prenex_223) 0))))))))) (or (and (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse25 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse24 (store .cse25 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse23 (select (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse21 (store .cse24 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse22 (select .cse21 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse21 |c_~#top~0.base| (store .cse22 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse22 |c_~#top~0.offset|) .cse23)))))) (= (select (select .cse25 |c_~#top~0.base|) |c_~#top~0.offset|) .cse23))))) (not (= (+ (select (select .cse25 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)))) (not (= (select (select .cse25 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse26 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse30 (store .cse26 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse31 (select .cse30 |c_~#top~0.base|))) (let ((.cse27 (select .cse31 |c_~#top~0.offset|))) (or (not (= (select (select .cse26 |c_~#top~0.base|) |c_~#top~0.offset|) .cse27)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse28 (let ((.cse29 (store .cse30 |c_~#top~0.base| (store .cse31 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (store .cse29 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse29 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse28 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (= (select (select .cse28 |c_~#top~0.base|) |c_~#top~0.offset|) .cse27))))))))) (not (= (+ (select (select .cse26 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)))) (not (= (select (select .cse26 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse35 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse34 (store .cse35 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse33 (select (select .cse34 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse32 (store .cse34 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse32 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse32 |c_~#top~0.base|) |c_~#top~0.offset|) .cse33)))) (= (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|) .cse33))))) (not (= (+ (select (select .cse35 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)))) (not (= (select (select .cse35 |c_~#m~0.base|) |~#m~0.offset|) 0))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse36 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse36 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse36 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse39 (store .cse36 |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse42 (select .cse39 |c_~#top~0.base|))) (let ((.cse37 (select .cse42 |c_~#top~0.offset|))) (or (not (= (select (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset|) .cse37)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse41 (store .cse39 |c_~#top~0.base| (store .cse42 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (let ((.cse40 (store (select .cse41 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse38 (select (store .cse41 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base|))) (or (not (= (select .cse38 |c_~#top~0.offset|) .cse37)) (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse39 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base| (store .cse38 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))))))))))))) .cse0))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-08-27 01:50:28,491 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse20 (= c_~state~0 0))) (and (or (and (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_225 Int) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse2 (let ((.cse4 (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (store .cse4 v_prenex_225 (store (select .cse4 v_prenex_225) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1)))) (.cse1 (select .cse3 |c_~#top~0.offset|)) (.cse0 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224))) (or (not (= (+ (select (select .cse0 v_prenex_226) 0) 1) 0)) (= .cse1 (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select (store .cse2 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse1 (select (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select .cse0 |c_~#m~0.base|) v_prenex_229) 0)))))) (forall ((v_prenex_235 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse11 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse10 (store .cse8 |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (let ((.cse9 (store (select .cse10 v_prenex_231) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse5 (select .cse11 |c_~#top~0.offset|)) (.cse7 (select (store .cse10 v_prenex_231 .cse9) |c_~#top~0.base|)) (.cse6 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230))) (or (not (= .cse5 (select (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= .cse5 (select .cse7 |c_~#top~0.offset|))) (not (= (select (select (store (store (store .cse8 v_prenex_231 .cse9) |c_~#top~0.base| (store .cse7 |c_~#top~0.offset| c_~next_alloc_idx~0)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse6 |c_~#m~0.base|) v_prenex_235) 0)) (not (= (+ (select (select .cse6 v_prenex_232) 0) 1) 0)))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2844 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse13 (select (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse12 (store .cse15 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46)) (.cse14 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847))) (or (= (select (select .cse12 |c_~#top~0.base|) |c_~#top~0.offset|) .cse13) (= (select (select .cse14 |c_~#top~0.base|) |c_~#top~0.offset|) .cse13) (not (= (+ 1 (select (select .cse14 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0)) 0)) (not (= (select (select (store .cse12 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse14 |c_~#m~0.base|) |~#m~0.offset|) 0)))))) (forall ((v_prenex_218 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221))) (let ((.cse16 (select (store .cse19 v_prenex_219 v_prenex_222) |c_~#top~0.base|)) (.cse18 (select (select .cse19 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse17 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (or (not (= (select (select (store (store (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse16 |c_~#top~0.offset| c_~next_alloc_idx~0)) v_prenex_220 v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse17 |c_~#m~0.base|) v_prenex_223) 0)) (not (= (+ (select (select .cse17 v_prenex_220) 0) 1) 0)) (not (= .cse18 (select .cse16 |c_~#top~0.offset|))) (= .cse18 (select (select .cse17 |c_~#top~0.base|) |c_~#top~0.offset|))))))) (not .cse20)) (or (and (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse21 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse21 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse21 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse22 (select (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse21 |c_~#top~0.base|) |c_~#top~0.offset|) .cse22) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse23 (store .cse24 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse23 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse23 |c_~#top~0.base|) |c_~#top~0.offset|) .cse22))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse25 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse25 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse25 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse30 (select .cse29 |c_~#top~0.base|))) (let ((.cse26 (select .cse30 |c_~#top~0.offset|))) (or (not (= (select (select .cse25 |c_~#top~0.base|) |c_~#top~0.offset|) .cse26)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse27 (let ((.cse28 (store .cse29 |c_~#top~0.base| (store .cse30 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (store .cse28 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse28 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse27 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (= (select (select .cse27 |c_~#top~0.base|) |c_~#top~0.offset|) .cse26)))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse31 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse31 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse31 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse35 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse32 (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse31 |c_~#top~0.base|) |c_~#top~0.offset|) .cse32) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse33 (store .cse35 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse34 (select .cse33 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse33 |c_~#top~0.base| (store .cse34 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse34 |c_~#top~0.offset|) .cse32))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse36 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse36 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse36 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse42 (select .cse39 |c_~#top~0.base|))) (let ((.cse37 (select .cse42 |c_~#top~0.offset|))) (or (not (= (select (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset|) .cse37)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse41 (store .cse39 |c_~#top~0.base| (store .cse42 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_index_malloc_~curr_alloc_idx~0#1|)))) (let ((.cse40 (store (select .cse41 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse38 (select (store .cse41 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base|))) (or (not (= (select .cse38 |c_~#top~0.offset|) .cse37)) (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse39 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base| (store .cse38 |c_~#top~0.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))))))))))))) .cse20))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-08-27 01:50:28,758 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= c_~state~0 0)) (.cse6 (+ c_~next_alloc_idx~0 2))) (and (or .cse0 (and (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse1 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse1 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse1 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse8 (select .cse4 |c_~#top~0.base|))) (let ((.cse2 (select .cse8 |c_~#top~0.offset|))) (or (not (= (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|) .cse2)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse7 (store .cse4 |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse5 (store (select .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse3 (select (store .cse7 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base|))) (or (not (= (select .cse3 |c_~#top~0.offset|) .cse2)) (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse4 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| .cse6)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse9 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse9 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse9 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse14 (select .cse13 |c_~#top~0.base|))) (let ((.cse10 (select .cse14 |c_~#top~0.offset|))) (or (not (= (select (select .cse9 |c_~#top~0.base|) |c_~#top~0.offset|) .cse10)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse11 (let ((.cse12 (store .cse13 |c_~#top~0.base| (store .cse14 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse12 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse12 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))))) (or (= (select (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset|) .cse10) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse11 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse15 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse15 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse15 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse16 (select (select .cse19 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset|) .cse16) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse17 (store .cse19 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse18 (select .cse17 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse17 |c_~#top~0.base| (store .cse18 |c_~#top~0.offset| .cse6)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse18 |c_~#top~0.offset|) .cse16))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse20 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse20 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse20 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse21 (select (select .cse23 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse20 |c_~#top~0.base|) |c_~#top~0.offset|) .cse21) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse22 (store .cse23 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse22 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse22 |c_~#top~0.base|) |c_~#top~0.offset|) .cse21))))))))))))))) (or (not .cse0) (and (forall ((v_prenex_218 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221))) (let ((.cse26 (select (store .cse27 v_prenex_219 v_prenex_222) |c_~#top~0.base|)) (.cse25 (select (select .cse27 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse24 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (or (not (= (select (select .cse24 |c_~#m~0.base|) v_prenex_223) 0)) (not (= (+ (select (select .cse24 v_prenex_220) 0) 1) 0)) (not (= .cse25 (select .cse26 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse26 |c_~#top~0.offset| .cse6)) v_prenex_220 v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse25 (select (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset|)))))) (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_225 Int) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse31 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse29 (let ((.cse32 (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse31 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse32 v_prenex_225 (store (select .cse32 v_prenex_225) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1)))) (.cse30 (select .cse31 |c_~#top~0.offset|)) (.cse28 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224))) (or (not (= (+ (select (select .cse28 v_prenex_226) 0) 1) 0)) (not (= (select (select (store .cse29 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse30 (select (select .cse29 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= .cse30 (select (select .cse28 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select .cse28 |c_~#m~0.base|) v_prenex_229) 0)))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2844 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse36 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse34 (select (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse33 (store .cse36 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46)) (.cse35 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847))) (or (= (select (select .cse33 |c_~#top~0.base|) |c_~#top~0.offset|) .cse34) (= (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|) .cse34) (not (= (+ 1 (select (select .cse35 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0)) 0)) (not (= (select (select (store .cse33 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse35 |c_~#m~0.base|) |~#m~0.offset|) 0)))))) (forall ((v_prenex_235 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse43 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse42 (store .cse37 |c_~#top~0.base| (store .cse43 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse38 (store (select .cse42 v_prenex_231) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse40 (select .cse43 |c_~#top~0.offset|)) (.cse39 (select (store .cse42 v_prenex_231 .cse38) |c_~#top~0.base|)) (.cse41 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230))) (or (not (= (select (select (store (store (store .cse37 v_prenex_231 .cse38) |c_~#top~0.base| (store .cse39 |c_~#top~0.offset| .cse6)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse40 (select (select .cse41 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select .cse41 |c_~#m~0.base|) v_prenex_235) 0)) (not (= .cse40 (select .cse39 |c_~#top~0.offset|))) (not (= (+ (select (select .cse41 v_prenex_232) 0) 1) 0)))))))))))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-08-27 01:50:29,200 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse4 (+ c_~next_alloc_idx~0 2)) (.cse0 (= c_~state~0 0))) (and (or (not .cse0) (and (forall ((v_prenex_218 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221))) (let ((.cse3 (select (store .cse5 v_prenex_219 v_prenex_222) |c_~#top~0.base|)) (.cse2 (select (select .cse5 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse1 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (or (not (= (select (select .cse1 |c_~#m~0.base|) v_prenex_223) 0)) (not (= (+ (select (select .cse1 v_prenex_220) 0) 1) 0)) (not (= .cse2 (select .cse3 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| .cse4)) v_prenex_220 v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse2 (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|)))))) (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_225 Int) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse7 (select .cse10 |c_~#top~0.offset|)) (.cse6 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224)) (.cse8 (let ((.cse9 (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse9 v_prenex_225 (store (select .cse9 v_prenex_225) 0 1))))) (or (not (= (+ (select (select .cse6 v_prenex_226) 0) 1) 0)) (= .cse7 (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= .cse7 (select (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select .cse6 |c_~#m~0.base|) v_prenex_229) 0)) (not (= (select (select (store .cse8 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) (forall ((v_prenex_235 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse17 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse16 (store .cse14 |c_~#top~0.base| (store .cse17 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse15 (store (select .cse16 v_prenex_231) 0 1))) (let ((.cse11 (select .cse17 |c_~#top~0.offset|)) (.cse13 (select (store .cse16 v_prenex_231 .cse15) |c_~#top~0.base|)) (.cse12 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230))) (or (not (= .cse11 (select (select .cse12 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= .cse11 (select .cse13 |c_~#top~0.offset|))) (not (= (select (select (store (store (store .cse14 v_prenex_231 .cse15) |c_~#top~0.base| (store .cse13 |c_~#top~0.offset| .cse4)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse12 |c_~#m~0.base|) v_prenex_235) 0)) (not (= (+ (select (select .cse12 v_prenex_232) 0) 1) 0)))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2844 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse19 (select (select .cse21 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse18 (store .cse21 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46)) (.cse20 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847))) (or (= (select (select .cse18 |c_~#top~0.base|) |c_~#top~0.offset|) .cse19) (= (select (select .cse20 |c_~#top~0.base|) |c_~#top~0.offset|) .cse19) (not (= (+ 1 (select (select .cse20 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0)) 0)) (not (= (select (select (store .cse18 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse20 |c_~#m~0.base|) |~#m~0.offset|) 0)))))))) (or (and (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse22 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse22 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse22 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse27 (select .cse26 |c_~#top~0.base|))) (let ((.cse23 (select .cse27 |c_~#top~0.offset|))) (or (not (= (select (select .cse22 |c_~#top~0.base|) |c_~#top~0.offset|) .cse23)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse24 (let ((.cse25 (store .cse26 |c_~#top~0.base| (store .cse27 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse25 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse25 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) 0 1))))) (or (= .cse23 (select (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset|)) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse24 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse28 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse28 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse28 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse29 (select (select .cse32 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse28 |c_~#top~0.base|) |c_~#top~0.offset|) .cse29) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse30 (store .cse32 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse31 (select .cse30 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse30 |c_~#top~0.base| (store .cse31 |c_~#top~0.offset| .cse4)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse31 |c_~#top~0.offset|) .cse29))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse33 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse33 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse33 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse34 (select (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse33 |c_~#top~0.base|) |c_~#top~0.offset|) .cse34) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse35 (store .cse36 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse35 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|) .cse34))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse37 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse37 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse43 (select .cse39 |c_~#top~0.base|))) (let ((.cse38 (select .cse43 |c_~#top~0.offset|))) (or (not (= (select (select .cse37 |c_~#top~0.base|) |c_~#top~0.offset|) .cse38)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse42 (store .cse39 |c_~#top~0.base| (store .cse43 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse40 (store (select .cse42 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) 0 1))) (let ((.cse41 (select (store .cse42 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base|))) (or (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse39 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base| (store .cse41 |c_~#top~0.offset| .cse4)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= .cse38 (select .cse41 |c_~#top~0.offset|))))))))))))))) (not (= (select (select .cse37 |c_~#m~0.base|) |~#m~0.offset|) 0)))))) .cse0))) (= |c_thr1Thread1of3ForFork0_push_loop_~r~0#1| 0)) is different from false [2024-08-27 01:50:29,450 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~next_alloc_idx~0 2)) (.cse0 (= c_~state~0 0))) (and (or (not .cse0) (and (forall ((v_prenex_218 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221))) (let ((.cse3 (select (store .cse5 v_prenex_219 v_prenex_222) |c_~#top~0.base|)) (.cse2 (select (select .cse5 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse1 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (or (not (= (select (select .cse1 |c_~#m~0.base|) v_prenex_223) 0)) (not (= (+ (select (select .cse1 v_prenex_220) 0) 1) 0)) (not (= .cse2 (select .cse3 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| .cse4)) v_prenex_220 v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse2 (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|)))))) (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_225 Int) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse7 (select .cse10 |c_~#top~0.offset|)) (.cse6 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_224)) (.cse8 (let ((.cse9 (store (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse9 v_prenex_225 (store (select .cse9 v_prenex_225) 0 1))))) (or (not (= (+ (select (select .cse6 v_prenex_226) 0) 1) 0)) (= .cse7 (select (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= .cse7 (select (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select .cse6 |c_~#m~0.base|) v_prenex_229) 0)) (not (= (select (select (store .cse8 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) (forall ((v_prenex_235 Int) (v_ArrVal_2844 (Array Int Int)) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse17 (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse16 (store .cse14 |c_~#top~0.base| (store .cse17 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse15 (store (select .cse16 v_prenex_231) 0 1))) (let ((.cse11 (select .cse17 |c_~#top~0.offset|)) (.cse13 (select (store .cse16 v_prenex_231 .cse15) |c_~#top~0.base|)) (.cse12 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_230))) (or (not (= .cse11 (select (select .cse12 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= .cse11 (select .cse13 |c_~#top~0.offset|))) (not (= (select (select (store (store (store .cse14 v_prenex_231 .cse15) |c_~#top~0.base| (store .cse13 |c_~#top~0.offset| .cse4)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse12 |c_~#m~0.base|) v_prenex_235) 0)) (not (= (+ (select (select .cse12 v_prenex_232) 0) 1) 0)))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2844 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse19 (select (select .cse21 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse18 (store .cse21 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46)) (.cse20 (store (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_ArrVal_2847))) (or (= (select (select .cse18 |c_~#top~0.base|) |c_~#top~0.offset|) .cse19) (= (select (select .cse20 |c_~#top~0.base|) |c_~#top~0.offset|) .cse19) (not (= (+ 1 (select (select .cse20 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0)) 0)) (not (= (select (select (store .cse18 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse20 |c_~#m~0.base|) |~#m~0.offset|) 0)))))))) (or (and (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse22 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse22 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse22 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse27 (select .cse26 |c_~#top~0.base|))) (let ((.cse23 (select .cse27 |c_~#top~0.offset|))) (or (not (= (select (select .cse22 |c_~#top~0.base|) |c_~#top~0.offset|) .cse23)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse24 (let ((.cse25 (store .cse26 |c_~#top~0.base| (store .cse27 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse25 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse25 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) 0 1))))) (or (= .cse23 (select (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset|)) (forall ((v_DerPreprocessor_44 (Array Int Int))) (not (= (select (select (store .cse24 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse28 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse28 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse28 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse29 (select (select .cse32 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse28 |c_~#top~0.base|) |c_~#top~0.offset|) .cse29) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse30 (store .cse32 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (let ((.cse31 (select .cse30 |c_~#top~0.base|))) (or (not (= (select (select (store (store .cse30 |c_~#top~0.base| (store .cse31 |c_~#top~0.offset| .cse4)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse31 |c_~#top~0.offset|) .cse29))))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse33 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (not (= (select (select .cse33 |c_~#m~0.base|) |~#m~0.offset|) 0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse33 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse34 (select (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse33 |c_~#top~0.base|) |c_~#top~0.offset|) .cse34) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse35 (store .cse36 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_46))) (or (not (= (select (select (store .cse35 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|) .cse34))))))))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse37 (store (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int)) (or (not (= (+ (select (select .cse37 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (forall ((v_ArrVal_2849 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse43 (select .cse39 |c_~#top~0.base|))) (let ((.cse38 (select .cse43 |c_~#top~0.offset|))) (or (not (= (select (select .cse37 |c_~#top~0.base|) |c_~#top~0.offset|) .cse38)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int)) (let ((.cse42 (store .cse39 |c_~#top~0.base| (store .cse43 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse40 (store (select .cse42 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) 0 1))) (let ((.cse41 (select (store .cse42 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base|))) (or (forall ((v_DerPreprocessor_45 (Array Int Int))) (not (= (select (select (store (store (store .cse39 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse40) |c_~#top~0.base| (store .cse41 |c_~#top~0.offset| .cse4)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= .cse38 (select .cse41 |c_~#top~0.offset|))))))))))))))) (not (= (select (select .cse37 |c_~#m~0.base|) |~#m~0.offset|) 0)))))) .cse0))) is different from false [2024-08-27 01:50:30,386 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse52 (select |c_#memory_int| |c_~#top~0.base|)) (.cse53 (= c_~state~0 0))) (let ((.cse1 (not .cse53)) (.cse7 (+ c_~next_alloc_idx~0 2)) (.cse0 (= |c_thr1Thread1of3ForFork0_push_~oldTop~0#1| (select .cse52 |c_~#top~0.offset|)))) (and (or (not .cse0) (and (or .cse1 (and (forall ((v_prenex_235 Int) (v_prenex_370 (Array Int Int)) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_prenex_369 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse5 (store (store .cse8 |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse10 (select (store (store (store .cse8 |c_~#top~0.base| v_prenex_370) |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse9 (store .cse5 |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse6 (store (select .cse9 v_prenex_231) 0 1))) (let ((.cse2 (select .cse10 |c_~#top~0.offset|)) (.cse3 (select (store .cse9 v_prenex_231 .cse6) |c_~#top~0.base|)) (.cse4 (store (store (store .cse8 |c_~#m~0.base| v_prenex_369) |c_~#top~0.base| v_prenex_370) |c_~#m2~0.base| v_prenex_230))) (or (not (= .cse2 (select .cse3 |c_~#top~0.offset|))) (not (= .cse2 (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select (store (store (store .cse5 v_prenex_231 .cse6) |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| .cse7)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse4 |c_~#m~0.base|) v_prenex_235) 0)) (not (= (+ (select (select .cse4 v_prenex_232) 0) 1) 0))))))))) (forall ((v_prenex_378 Int) (v_prenex_376 Int) (v_prenex_377 Int) (v_prenex_371 (Array Int Int)) (v_prenex_373 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_375 (Array Int Int)) (v_prenex_365 (Array Int Int)) (v_prenex_366 (Array Int Int)) (v_prenex_379 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse15 (store (store (store .cse14 |c_~#top~0.base| v_prenex_366) |c_~#m2~0.base| v_prenex_371) |c_~#m~0.base| v_prenex_379))) (let ((.cse12 (select (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse11 (store .cse15 v_prenex_378 v_prenex_375)) (.cse13 (store (store (store .cse14 |c_~#m~0.base| v_prenex_365) |c_~#top~0.base| v_prenex_366) |c_~#m2~0.base| v_prenex_371))) (or (not (= (select (select (store .cse11 v_prenex_377 v_prenex_373) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse12 (select (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset|)) (= .cse12 (select (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select .cse13 |c_~#m~0.base|) v_prenex_376) 0)) (not (= (+ 1 (select (select .cse13 v_prenex_377) 0)) 0))))))) (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_prenex_225 Int) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_224 (Array Int Int)) (v_prenex_367 (Array Int Int)) (v_prenex_368 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int)) (let ((.cse20 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse19 (select (store (store (store .cse20 |c_~#top~0.base| v_prenex_368) |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse16 (let ((.cse21 (store (store (store .cse20 |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse19 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse21 v_prenex_225 (store (select .cse21 v_prenex_225) 0 1)))) (.cse17 (store (store (store .cse20 |c_~#m~0.base| v_prenex_367) |c_~#top~0.base| v_prenex_368) |c_~#m2~0.base| v_prenex_224)) (.cse18 (select .cse19 |c_~#top~0.offset|))) (or (not (= (select (select (store .cse16 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse17 |c_~#m~0.base|) v_prenex_229) 0)) (not (= (+ (select (select .cse17 v_prenex_226) 0) 1) 0)) (= (select (select .cse16 |c_~#top~0.base|) |c_~#top~0.offset|) .cse18) (not (= (select (select .cse17 |c_~#top~0.base|) |c_~#top~0.offset|) .cse18))))))) (forall ((v_prenex_218 (Array Int Int)) (v_prenex_223 Int) (v_prenex_372 (Array Int Int)) (v_prenex_220 Int) (v_prenex_374 (Array Int Int)) (v_prenex_221 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse26 (store (store (store .cse24 |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221))) (let ((.cse22 (store (store (store .cse24 |c_~#m~0.base| v_prenex_372) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218)) (.cse23 (select (select .cse26 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse25 (select (store .cse26 v_prenex_219 v_prenex_222) |c_~#top~0.base|))) (or (not (= 0 (select (select .cse22 |c_~#m~0.base|) v_prenex_223))) (= .cse23 (select (select .cse22 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select (store (store (store (store (store .cse24 |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse25 |c_~#top~0.offset| .cse7)) v_prenex_220 v_prenex_374) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select .cse22 v_prenex_220) 0) 1) 0)) (not (= .cse23 (select .cse25 |c_~#top~0.offset|)))))))))) (or (let ((.cse33 (store |c_#memory_int| |c_~#top~0.base| (store .cse52 |c_~#top~0.offset| |c_thr1Thread1of3ForFork0_push_~newTop~0#1|)))) (and (forall ((v_prenex_359 Int) (v_prenex_361 (Array Int Int)) (v_prenex_362 (Array Int Int)) (v_prenex_364 Int) (v_prenex_363 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_360 Int) (v_prenex_358 (Array Int Int))) (let ((.cse30 (store .cse33 |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse32 (select (store (store .cse30 |c_~#m2~0.base| v_prenex_358) |c_~#m~0.base| v_prenex_363) |c_~#top~0.base|))) (let ((.cse28 (select .cse32 |c_~#top~0.offset|)) (.cse29 (let ((.cse31 (store (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_~#m2~0.base| v_prenex_358) |c_~#m~0.base| v_prenex_363) |c_~#top~0.base| (store .cse32 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse31 v_prenex_359 (store (select .cse31 v_prenex_359) 0 1)))) (.cse27 (store (store .cse30 |c_~#m~0.base| v_prenex_361) |c_~#m2~0.base| v_prenex_358))) (or (not (= (+ (select (select .cse27 v_prenex_360) 0) 1) 0)) (not (= .cse28 (select (select .cse27 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select (store .cse29 v_prenex_360 v_prenex_362) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse28 (select (select .cse29 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select .cse27 |c_~#m~0.base|) v_prenex_364) 0))))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2844 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse41 (store .cse33 |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse37 (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849)) (.cse40 (select (store (store .cse41 |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849) |c_~#top~0.base|))) (let ((.cse39 (store .cse37 |c_~#top~0.base| (store .cse40 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse38 (store (select .cse39 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) 0 1))) (let ((.cse34 (store (store .cse41 |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847)) (.cse35 (select .cse40 |c_~#top~0.offset|)) (.cse36 (select (store .cse39 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse38) |c_~#top~0.base|))) (or (not (= 0 (select (select .cse34 |c_~#m~0.base|) |~#m~0.offset|))) (not (= (+ (select (select .cse34 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1) 0)) (not (= .cse35 (select .cse36 |c_~#top~0.offset|))) (not (= (select (select .cse34 |c_~#top~0.base|) |c_~#top~0.offset|) .cse35)) (not (= (select (select (store (store (store .cse37 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse38) |c_~#top~0.base| (store .cse36 |c_~#top~0.offset| .cse7)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))) (forall ((v_prenex_357 Int) (v_prenex_352 Int) (v_prenex_353 Int) (v_prenex_351 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_354 (Array Int Int)) (v_prenex_355 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_prenex_356 (Array Int Int))) (let ((.cse45 (store .cse33 |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse46 (store (store .cse45 |c_~#m2~0.base| v_prenex_351) |c_~#m~0.base| v_prenex_355))) (let ((.cse42 (store .cse46 v_prenex_352 v_prenex_356)) (.cse44 (select (select .cse46 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse43 (store (store .cse45 |c_~#m~0.base| v_prenex_354) |c_~#m2~0.base| v_prenex_351))) (or (not (= (select (select (store .cse42 v_prenex_353 v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse43 |c_~#top~0.base|) |c_~#top~0.offset|) .cse44) (not (= 0 (select (select .cse43 |c_~#m~0.base|) v_prenex_357))) (= (select (select .cse42 |c_~#top~0.base|) |c_~#top~0.offset|) .cse44) (not (= (+ (select (select .cse43 v_prenex_353) 0) 1) 0))))))) (forall ((v_prenex_349 (Array Int Int)) (v_prenex_345 Int) (v_prenex_346 Int) (v_prenex_350 Int) (v_DerPreprocessor_49 (Array Int Int)) (v_prenex_344 (Array Int Int)) (v_prenex_347 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_prenex_348 (Array Int Int))) (let ((.cse51 (store .cse33 |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49))) (let ((.cse50 (store (store .cse51 |c_~#m2~0.base| v_prenex_344) |c_~#m~0.base| v_prenex_349))) (let ((.cse49 (select (store .cse50 v_prenex_345 v_DerPreprocessor_46) |c_~#top~0.base|)) (.cse47 (store (store .cse51 |c_~#m~0.base| v_prenex_347) |c_~#m2~0.base| v_prenex_344)) (.cse48 (select (select .cse50 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (not (= (+ (select (select .cse47 v_prenex_346) 0) 1) 0)) (not (= .cse48 (select .cse49 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_~#m2~0.base| v_prenex_344) |c_~#m~0.base| v_prenex_349) v_prenex_345 v_DerPreprocessor_46) |c_~#top~0.base| (store .cse49 |c_~#top~0.offset| .cse7)) v_prenex_346 v_prenex_348) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse47 |c_~#m~0.base|) v_prenex_350) 0)) (= (select (select .cse47 |c_~#top~0.base|) |c_~#top~0.offset|) .cse48)))))))) .cse53))) (or (and (or (and (forall ((v_prenex_339 (Array Int Int)) (v_prenex_329 (Array Int Int)) (v_prenex_341 Int) (v_prenex_342 Int) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_330 (Array Int Int)) (v_prenex_340 Int) (v_prenex_343 (Array Int Int)) (v_prenex_335 (Array Int Int)) (v_prenex_337 (Array Int Int))) (let ((.cse58 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse57 (store (store (store .cse58 |c_~#top~0.base| v_prenex_330) |c_~#m2~0.base| v_prenex_335) |c_~#m~0.base| v_prenex_343))) (let ((.cse55 (select (select .cse57 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse54 (store (store (store .cse58 |c_~#m~0.base| v_prenex_329) |c_~#top~0.base| v_prenex_330) |c_~#m2~0.base| v_prenex_335)) (.cse56 (store .cse57 v_prenex_342 v_prenex_339))) (or (not (= (+ (select (select .cse54 v_prenex_341) 0) 1) 0)) (= .cse55 (select (select .cse56 |c_~#top~0.base|) |c_~#top~0.offset|)) (= .cse55 (select (select .cse54 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select .cse54 |c_~#m~0.base|) v_prenex_340) 0)) (not (= (select (select (store .cse56 v_prenex_341 v_prenex_337) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))) (forall ((v_prenex_235 Int) (v_prenex_231 Int) (v_prenex_232 Int) (v_prenex_230 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_233 (Array Int Int)) (v_prenex_234 (Array Int Int)) (v_prenex_333 (Array Int Int)) (v_prenex_334 (Array Int Int))) (let ((.cse64 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse61 (store (store .cse64 |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234)) (.cse65 (select (store (store (store .cse64 |c_~#top~0.base| v_prenex_334) |c_~#m2~0.base| v_prenex_230) |c_~#m~0.base| v_prenex_234) |c_~#top~0.base|))) (let ((.cse66 (store .cse61 |c_~#top~0.base| (store .cse65 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse62 (store (select .cse66 v_prenex_231) 0 1))) (let ((.cse63 (select (store .cse66 v_prenex_231 .cse62) |c_~#top~0.base|)) (.cse60 (select .cse65 |c_~#top~0.offset|)) (.cse59 (store (store (store .cse64 |c_~#m~0.base| v_prenex_333) |c_~#top~0.base| v_prenex_334) |c_~#m2~0.base| v_prenex_230))) (or (not (= (select (select .cse59 |c_~#top~0.base|) |c_~#top~0.offset|) .cse60)) (not (= (select (select .cse59 |c_~#m~0.base|) v_prenex_235) 0)) (not (= (select (select (store (store (store .cse61 v_prenex_231 .cse62) |c_~#top~0.base| (store .cse63 |c_~#top~0.offset| .cse7)) v_prenex_232 v_prenex_233) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse63 |c_~#top~0.offset|) .cse60)) (not (= (+ (select (select .cse59 v_prenex_232) 0) 1) 0))))))))) (forall ((v_prenex_338 (Array Int Int)) (v_prenex_218 (Array Int Int)) (v_prenex_223 Int) (v_prenex_220 Int) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_221 (Array Int Int)) (v_prenex_222 (Array Int Int)) (v_prenex_219 Int) (v_prenex_336 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse70 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse71 (store (store (store .cse70 |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221))) (let ((.cse67 (select (select .cse71 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse69 (select (store .cse71 v_prenex_219 v_prenex_222) |c_~#top~0.base|)) (.cse68 (store (store (store .cse70 |c_~#m~0.base| v_prenex_336) |c_~#top~0.base| v_DerPreprocessor_47) |c_~#m2~0.base| v_prenex_218))) (or (= .cse67 (select (select .cse68 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select .cse69 |c_~#top~0.offset|) .cse67)) (not (= (select (select (store (store (store (store (store .cse70 |c_~#m2~0.base| v_prenex_218) |c_~#m~0.base| v_prenex_221) v_prenex_219 v_prenex_222) |c_~#top~0.base| (store .cse69 |c_~#top~0.offset| .cse7)) v_prenex_220 v_prenex_338) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse68 |c_~#m~0.base|) v_prenex_223) 0)) (not (= (+ (select (select .cse68 v_prenex_220) 0) 1) 0))))))) (forall ((v_prenex_228 (Array Int Int)) (v_prenex_226 Int) (v_prenex_225 Int) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_331 (Array Int Int)) (v_prenex_332 (Array Int Int)) (v_prenex_224 (Array Int Int)) (v_prenex_227 (Array Int Int)) (v_prenex_229 Int)) (let ((.cse75 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse77 (select (store (store (store .cse75 |c_~#top~0.base| v_prenex_332) |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base|))) (let ((.cse73 (select .cse77 |c_~#top~0.offset|)) (.cse74 (let ((.cse76 (store (store (store .cse75 |c_~#m2~0.base| v_prenex_224) |c_~#m~0.base| v_prenex_228) |c_~#top~0.base| (store .cse77 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse76 v_prenex_225 (store (select .cse76 v_prenex_225) 0 1)))) (.cse72 (store (store (store .cse75 |c_~#m~0.base| v_prenex_331) |c_~#top~0.base| v_prenex_332) |c_~#m2~0.base| v_prenex_224))) (or (not (= (select (select .cse72 |c_~#top~0.base|) |c_~#top~0.offset|) .cse73)) (= (select (select .cse74 |c_~#top~0.base|) |c_~#top~0.offset|) .cse73) (not (= (select (select (store .cse74 v_prenex_226 v_prenex_227) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select .cse72 v_prenex_226) 0) 1) 0)) (not (= (select (select .cse72 |c_~#m~0.base|) v_prenex_229) 0)))))))) .cse1) (or .cse53 (and (forall ((v_prenex_318 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_321 Int) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_prenex_316 Int) (v_prenex_315 (Array Int Int)) (v_prenex_317 Int)) (let ((.cse82 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse81 (store (store .cse82 |c_~#m2~0.base| v_prenex_315) |c_~#m~0.base| v_prenex_319))) (let ((.cse79 (store .cse81 v_prenex_316 v_prenex_320)) (.cse78 (store (store .cse82 |c_~#m~0.base| v_prenex_318) |c_~#m2~0.base| v_prenex_315)) (.cse80 (select (select .cse81 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (not (= (select (select .cse78 |c_~#m~0.base|) v_prenex_321) 0)) (not (= (select (select (store .cse79 v_prenex_317 v_DerPreprocessor_44) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select .cse78 v_prenex_317) 0) 1) 0)) (= (select (select .cse79 |c_~#top~0.base|) |c_~#top~0.offset|) .cse80) (= (select (select .cse78 |c_~#top~0.base|) |c_~#top~0.offset|) .cse80)))))) (forall ((v_ArrVal_2847 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| Int) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2844 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int)) (v_ArrVal_2849 (Array Int Int)) (|~#m~0.offset| Int)) (let ((.cse90 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse85 (store (store .cse90 |c_~#m2~0.base| v_ArrVal_2847) |c_~#m~0.base| v_ArrVal_2849))) (let ((.cse89 (select .cse85 |c_~#top~0.base|))) (let ((.cse88 (store .cse85 |c_~#top~0.base| (store .cse89 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (let ((.cse86 (store (select .cse88 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) 0 1))) (let ((.cse83 (store (store .cse90 |c_~#m~0.base| v_ArrVal_2844) |c_~#m2~0.base| v_ArrVal_2847)) (.cse84 (select .cse89 |c_~#top~0.offset|)) (.cse87 (select (store .cse88 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse86) |c_~#top~0.base|))) (or (not (= (select (select .cse83 |c_~#top~0.base|) |c_~#top~0.offset|) .cse84)) (not (= 0 (+ (select (select .cse83 |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49|) 0) 1))) (not (= (select (select .cse83 |c_~#m~0.base|) |~#m~0.offset|) 0)) (not (= (select (select (store (store (store .cse85 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse86) |c_~#top~0.base| (store .cse87 |c_~#top~0.offset| .cse7)) |v_thr1Thread3of3ForFork0_push_~#casret~0#1.base_49| v_DerPreprocessor_45) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse84 (select .cse87 |c_~#top~0.offset|))))))))))) (forall ((v_prenex_327 (Array Int Int)) (v_prenex_323 Int) (v_prenex_324 Int) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_322 (Array Int Int)) (v_prenex_325 (Array Int Int)) (v_prenex_326 (Array Int Int)) (v_prenex_328 Int)) (let ((.cse97 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse95 (store (store .cse97 |c_~#m2~0.base| v_prenex_322) |c_~#m~0.base| v_prenex_327))) (let ((.cse96 (select .cse95 |c_~#top~0.base|))) (let ((.cse93 (select .cse96 |c_~#top~0.offset|)) (.cse91 (store (store .cse97 |c_~#m~0.base| v_prenex_325) |c_~#m2~0.base| v_prenex_322)) (.cse92 (let ((.cse94 (store .cse95 |c_~#top~0.base| (store .cse96 |c_~#top~0.offset| c_~next_alloc_idx~0)))) (store .cse94 v_prenex_323 (store (select .cse94 v_prenex_323) 0 1))))) (or (not (= (+ (select (select .cse91 v_prenex_324) 0) 1) 0)) (= (select (select .cse92 |c_~#top~0.base|) |c_~#top~0.offset|) .cse93) (not (= .cse93 (select (select .cse91 |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= (select (select .cse91 |c_~#m~0.base|) v_prenex_328) 0)) (not (= (select (select (store .cse92 v_prenex_324 v_prenex_326) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))) (forall ((v_prenex_314 Int) (v_prenex_308 (Array Int Int)) (v_prenex_310 Int) (v_DerPreprocessor_48 (Array Int Int)) (v_prenex_309 Int) (v_prenex_311 (Array Int Int)) (v_prenex_312 (Array Int Int)) (v_prenex_313 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse102 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_48))) (let ((.cse103 (store (store .cse102 |c_~#m2~0.base| v_prenex_308) |c_~#m~0.base| v_prenex_313))) (let ((.cse100 (store .cse103 v_prenex_309 v_DerPreprocessor_46))) (let ((.cse101 (select .cse100 |c_~#top~0.base|)) (.cse99 (select (select .cse103 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse98 (store (store .cse102 |c_~#m~0.base| v_prenex_311) |c_~#m2~0.base| v_prenex_308))) (or (not (= (+ (select (select .cse98 v_prenex_310) 0) 1) 0)) (= (select (select .cse98 |c_~#top~0.base|) |c_~#top~0.offset|) .cse99) (not (= (select (select (store (store .cse100 |c_~#top~0.base| (store .cse101 |c_~#top~0.offset| .cse7)) v_prenex_310 v_prenex_312) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select .cse101 |c_~#top~0.offset|) .cse99)) (not (= (select (select .cse98 |c_~#m~0.base|) v_prenex_314) 0))))))))))) .cse0)))) is different from false [2024-08-27 01:50:31,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:31,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 333724 treesize of output 333012 [2024-08-27 01:50:31,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3438 treesize of output 3338 [2024-08-27 01:50:31,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:31,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3686 treesize of output 3640 [2024-08-27 01:50:31,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:31,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3632 treesize of output 3596 [2024-08-27 01:50:31,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2006 treesize of output 1878 [2024-08-27 01:50:31,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:31,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 303 treesize of output 305 [2024-08-27 01:50:31,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 248 [2024-08-27 01:50:31,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 88 [2024-08-27 01:50:35,784 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2024-08-27 01:50:35,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 8535 treesize of output 7243 [2024-08-27 01:50:35,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:35,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5969 treesize of output 5869 [2024-08-27 01:50:35,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2853 treesize of output 2653 [2024-08-27 01:50:35,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:35,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2937 treesize of output 2851 [2024-08-27 01:50:36,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:36,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2805 treesize of output 2763 [2024-08-27 01:50:36,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:36,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 211 treesize of output 225 [2024-08-27 01:50:36,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 502 treesize of output 470 [2024-08-27 01:50:46,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:46,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 957 treesize of output 960 [2024-08-27 01:50:46,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-08-27 01:50:46,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:46,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 930 treesize of output 932 [2024-08-27 01:50:47,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:47,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 129 [2024-08-27 01:50:47,560 INFO L349 Elim1Store]: treesize reduction 3, result has 72.7 percent of original size [2024-08-27 01:50:47,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146437 treesize of output 142209 [2024-08-27 01:50:47,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:50:47,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:47,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 212 treesize of output 210 [2024-08-27 01:50:47,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:50:47,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:47,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 202 treesize of output 196 [2024-08-27 01:50:47,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 118 [2024-08-27 01:50:47,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 91 [2024-08-27 01:50:47,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 152 [2024-08-27 01:50:47,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2024-08-27 01:50:47,874 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-27 01:50:47,878 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-27 01:50:47,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 1 [2024-08-27 01:50:47,883 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-27 01:50:47,911 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2024-08-27 01:50:47,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 7122 treesize of output 6210 [2024-08-27 01:50:47,961 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-27 01:50:47,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:47,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6454 treesize of output 6282 [2024-08-27 01:50:48,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:48,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2386 treesize of output 2344 [2024-08-27 01:50:48,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:48,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2390 treesize of output 2308 [2024-08-27 01:50:48,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:50:48,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 147 [2024-08-27 01:50:48,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 942 treesize of output 910 [2024-08-27 01:50:49,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 1327 treesize of output 1325 [2024-08-27 01:50:53,607 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-08-27 01:50:53,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849274164] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:50:53,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-27 01:50:53,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 26] total 77 [2024-08-27 01:50:53,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937643253] [2024-08-27 01:50:53,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-27 01:50:53,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2024-08-27 01:50:53,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-27 01:50:53,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2024-08-27 01:50:53,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=4248, Unknown=75, NotChecked=1410, Total=6006 [2024-08-27 01:50:53,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:50:53,610 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:50:53,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 3.0128205128205128) internal successors, (235), 77 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:50:53,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:50:53,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:50:53,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:50:53,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:50:53,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:50:53,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:50:53,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:50:53,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:50:53,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:50:53,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:50:53,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:50:53,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-08-27 01:50:53,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-08-27 01:50:53,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2024-08-27 01:50:53,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:50:53,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:50:53,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-27 01:50:53,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-08-27 01:50:53,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-08-27 01:50:53,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:51:13,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-27 01:51:15,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-27 01:51:23,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-27 01:51:27,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-27 01:51:31,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-27 01:52:03,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:52:03,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:52:03,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:52:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:52:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-27 01:52:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:52:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:52:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:52:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:52:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-08-27 01:52:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:52:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-08-27 01:52:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-08-27 01:52:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-08-27 01:52:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:52:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-08-27 01:52:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-27 01:52:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-08-27 01:52:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-08-27 01:52:03,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-08-27 01:52:03,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-08-27 01:52:03,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:52:03,301 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:52:03,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:52:03,301 INFO L85 PathProgramCache]: Analyzing trace with hash 92829193, now seen corresponding path program 1 times [2024-08-27 01:52:03,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-27 01:52:03,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198365275] [2024-08-27 01:52:03,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:52:03,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-27 01:52:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:52:04,281 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 01:52:04,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-27 01:52:04,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198365275] [2024-08-27 01:52:04,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198365275] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-27 01:52:04,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225818572] [2024-08-27 01:52:04,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:52:04,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-27 01:52:04,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:52:04,284 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-27 01:52:04,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-08-27 01:52:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:52:04,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 53 conjunts are in the unsatisfiable core [2024-08-27 01:52:04,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:52:04,948 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-08-27 01:52:04,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 22 [2024-08-27 01:52:04,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-08-27 01:52:05,061 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-27 01:52:05,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2024-08-27 01:52:05,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 01:52:05,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:52:05,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:52:05,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:52:05,325 INFO L349 Elim1Store]: treesize reduction 36, result has 21.7 percent of original size [2024-08-27 01:52:05,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 42 [2024-08-27 01:52:05,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:52:05,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:52:05,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:52:05,417 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-08-27 01:52:05,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 40 [2024-08-27 01:52:05,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:52:05,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:52:05,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:52:05,704 INFO L349 Elim1Store]: treesize reduction 28, result has 39.1 percent of original size [2024-08-27 01:52:05,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 50 [2024-08-27 01:52:05,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-27 01:52:05,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:05,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2024-08-27 01:52:05,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:52:05,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:52:05,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:52:05,775 INFO L349 Elim1Store]: treesize reduction 61, result has 4.7 percent of original size [2024-08-27 01:52:05,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 36 [2024-08-27 01:52:05,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-27 01:52:06,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:52:06,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:52:06,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:52:06,116 INFO L349 Elim1Store]: treesize reduction 168, result has 21.5 percent of original size [2024-08-27 01:52:06,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 117 treesize of output 187 [2024-08-27 01:52:06,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-08-27 01:52:06,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-08-27 01:52:06,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-08-27 01:52:06,316 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-08-27 01:52:06,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-08-27 01:52:06,576 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:52:06,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:52:06,814 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-08-27 01:52:07,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:07,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 204 [2024-08-27 01:52:07,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:07,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 102 [2024-08-27 01:52:13,411 INFO L349 Elim1Store]: treesize reduction 195, result has 83.8 percent of original size [2024-08-27 01:52:13,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 14 new quantified variables, introduced 92 case distinctions, treesize of input 933 treesize of output 1651 [2024-08-27 01:52:14,077 INFO L349 Elim1Store]: treesize reduction 775, result has 15.0 percent of original size [2024-08-27 01:52:14,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 7743 treesize of output 7547 [2024-08-27 01:52:14,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:14,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 1248 treesize of output 1249 [2024-08-27 01:52:14,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1240 treesize of output 1232 [2024-08-27 01:52:15,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:15,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1232 treesize of output 1247 [2024-08-27 01:52:15,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:15,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1222 treesize of output 1213 [2024-08-27 01:52:15,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:15,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1204 treesize of output 1205 [2024-08-27 01:52:15,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1196 treesize of output 1192 [2024-08-27 01:52:15,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:15,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1192 treesize of output 1191 [2024-08-27 01:52:15,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:15,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1182 treesize of output 1185 [2024-08-27 01:52:16,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:16,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1176 treesize of output 1191 [2024-08-27 01:52:16,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:16,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1166 treesize of output 1167 [2024-08-27 01:52:16,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:16,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1158 treesize of output 1161 [2024-08-27 01:52:16,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:16,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1152 treesize of output 1155 [2024-08-27 01:52:16,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:16,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1146 treesize of output 1147 [2024-08-27 01:52:16,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:16,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1138 treesize of output 1141 [2024-08-27 01:52:17,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:17,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1132 treesize of output 1135 [2024-08-27 01:52:17,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:17,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1126 treesize of output 1125 [2024-08-27 01:52:17,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:17,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1116 treesize of output 1117 [2024-08-27 01:52:17,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:17,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1108 treesize of output 1123 [2024-08-27 01:52:17,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:17,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1098 treesize of output 1097 [2024-08-27 01:52:18,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:52:18,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1088 treesize of output 1089 [2024-08-27 01:54:16,816 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-08-27 01:54:16,817 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-08-27 01:54:16,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2024-08-27 01:54:16,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-08-27 01:54:17,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-08-27 01:54:17,023 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:287) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:519) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:609) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2024-08-27 01:54:17,027 INFO L158 Benchmark]: Toolchain (without parser) took 384568.74ms. Allocated memory was 205.5MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 131.2MB in the beginning and 781.2MB in the end (delta: -650.1MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-08-27 01:54:17,027 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 123.7MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-27 01:54:17,027 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 205.5MB. Free memory is still 179.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-27 01:54:17,028 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.26ms. Allocated memory is still 205.5MB. Free memory was 130.9MB in the beginning and 106.6MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-08-27 01:54:17,028 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.93ms. Allocated memory is still 205.5MB. Free memory was 106.6MB in the beginning and 103.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-27 01:54:17,028 INFO L158 Benchmark]: Boogie Preprocessor took 38.40ms. Allocated memory is still 205.5MB. Free memory was 103.9MB in the beginning and 101.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-27 01:54:17,028 INFO L158 Benchmark]: RCFGBuilder took 722.07ms. Allocated memory is still 205.5MB. Free memory was 101.8MB in the beginning and 158.3MB in the end (delta: -56.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-08-27 01:54:17,028 INFO L158 Benchmark]: TraceAbstraction took 383329.15ms. Allocated memory was 205.5MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 157.2MB in the beginning and 781.2MB in the end (delta: -624.0MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-08-27 01:54:17,028 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 123.7MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 205.5MB. Free memory is still 179.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.26ms. Allocated memory is still 205.5MB. Free memory was 130.9MB in the beginning and 106.6MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.93ms. Allocated memory is still 205.5MB. Free memory was 106.6MB in the beginning and 103.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.40ms. Allocated memory is still 205.5MB. Free memory was 103.9MB in the beginning and 101.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 722.07ms. Allocated memory is still 205.5MB. Free memory was 101.8MB in the beginning and 158.3MB in the end (delta: -56.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 383329.15ms. Allocated memory was 205.5MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 157.2MB in the beginning and 781.2MB in the end (delta: -624.0MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 639, independent: 567, independent conditional: 173, independent unconditional: 394, dependent: 72, dependent conditional: 54, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 173, independent unconditional: 394, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 173, independent unconditional: 394, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 585, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 301, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 301, independent: 272, independent conditional: 0, independent unconditional: 272, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 29, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 145, independent: 76, independent conditional: 0, independent unconditional: 76, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 585, independent: 284, independent conditional: 0, independent unconditional: 284, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 301, unknown conditional: 0, unknown unconditional: 301] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 283, Positive conditional cache size: 0, Positive unconditional cache size: 283, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 54 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 74, Number of trivial persistent sets: 62, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 412, independent: 394, independent conditional: 0, independent unconditional: 394, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 639, independent: 567, independent conditional: 173, independent unconditional: 394, dependent: 72, dependent conditional: 54, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 173, independent unconditional: 394, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 173, independent unconditional: 394, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 585, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 585, independent: 567, independent conditional: 0, independent unconditional: 567, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 301, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 301, independent: 272, independent conditional: 0, independent unconditional: 272, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 29, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 145, independent: 76, independent conditional: 0, independent unconditional: 76, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 585, independent: 284, independent conditional: 0, independent unconditional: 284, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 301, unknown conditional: 0, unknown unconditional: 301] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 283, Positive conditional cache size: 0, Positive unconditional cache size: 283, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 54 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 312, independent: 298, independent conditional: 44, independent unconditional: 254, dependent: 14, dependent conditional: 10, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 44, independent unconditional: 254, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 44, independent unconditional: 254, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 302, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 200, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 200, independent: 190, independent conditional: 0, independent unconditional: 190, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 302, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 200, unknown conditional: 0, unknown unconditional: 200] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 196, Positive conditional cache size: 0, Positive unconditional cache size: 196, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 10 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.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: 0, independent unconditional: 298, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 302, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 302, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 200, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 200, independent: 190, independent conditional: 0, independent unconditional: 190, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 302, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 200, unknown conditional: 0, unknown unconditional: 200] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 196, Positive conditional cache size: 0, Positive unconditional cache size: 196, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 10 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2150, independent: 2035, independent conditional: 620, independent unconditional: 1415, dependent: 115, dependent conditional: 72, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2085, independent: 2035, independent conditional: 620, independent unconditional: 1415, dependent: 50, dependent conditional: 7, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2085, independent: 2035, independent conditional: 620, independent unconditional: 1415, dependent: 50, dependent conditional: 7, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2110, independent: 2035, independent conditional: 1, independent unconditional: 2034, dependent: 75, dependent conditional: 24, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2110, independent: 2035, independent conditional: 1, independent unconditional: 2034, dependent: 75, dependent conditional: 14, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2110, independent: 2035, independent conditional: 1, independent unconditional: 2034, dependent: 75, dependent conditional: 14, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1205, independent: 1154, independent conditional: 1, independent unconditional: 1153, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1205, independent: 1108, independent conditional: 0, independent unconditional: 1108, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 97, independent: 46, independent conditional: 1, independent unconditional: 45, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 46, independent conditional: 1, independent unconditional: 45, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 284, independent: 123, independent conditional: 3, independent unconditional: 120, dependent: 160, dependent conditional: 62, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2110, independent: 881, independent conditional: 0, independent unconditional: 881, dependent: 24, dependent conditional: 6, dependent unconditional: 18, unknown: 1205, unknown conditional: 9, unknown unconditional: 1196] , Statistics on independence cache: Total cache size (in pairs): 1205, Positive cache size: 1154, Positive conditional cache size: 1, Positive unconditional cache size: 1153, Negative cache size: 51, Negative conditional cache size: 8, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 5, Independence queries for same thread: 65 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 69, Number of trivial persistent sets: 57, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1458, independent: 1415, independent conditional: 0, independent unconditional: 1415, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2150, independent: 2035, independent conditional: 620, independent unconditional: 1415, dependent: 115, dependent conditional: 72, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2085, independent: 2035, independent conditional: 620, independent unconditional: 1415, dependent: 50, dependent conditional: 7, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2085, independent: 2035, independent conditional: 620, independent unconditional: 1415, dependent: 50, dependent conditional: 7, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2110, independent: 2035, independent conditional: 1, independent unconditional: 2034, dependent: 75, dependent conditional: 24, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2110, independent: 2035, independent conditional: 1, independent unconditional: 2034, dependent: 75, dependent conditional: 14, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2110, independent: 2035, independent conditional: 1, independent unconditional: 2034, dependent: 75, dependent conditional: 14, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1205, independent: 1154, independent conditional: 1, independent unconditional: 1153, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1205, independent: 1108, independent conditional: 0, independent unconditional: 1108, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 97, independent: 46, independent conditional: 1, independent unconditional: 45, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 46, independent conditional: 1, independent unconditional: 45, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 284, independent: 123, independent conditional: 3, independent unconditional: 120, dependent: 160, dependent conditional: 62, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2110, independent: 881, independent conditional: 0, independent unconditional: 881, dependent: 24, dependent conditional: 6, dependent unconditional: 18, unknown: 1205, unknown conditional: 9, unknown unconditional: 1196] , Statistics on independence cache: Total cache size (in pairs): 1205, Positive cache size: 1154, Positive conditional cache size: 1, Positive unconditional cache size: 1153, Negative cache size: 51, Negative conditional cache size: 8, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 5, Independence queries for same thread: 65 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-08-27 01:54:17,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Ended with exit code 0 [2024-08-27 01:54:17,268 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-08-27 01:54:17,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2024-08-27 01:54:17,670 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-08-20_10-08-36.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.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.goblint-eval-da67795-m [2024-08-27 01:54:19,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-27 01:54:19,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-08-27 01:54:19,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-27 01:54:19,888 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-27 01:54:19,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-27 01:54:19,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-27 01:54:19,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-27 01:54:19,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-27 01:54:19,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-27 01:54:19,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-27 01:54:19,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-27 01:54:19,908 INFO L153 SettingsManager]: * Use SBE=true [2024-08-27 01:54:19,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-27 01:54:19,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-27 01:54:19,909 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-27 01:54:19,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-27 01:54:19,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-27 01:54:19,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-27 01:54:19,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-27 01:54:19,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-27 01:54:19,913 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-27 01:54:19,915 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-27 01:54:19,916 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-27 01:54:19,916 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-27 01:54:19,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-27 01:54:19,916 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-27 01:54:19,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-27 01:54:19,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-27 01:54:19,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-27 01:54:19,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-27 01:54:19,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-27 01:54:19,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-27 01:54:19,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-27 01:54:19,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-27 01:54:19,918 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-27 01:54:19,918 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-27 01:54:19,918 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-27 01:54:19,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-27 01:54:19,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-27 01:54:19,918 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-27 01:54:19,919 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-27 01:54:19,919 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-27 01:54:19,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-27 01:54:19,920 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-08-27 01:54:20,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-27 01:54:20,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-27 01:54:20,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-27 01:54:20,206 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-27 01:54:20,206 INFO L274 PluginConnector]: CDTParser initialized [2024-08-27 01:54:20,208 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-08-27 01:54:21,611 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-27 01:54:21,839 INFO L384 CDTParser]: Found 1 translation units. [2024-08-27 01:54:21,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-1.i [2024-08-27 01:54:21,859 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d53454282/2fb857822fa34e379345f50dd075636e/FLAGe93e93389 [2024-08-27 01:54:21,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d53454282/2fb857822fa34e379345f50dd075636e [2024-08-27 01:54:21,878 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-27 01:54:21,879 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-27 01:54:21,880 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-20_10-08-36.files/protection-local/26_stack_cas_longest-1.yml/witness.yml [2024-08-27 01:54:21,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-27 01:54:21,928 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-27 01:54:21,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-27 01:54:21,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-27 01:54:21,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-27 01:54:21,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 01:54:21" (1/2) ... [2024-08-27 01:54:21,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6876ea13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:54:21, skipping insertion in model container [2024-08-27 01:54:21,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 01:54:21" (1/2) ... [2024-08-27 01:54:21,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@37356039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 01:54:21, skipping insertion in model container [2024-08-27 01:54:21,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 01:54:21" (2/2) ... [2024-08-27 01:54:21,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6876ea13 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:54:21, skipping insertion in model container [2024-08-27 01:54:21,938 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 01:54:21" (2/2) ... [2024-08-27 01:54:21,938 INFO L85 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-27 01:54:21,956 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-08-27 01:54:21,957 INFO L1541 ArrayList]: Location invariant before [L751-L751] (m == 0 || m == 1) && (m2 == 0 || m2 == 1) [2024-08-27 01:54:21,990 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-27 01:54:22,305 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-27 01:54:22,318 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-08-27 01:54:22,379 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-27 01:54:22,434 INFO L206 MainTranslator]: Completed translation [2024-08-27 01:54:22,434 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:54:22 WrapperNode [2024-08-27 01:54:22,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-27 01:54:22,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-27 01:54:22,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-27 01:54:22,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-27 01:54:22,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:54:22" (1/1) ... [2024-08-27 01:54:22,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:54:22" (1/1) ... [2024-08-27 01:54:22,493 INFO L138 Inliner]: procedures = 183, calls = 51, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 197 [2024-08-27 01:54:22,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-27 01:54:22,497 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-27 01:54:22,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-27 01:54:22,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-27 01:54:22,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:54:22" (1/1) ... [2024-08-27 01:54:22,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:54:22" (1/1) ... [2024-08-27 01:54:22,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:54:22" (1/1) ... [2024-08-27 01:54:22,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:54:22" (1/1) ... [2024-08-27 01:54:22,521 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:54:22" (1/1) ... [2024-08-27 01:54:22,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:54:22" (1/1) ... [2024-08-27 01:54:22,534 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:54:22" (1/1) ... [2024-08-27 01:54:22,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:54:22" (1/1) ... [2024-08-27 01:54:22,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-27 01:54:22,543 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-27 01:54:22,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-27 01:54:22,543 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-27 01:54:22,544 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:54:22" (1/1) ... [2024-08-27 01:54:22,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-27 01:54:22,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:54:22,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-08-27 01:54:22,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-08-27 01:54:22,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-08-27 01:54:22,626 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-08-27 01:54:22,627 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-08-27 01:54:22,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-08-27 01:54:22,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-27 01:54:22,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-27 01:54:22,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-27 01:54:22,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-08-27 01:54:22,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-08-27 01:54:22,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-08-27 01:54:22,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-08-27 01:54:22,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-27 01:54:22,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-27 01:54:22,628 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-08-27 01:54:22,774 INFO L242 CfgBuilder]: Building ICFG [2024-08-27 01:54:22,776 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-27 01:54:23,133 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-08-27 01:54:23,134 INFO L291 CfgBuilder]: Performing block encoding [2024-08-27 01:54:23,320 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-27 01:54:23,320 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-08-27 01:54:23,320 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 01:54:23 BoogieIcfgContainer [2024-08-27 01:54:23,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-27 01:54:23,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-27 01:54:23,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-27 01:54:23,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-27 01:54:23,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 01:54:21" (1/4) ... [2024-08-27 01:54:23,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f6582f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 01:54:23, skipping insertion in model container [2024-08-27 01:54:23,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.08 01:54:21" (2/4) ... [2024-08-27 01:54:23,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f6582f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.08 01:54:23, skipping insertion in model container [2024-08-27 01:54:23,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.08 01:54:22" (3/4) ... [2024-08-27 01:54:23,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f6582f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.08 01:54:23, skipping insertion in model container [2024-08-27 01:54:23,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 01:54:23" (4/4) ... [2024-08-27 01:54:23,328 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longest-1.i [2024-08-27 01:54:23,341 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-27 01:54:23,341 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-27 01:54:23,342 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-27 01:54:23,382 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-27 01:54:23,427 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:54:23,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 01:54:23,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:54:23,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-27 01:54:23,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-08-27 01:54:23,478 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 01:54:23,487 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-08-27 01:54:23,492 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5f9136ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:54:23,492 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-27 01:54:23,631 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:23,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:23,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1114168855, now seen corresponding path program 1 times [2024-08-27 01:54:23,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:23,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913332140] [2024-08-27 01:54:23,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:23,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:23,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:23,664 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:23,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-08-27 01:54:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:23,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2024-08-27 01:54:23,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:23,829 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:54:23,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:23,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913332140] [2024-08-27 01:54:23,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913332140] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:54:23,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:54:23,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 01:54:23,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688306222] [2024-08-27 01:54:23,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:54:23,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 01:54:23,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:23,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 01:54:23,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 01:54:23,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:23,861 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:23,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:23,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:23,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:23,916 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-08-27 01:54:24,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:24,116 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:24,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:24,117 INFO L85 PathProgramCache]: Analyzing trace with hash -148017800, now seen corresponding path program 1 times [2024-08-27 01:54:24,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:24,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785676592] [2024-08-27 01:54:24,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:24,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:24,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:24,121 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:24,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-08-27 01:54:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:24,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2024-08-27 01:54:24,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:24,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 01:54:24,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:54:24,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-08-27 01:54:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:24,427 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:54:24,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:24,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785676592] [2024-08-27 01:54:24,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785676592] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:54:24,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:54:24,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-08-27 01:54:24,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997139724] [2024-08-27 01:54:24,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:54:24,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:54:24,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:24,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:54:24,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:54:24,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:24,430 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:24,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:24,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:24,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:24,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:24,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:24,541 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-08-27 01:54:24,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:24,736 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:24,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:24,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1592448670, now seen corresponding path program 1 times [2024-08-27 01:54:24,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:24,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225162079] [2024-08-27 01:54:24,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:24,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:24,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:24,741 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:24,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-08-27 01:54:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:24,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2024-08-27 01:54:24,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:24,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-08-27 01:54:24,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-27 01:54:24,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 01:54:24,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:54:24,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-08-27 01:54:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:54:24,995 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:54:24,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:24,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225162079] [2024-08-27 01:54:24,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225162079] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:54:24,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:54:24,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 01:54:24,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673087326] [2024-08-27 01:54:24,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:54:24,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:54:24,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:24,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:54:24,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:54:24,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:24,998 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:24,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:24,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:24,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:24,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:25,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:25,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:25,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:25,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-08-27 01:54:25,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:25,374 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:25,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:25,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1754051290, now seen corresponding path program 1 times [2024-08-27 01:54:25,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:25,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259251392] [2024-08-27 01:54:25,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:25,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:25,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:25,382 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:25,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-08-27 01:54:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:25,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-27 01:54:25,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:25,545 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:54:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:25,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:25,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259251392] [2024-08-27 01:54:25,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259251392] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:54:25,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:54:25,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-08-27 01:54:25,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133558077] [2024-08-27 01:54:25,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:54:25,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-27 01:54:25,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:25,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-27 01:54:25,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-08-27 01:54:25,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:25,608 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:25,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:25,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:25,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:25,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:25,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:25,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:25,687 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-08-27 01:54:25,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:25,883 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:25,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:25,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2130591545, now seen corresponding path program 1 times [2024-08-27 01:54:25,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:25,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257749906] [2024-08-27 01:54:25,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:25,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:25,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:25,887 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:25,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-08-27 01:54:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:26,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 12 conjunts are in the unsatisfiable core [2024-08-27 01:54:26,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:26,089 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 01:54:26,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 13 treesize of output 13 [2024-08-27 01:54:26,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:54:26,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:54:26,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:26,241 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:54:26,320 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))) (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~newTop~0#1|)) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_4) |c_~#top~0.base|) |c_~#top~0.offset|)))))))) is different from false [2024-08-27 01:54:26,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:26,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-08-27 01:54:26,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-08-27 01:54:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:26,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:26,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257749906] [2024-08-27 01:54:26,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257749906] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:54:26,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:54:26,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-08-27 01:54:26,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039435459] [2024-08-27 01:54:26,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:54:26,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-08-27 01:54:26,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:26,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-08-27 01:54:26,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2024-08-27 01:54:26,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:26,518 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:26,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:26,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:26,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:26,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:26,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:26,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:26,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:26,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:26,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:26,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:26,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:54:26,895 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 1 remaining) [2024-08-27 01:54:26,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-08-27 01:54:27,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:27,100 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-08-27 01:54:27,101 INFO L308 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-08-27 01:54:27,104 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:54:27,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 01:54:27,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:54:27,109 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-27 01:54:27,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2024-08-27 01:54:27,115 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 01:54:27,115 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-27 01:54:27,116 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5f9136ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:54:27,116 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-27 01:54:27,173 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:54:27,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:27,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1614565434, now seen corresponding path program 1 times [2024-08-27 01:54:27,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:27,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935464801] [2024-08-27 01:54:27,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:27,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:27,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:27,177 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:27,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 (9)] Waiting until timeout for monitored process [2024-08-27 01:54:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:27,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2024-08-27 01:54:27,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:27,278 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:54:27,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:27,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935464801] [2024-08-27 01:54:27,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935464801] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:54:27,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:54:27,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 01:54:27,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143384012] [2024-08-27 01:54:27,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:54:27,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 01:54:27,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:27,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 01:54:27,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 01:54:27,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:27,283 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:27,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:27,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:27,318 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 (9)] Forceful destruction successful, exit code 0 [2024-08-27 01:54:27,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:27,513 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:54:27,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:27,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1917162261, now seen corresponding path program 1 times [2024-08-27 01:54:27,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:27,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297285158] [2024-08-27 01:54:27,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:27,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:27,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:27,519 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:27,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-08-27 01:54:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 01:54:27,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-27 01:54:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 01:54:27,671 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-27 01:54:27,671 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-27 01:54:27,671 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-27 01:54:27,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-08-27 01:54:27,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:27,873 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-08-27 01:54:27,873 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-08-27 01:54:27,874 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-27 01:54:27,874 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-08-27 01:54:27,937 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-27 01:54:27,940 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:54:27,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 01:54:27,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:54:27,943 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-27 01:54:27,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2024-08-27 01:54:27,948 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 01:54:27,948 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-27 01:54:27,949 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5f9136ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:54:27,949 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-27 01:54:28,259 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:54:28,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:28,260 INFO L85 PathProgramCache]: Analyzing trace with hash -826269901, now seen corresponding path program 1 times [2024-08-27 01:54:28,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:28,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803036412] [2024-08-27 01:54:28,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:28,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:28,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:28,264 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:28,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-08-27 01:54:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:28,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjunts are in the unsatisfiable core [2024-08-27 01:54:28,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:54:28,373 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:54:28,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:28,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803036412] [2024-08-27 01:54:28,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803036412] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:54:28,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:54:28,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 01:54:28,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748627539] [2024-08-27 01:54:28,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:54:28,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 01:54:28,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:28,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 01:54:28,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 01:54:28,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:28,375 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:28,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:28,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:28,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:28,436 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-08-27 01:54:28,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:28,634 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:54:28,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:28,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1039106021, now seen corresponding path program 1 times [2024-08-27 01:54:28,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:28,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623058880] [2024-08-27 01:54:28,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:28,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:28,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:28,636 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:28,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-08-27 01:54:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:28,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjunts are in the unsatisfiable core [2024-08-27 01:54:28,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:28,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 01:54:28,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:54:28,761 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:54:28,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:28,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623058880] [2024-08-27 01:54:28,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623058880] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:54:28,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:54:28,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 01:54:28,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321095775] [2024-08-27 01:54:28,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:54:28,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-27 01:54:28,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:28,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-27 01:54:28,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-27 01:54:28,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:28,763 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:28,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:28,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:28,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:30,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:54:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:30,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:30,897 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-08-27 01:54:31,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:31,093 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:54:31,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:31,094 INFO L85 PathProgramCache]: Analyzing trace with hash -210511263, now seen corresponding path program 1 times [2024-08-27 01:54:31,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:31,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859188204] [2024-08-27 01:54:31,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:31,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:31,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:31,097 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:31,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-08-27 01:54:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:31,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2024-08-27 01:54:31,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:31,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 01:54:31,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-08-27 01:54:31,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-08-27 01:54:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:31,431 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:54:31,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:31,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2024-08-27 01:54:31,569 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-08-27 01:54:31,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:31,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-08-27 01:54:31,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-08-27 01:54:31,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:31,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2024-08-27 01:54:31,664 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-27 01:54:31,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-08-27 01:54:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-08-27 01:54:31,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:31,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859188204] [2024-08-27 01:54:31,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859188204] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:54:31,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:54:31,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-08-27 01:54:31,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27579122] [2024-08-27 01:54:31,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:54:31,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-27 01:54:31,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:31,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-27 01:54:31,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=94, Unknown=1, NotChecked=20, Total=156 [2024-08-27 01:54:31,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:31,768 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:31,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:31,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:31,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:31,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:34,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:54:34,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:34,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:34,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:34,090 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-08-27 01:54:34,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:34,287 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:54:34,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:34,287 INFO L85 PathProgramCache]: Analyzing trace with hash -240740414, now seen corresponding path program 1 times [2024-08-27 01:54:34,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:34,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357446537] [2024-08-27 01:54:34,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:34,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:34,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:34,290 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:34,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-08-27 01:54:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:34,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2024-08-27 01:54:34,406 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:34,457 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-08-27 01:54:34,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2024-08-27 01:54:34,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-08-27 01:54:34,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-08-27 01:54:34,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2024-08-27 01:54:34,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-27 01:54:34,517 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 01:54:34,517 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:54:34,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:34,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357446537] [2024-08-27 01:54:34,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357446537] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:54:34,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:54:34,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 01:54:34,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160607627] [2024-08-27 01:54:34,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:54:34,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:54:34,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:34,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:54:34,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:54:34,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:34,519 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:34,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:34,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:34,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:34,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:34,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:34,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:34,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:34,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:34,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:34,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-08-27 01:54:34,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:34,947 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:54:34,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:34,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1541764542, now seen corresponding path program 1 times [2024-08-27 01:54:34,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:34,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215939078] [2024-08-27 01:54:34,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:34,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:34,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:34,951 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:34,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-08-27 01:54:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:35,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-27 01:54:35,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:35,089 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:54:35,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:35,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:35,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215939078] [2024-08-27 01:54:35,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215939078] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:54:35,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:54:35,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-08-27 01:54:35,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521177195] [2024-08-27 01:54:35,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:54:35,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-27 01:54:35,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:35,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-27 01:54:35,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-08-27 01:54:35,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:35,163 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:35,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:35,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:35,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:35,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:35,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:35,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:35,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:35,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:35,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:35,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:35,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:35,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-08-27 01:54:35,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:35,464 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:54:35,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:35,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2137440580, now seen corresponding path program 1 times [2024-08-27 01:54:35,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:35,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132768202] [2024-08-27 01:54:35,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:35,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:35,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:35,468 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:35,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-08-27 01:54:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:35,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjunts are in the unsatisfiable core [2024-08-27 01:54:35,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:35,708 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 01:54:35,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 13 treesize of output 13 [2024-08-27 01:54:35,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:54:35,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:54:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:35,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:54:35,982 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_thr1Thread1of2ForFork0_push_~oldTop~0#1| (select .cse0 |c_~#top~0.offset|)))) (and (or (forall ((v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |c_thr1Thread1of2ForFork0_push_~newTop~0#1|)) |c_thr1Thread1of2ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_10) |c_~#top~0.base|) |c_~#top~0.offset|)))) (not .cse1)) (or .cse1 (forall ((v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_9) |c_~#top~0.base|) |c_~#top~0.offset|)))))))) is different from false [2024-08-27 01:54:36,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:36,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-08-27 01:54:36,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-08-27 01:54:36,194 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:36,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:36,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132768202] [2024-08-27 01:54:36,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132768202] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:54:36,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:54:36,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-08-27 01:54:36,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823295520] [2024-08-27 01:54:36,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:54:36,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-08-27 01:54:36,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:36,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-08-27 01:54:36,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-08-27 01:54:36,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:36,196 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:36,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:36,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:36,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:36,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:36,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:36,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:36,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:54:36,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-08-27 01:54:37,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:37,002 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:54:37,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:37,002 INFO L85 PathProgramCache]: Analyzing trace with hash 460945972, now seen corresponding path program 2 times [2024-08-27 01:54:37,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:37,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367427468] [2024-08-27 01:54:37,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 01:54:37,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:37,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:37,004 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:37,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-08-27 01:54:37,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-27 01:54:37,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 01:54:37,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjunts are in the unsatisfiable core [2024-08-27 01:54:37,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:37,248 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 01:54:37,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-08-27 01:54:37,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:54:37,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:54:37,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:54:37,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:54:37,494 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:37,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:54:37,510 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_363) |c_~#top~0.base|) |c_~#top~0.offset|)))) is different from false [2024-08-27 01:54:37,553 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of2ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#m~0.base| v_ArrVal_363) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread1of2ForFork0_push_~newTop~0#1|)) |c_thr1Thread1of2ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#m~0.base| v_ArrVal_363) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))) (not .cse0))))) is different from false [2024-08-27 01:54:37,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:37,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-08-27 01:54:37,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2024-08-27 01:54:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:37,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:37,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367427468] [2024-08-27 01:54:37,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367427468] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:54:37,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:54:37,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-08-27 01:54:37,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161404736] [2024-08-27 01:54:37,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:54:37,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-08-27 01:54:37,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:37,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-08-27 01:54:37,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=150, Unknown=2, NotChecked=50, Total=240 [2024-08-27 01:54:37,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:37,823 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:37,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:37,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:37,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:37,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:37,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:37,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:37,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:54:37,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:40,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:54:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-27 01:54:40,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-27 01:54:40,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-08-27 01:54:40,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:40,433 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-27 01:54:40,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:40,433 INFO L85 PathProgramCache]: Analyzing trace with hash -956094227, now seen corresponding path program 1 times [2024-08-27 01:54:40,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:40,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703647782] [2024-08-27 01:54:40,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:40,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:40,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:40,436 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:40,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-08-27 01:54:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 01:54:40,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-27 01:54:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-27 01:54:40,679 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-27 01:54:40,679 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-27 01:54:40,679 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-27 01:54:40,690 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-08-27 01:54:40,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:40,882 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-08-27 01:54:40,883 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-08-27 01:54:40,883 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-27 01:54:40,883 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-08-27 01:54:40,955 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-27 01:54:40,957 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:54:40,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-27 01:54:40,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-27 01:54:40,959 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-27 01:54:40,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (20)] Waiting until timeout for monitored process [2024-08-27 01:54:40,962 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-27 01:54:40,962 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-08-27 01:54:40,962 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5f9136ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-27 01:54:40,962 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-27 01:54:41,515 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:41,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:41,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2126375043, now seen corresponding path program 1 times [2024-08-27 01:54:41,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:41,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825544358] [2024-08-27 01:54:41,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:41,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:41,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:41,519 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:41,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-08-27 01:54:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:41,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2024-08-27 01:54:41,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-27 01:54:41,656 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:54:41,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:41,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825544358] [2024-08-27 01:54:41,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825544358] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:54:41,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:54:41,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-27 01:54:41,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881813196] [2024-08-27 01:54:41,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:54:41,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-27 01:54:41,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:41,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-27 01:54:41,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-27 01:54:41,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:41,657 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:41,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:41,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:41,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:41,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-08-27 01:54:41,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:41,948 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:41,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:41,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1980207569, now seen corresponding path program 1 times [2024-08-27 01:54:41,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:41,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821470082] [2024-08-27 01:54:41,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:41,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:41,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:41,952 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:41,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-08-27 01:54:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:42,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2024-08-27 01:54:42,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:42,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 01:54:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-27 01:54:42,105 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:54:42,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:42,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821470082] [2024-08-27 01:54:42,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821470082] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:54:42,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:54:42,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 01:54:42,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129715940] [2024-08-27 01:54:42,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:54:42,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-08-27 01:54:42,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:42,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-08-27 01:54:42,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-08-27 01:54:42,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:42,107 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:42,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:42,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:42,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:44,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:54:46,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:54:48,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:54:50,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:54:50,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:50,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:50,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-08-27 01:54:50,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:50,758 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:50,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:50,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1145783191, now seen corresponding path program 1 times [2024-08-27 01:54:50,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:50,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863545705] [2024-08-27 01:54:50,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:50,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:50,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:50,762 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:50,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-08-27 01:54:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:50,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2024-08-27 01:54:50,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-27 01:54:50,967 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:54:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-27 01:54:51,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:51,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863545705] [2024-08-27 01:54:51,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863545705] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:54:51,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:54:51,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-08-27 01:54:51,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525533594] [2024-08-27 01:54:51,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:54:51,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-27 01:54:51,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:51,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-27 01:54:51,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-08-27 01:54:51,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:51,039 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:51,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:51,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:51,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:51,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:51,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:51,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:51,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:51,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-08-27 01:54:51,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:51,427 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:51,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:51,428 INFO L85 PathProgramCache]: Analyzing trace with hash 455569771, now seen corresponding path program 1 times [2024-08-27 01:54:51,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:51,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590376130] [2024-08-27 01:54:51,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:51,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:51,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:51,431 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:51,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-08-27 01:54:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:51,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjunts are in the unsatisfiable core [2024-08-27 01:54:51,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:51,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-08-27 01:54:51,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-27 01:54:51,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 01:54:51,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:54:51,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-08-27 01:54:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-27 01:54:51,670 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:54:51,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:51,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590376130] [2024-08-27 01:54:51,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1590376130] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:54:51,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:54:51,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 01:54:51,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179093550] [2024-08-27 01:54:51,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:54:51,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:54:51,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:51,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:54:51,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:54:51,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:51,672 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:51,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:51,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:51,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:51,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:51,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:51,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:51,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:51,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:51,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:51,978 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-08-27 01:54:52,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:52,172 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:52,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:52,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1522923375, now seen corresponding path program 1 times [2024-08-27 01:54:52,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:52,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40574916] [2024-08-27 01:54:52,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:52,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:52,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:52,175 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:52,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-08-27 01:54:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:52,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 15 conjunts are in the unsatisfiable core [2024-08-27 01:54:52,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:52,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 01:54:52,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:54:52,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-08-27 01:54:52,559 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-08-27 01:54:52,559 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:54:52,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:52,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2024-08-27 01:54:52,695 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m2~0.offset| (_ BitVec 32))) (or (= (select (select (store |c_#memory_int| |c_~#m2~0.base| v_arrayElimArr_14) |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select v_arrayElimArr_14 |~#m2~0.offset|))))) (or (forall ((v_ArrVal_630 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (|~#m2~0.offset| (_ BitVec 32))) (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base| (store (select (store (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_630) |c_~#top~0.base| v_DerPreprocessor_16) |c_~#m2~0.base|) |~#m2~0.offset| (_ bv0 32))) |c_~#m~0.base|) |c_~#m~0.offset|))) (not (= (_ bv0 32) c_~state~0)))) is different from false [2024-08-27 01:54:52,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:52,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2024-08-27 01:54:52,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2024-08-27 01:54:52,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 89 [2024-08-27 01:54:52,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 85 [2024-08-27 01:54:52,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:52,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-08-27 01:54:52,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-08-27 01:54:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 2 not checked. [2024-08-27 01:54:52,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:52,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40574916] [2024-08-27 01:54:52,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40574916] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:54:52,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:54:52,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-08-27 01:54:52,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954101599] [2024-08-27 01:54:52,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:54:52,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-27 01:54:52,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:52,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-27 01:54:52,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=94, Unknown=1, NotChecked=20, Total=156 [2024-08-27 01:54:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:52,891 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:52,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:52,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:52,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:52,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:52,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:52,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:53,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:53,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:53,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:53,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:53,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:53,431 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-08-27 01:54:53,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:53,627 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:53,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:53,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1452080061, now seen corresponding path program 1 times [2024-08-27 01:54:53,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:53,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938594649] [2024-08-27 01:54:53,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:53,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:53,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:53,630 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:53,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-08-27 01:54:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:53,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 5 conjunts are in the unsatisfiable core [2024-08-27 01:54:53,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:53,820 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-08-27 01:54:53,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2024-08-27 01:54:53,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-08-27 01:54:53,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:54:53,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-27 01:54:53,852 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-08-27 01:54:53,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-27 01:54:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-27 01:54:53,867 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:54:53,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:53,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938594649] [2024-08-27 01:54:53,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938594649] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:54:53,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:54:53,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 01:54:53,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36791671] [2024-08-27 01:54:53,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:54:53,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:54:53,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:53,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:54:53,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:54:53,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:53,869 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:53,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:53,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:53,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:53,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:53,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:53,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:53,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:54,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:54,240 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-08-27 01:54:54,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:54,433 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:54,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:54,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1179436776, now seen corresponding path program 1 times [2024-08-27 01:54:54,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:54,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601383659] [2024-08-27 01:54:54,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:54,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:54,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:54,437 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:54,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-08-27 01:54:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:54,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 15 conjunts are in the unsatisfiable core [2024-08-27 01:54:54,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:54,683 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 01:54:54,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-08-27 01:54:54,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:54:54,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:54:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:54:54,856 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:54:54,926 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of3ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or (forall ((v_DerPreprocessor_19 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#top~0.base|) |c_~#top~0.offset|)))) .cse0) (or (forall ((v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread1of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_18) |c_~#top~0.base|) |c_~#top~0.offset|)))) (not .cse0))))) is different from false [2024-08-27 01:54:54,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:54:54,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-08-27 01:54:54,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-08-27 01:54:55,143 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-27 01:54:55,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:55,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601383659] [2024-08-27 01:54:55,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601383659] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:54:55,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:54:55,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-08-27 01:54:55,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857542756] [2024-08-27 01:54:55,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:54:55,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-08-27 01:54:55,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:55,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-08-27 01:54:55,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-08-27 01:54:55,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:55,145 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:55,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:55,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:55,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:55,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:55,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:55,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:55,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:55,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:55,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-08-27 01:54:56,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:56,026 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:56,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:56,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1258041184, now seen corresponding path program 2 times [2024-08-27 01:54:56,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:56,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929284852] [2024-08-27 01:54:56,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 01:54:56,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-08-27 01:54:56,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:56,028 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:56,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-08-27 01:54:56,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-27 01:54:56,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 01:54:56,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 10 conjunts are in the unsatisfiable core [2024-08-27 01:54:56,228 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:56,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 01:54:56,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:54:56,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-08-27 01:54:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-27 01:54:56,441 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:54:56,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:56,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929284852] [2024-08-27 01:54:56,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929284852] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:54:56,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:54:56,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-27 01:54:56,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415592638] [2024-08-27 01:54:56,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:54:56,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:54:56,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:56,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:54:56,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:54:56,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:56,443 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:56,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:56,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:56,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:56,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:56,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:56,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:56,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:56,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:56,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:56,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:56,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:56,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:56,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:56,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:56,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:56,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:56,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:56,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2024-08-27 01:54:57,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:57,004 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:57,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:57,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1390433366, now seen corresponding path program 1 times [2024-08-27 01:54:57,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:57,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26157166] [2024-08-27 01:54:57,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:57,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:57,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:57,008 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:57,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-08-27 01:54:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:57,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjunts are in the unsatisfiable core [2024-08-27 01:54:57,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:57,303 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:54:57,474 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:57,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:57,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26157166] [2024-08-27 01:54:57,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26157166] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:54:57,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:54:57,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-08-27 01:54:57,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634614806] [2024-08-27 01:54:57,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:54:57,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-27 01:54:57,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:57,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-27 01:54:57,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-08-27 01:54:57,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:57,476 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:57,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.0) internal successors, (156), 11 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:57,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:57,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:57,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:57,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:57,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:57,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:57,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:57,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:57,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:57,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:57,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:54:57,791 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 (29)] Ended with exit code 0 [2024-08-27 01:54:57,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:57,990 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:57,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:57,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1311039028, now seen corresponding path program 1 times [2024-08-27 01:54:57,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:57,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769383944] [2024-08-27 01:54:57,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:54:57,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:57,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:57,994 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:57,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-08-27 01:54:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:54:58,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-27 01:54:58,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:54:58,453 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-08-27 01:54:58,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-08-27 01:54:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:58,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:54:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:54:58,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:54:58,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769383944] [2024-08-27 01:54:58,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769383944] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:54:58,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:54:58,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2024-08-27 01:54:58,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349804203] [2024-08-27 01:54:58,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:54:58,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-08-27 01:54:58,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:54:58,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-08-27 01:54:58,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-08-27 01:54:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:58,841 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:54:58,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.473684210526316) internal successors, (142), 18 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:54:58,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:58,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:58,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:58,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:58,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:58,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:58,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:58,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:58,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:54:58,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:54:59,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:54:59,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:54:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:54:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:54:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:54:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:54:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:54:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-08-27 01:54:59,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2024-08-27 01:54:59,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:59,899 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:54:59,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:54:59,899 INFO L85 PathProgramCache]: Analyzing trace with hash 585131588, now seen corresponding path program 2 times [2024-08-27 01:54:59,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:54:59,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802737319] [2024-08-27 01:54:59,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 01:54:59,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:54:59,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:54:59,903 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:54:59,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2024-08-27 01:55:00,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-27 01:55:00,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 01:55:00,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-27 01:55:00,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:55:00,259 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 01:55:00,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-08-27 01:55:00,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:55:00,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:55:00,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:55:00,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:55:00,574 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-27 01:55:00,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:55:00,662 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1019) |c_~#top~0.base|) |c_~#top~0.offset|)))) is different from false [2024-08-27 01:55:00,702 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_thr1Thread1of3ForFork0_push_~oldTop~0#1| (select .cse0 |c_~#top~0.offset|)))) (and (or (forall ((v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |c_thr1Thread1of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_22) |c_~#m~0.base| v_ArrVal_1019) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))) (not .cse1)) (or .cse1 (forall ((v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_1019) |c_~#top~0.base|) |c_~#top~0.offset|)))))))) is different from false [2024-08-27 01:55:00,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:55:00,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-08-27 01:55:00,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2024-08-27 01:55:01,026 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-08-27 01:55:01,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:55:01,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802737319] [2024-08-27 01:55:01,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802737319] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:55:01,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:55:01,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-08-27 01:55:01,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578271212] [2024-08-27 01:55:01,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:55:01,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-08-27 01:55:01,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:55:01,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-08-27 01:55:01,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=255, Unknown=3, NotChecked=66, Total=380 [2024-08-27 01:55:01,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:55:01,028 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:55:01,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.7) internal successors, (114), 19 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:55:01,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:55:01,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:55:01,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:01,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:01,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:55:01,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:01,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:01,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:01,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:55:01,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-08-27 01:55:01,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:55:03,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:55:06,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:55:06,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:55:06,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:55:06,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:06,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:06,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:55:06,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:06,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:06,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:06,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:55:06,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-27 01:55:06,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:06,656 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 (31)] Forceful destruction successful, exit code 0 [2024-08-27 01:55:06,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:55:06,851 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:55:06,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:55:06,851 INFO L85 PathProgramCache]: Analyzing trace with hash 741122395, now seen corresponding path program 1 times [2024-08-27 01:55:06,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:55:06,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378730257] [2024-08-27 01:55:06,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:55:06,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:55:06,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:55:06,853 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:55:06,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2024-08-27 01:55:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:55:07,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 35 conjunts are in the unsatisfiable core [2024-08-27 01:55:07,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:55:07,701 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-08-27 01:55:07,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2024-08-27 01:55:07,817 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-08-27 01:55:07,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2024-08-27 01:55:07,994 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-08-27 01:55:07,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2024-08-27 01:55:08,138 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-08-27 01:55:08,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-08-27 01:55:08,370 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-08-27 01:55:08,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 38 [2024-08-27 01:55:08,387 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-08-27 01:55:08,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 29 [2024-08-27 01:55:08,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:55:08,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:55:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:55:08,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:55:08,602 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse0 |c_~#top~0.offset|)))) (and (or (forall ((v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1101 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_23) |c_~#m~0.base| v_ArrVal_1101) |c_~#top~0.base|) |c_~#top~0.offset|)))) (not .cse1)) (or .cse1 (forall ((v_DerPreprocessor_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1101 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_24) |c_~#m~0.base| v_ArrVal_1101) |c_~#top~0.base|) |c_~#top~0.offset|)))))))) is different from false [2024-08-27 01:55:08,620 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1101 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_23) |c_~#m~0.base| v_ArrVal_1101) |c_~#top~0.base|) |c_~#top~0.offset|)))) is different from false [2024-08-27 01:55:09,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:55:09,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 752 treesize of output 747 [2024-08-27 01:55:09,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 419 treesize of output 415 [2024-08-27 01:55:09,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 415 treesize of output 407 [2024-08-27 01:55:09,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 407 treesize of output 403 [2024-08-27 01:55:09,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 403 treesize of output 401 [2024-08-27 01:55:09,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 401 treesize of output 393 [2024-08-27 01:55:09,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 393 treesize of output 389 [2024-08-27 01:55:09,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 387 [2024-08-27 01:55:09,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 387 treesize of output 385 [2024-08-27 01:55:09,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 385 treesize of output 383 [2024-08-27 01:55:09,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 383 treesize of output 379 [2024-08-27 01:55:09,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 379 treesize of output 377 [2024-08-27 01:55:09,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 377 treesize of output 373 [2024-08-27 01:55:10,248 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:55:10,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:55:10,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378730257] [2024-08-27 01:55:10,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378730257] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:55:10,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:55:10,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2024-08-27 01:55:10,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877042142] [2024-08-27 01:55:10,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:55:10,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-08-27 01:55:10,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:55:10,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-08-27 01:55:10,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=771, Unknown=28, NotChecked=118, Total=1056 [2024-08-27 01:55:10,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:55:10,250 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:55:10,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.181818181818182) internal successors, (138), 32 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:55:10,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:55:10,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:55:10,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:10,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:10,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:55:10,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:10,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:10,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:10,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:55:10,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-27 01:55:10,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:10,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:55:11,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:55:11,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:55:11,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:55:11,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:11,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:55:11,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:11,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:11,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:55:11,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:55:11,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-27 01:55:11,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:55:11,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-27 01:55:11,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2024-08-27 01:55:11,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:55:11,933 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:55:11,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:55:11,933 INFO L85 PathProgramCache]: Analyzing trace with hash -877004733, now seen corresponding path program 1 times [2024-08-27 01:55:11,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:55:11,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467869582] [2024-08-27 01:55:11,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:55:11,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:55:11,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:55:11,935 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:55:11,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2024-08-27 01:55:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:55:12,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 24 conjunts are in the unsatisfiable core [2024-08-27 01:55:12,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:55:12,240 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-08-27 01:55:12,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-08-27 01:55:12,544 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-08-27 01:55:12,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2024-08-27 01:55:12,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-08-27 01:55:12,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:55:12,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-27 01:55:12,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2024-08-27 01:55:12,696 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-08-27 01:55:12,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-08-27 01:55:14,863 INFO L349 Elim1Store]: treesize reduction 4, result has 90.2 percent of original size [2024-08-27 01:55:14,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 107 [2024-08-27 01:55:14,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2024-08-27 01:55:15,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 01:55:15,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-08-27 01:55:15,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:55:15,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:55:15,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-08-27 01:55:15,376 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:55:15,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:55:15,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:55:15,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 13 treesize of output 17 [2024-08-27 01:55:15,489 WARN L854 $PredicateComparison]: unable to prove that (forall ((|~#m~0.offset| (_ BitVec 32)) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_27 |~#m~0.offset|) (_ bv0 32))) (= (_ bv0 32) (select (select (store |c_#memory_int| |c_~#m~0.base| v_arrayElimArr_27) |c_~#m2~0.base|) |c_~#m2~0.offset|)))) is different from false [2024-08-27 01:55:15,859 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-08-27 01:55:15,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 40 [2024-08-27 01:55:15,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 120 [2024-08-27 01:55:15,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-08-27 01:55:15,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:55:15,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2024-08-27 01:55:16,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:55:16,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 318 treesize of output 311 [2024-08-27 01:55:16,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 138 [2024-08-27 01:55:16,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2024-08-27 01:55:16,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:55:16,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 318 treesize of output 311 [2024-08-27 01:55:16,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 138 [2024-08-27 01:55:16,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2024-08-27 01:55:16,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:55:16,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 238 treesize of output 233 [2024-08-27 01:55:16,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 138 [2024-08-27 01:55:16,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2024-08-27 01:56:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:56:07,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:56:07,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467869582] [2024-08-27 01:56:07,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467869582] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:56:07,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:56:07,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2024-08-27 01:56:07,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87517515] [2024-08-27 01:56:07,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:56:07,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-08-27 01:56:07,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:56:07,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-08-27 01:56:07,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=371, Unknown=21, NotChecked=40, Total=506 [2024-08-27 01:56:07,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:56:07,068 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:56:07,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.818181818181818) internal successors, (128), 22 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:56:07,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:56:07,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:56:07,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:07,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:07,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:56:07,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:07,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:07,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:07,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:56:07,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-27 01:56:07,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:07,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-27 01:56:07,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:56:13,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:56:13,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:56:13,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:13,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:13,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:56:13,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:13,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:13,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:13,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:56:13,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-27 01:56:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:56:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-27 01:56:13,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2024-08-27 01:56:13,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:56:13,501 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:56:13,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:56:13,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1897379409, now seen corresponding path program 1 times [2024-08-27 01:56:13,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:56:13,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721941855] [2024-08-27 01:56:13,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:56:13,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:56:13,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:56:13,509 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:56:13,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2024-08-27 01:56:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:56:13,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2024-08-27 01:56:13,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:56:13,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-08-27 01:56:13,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-27 01:56:13,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 01:56:13,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:56:13,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-08-27 01:56:13,870 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-08-27 01:56:13,870 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:56:13,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:56:13,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721941855] [2024-08-27 01:56:13,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721941855] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:56:13,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:56:13,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-27 01:56:13,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28214999] [2024-08-27 01:56:13,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:56:13,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-27 01:56:13,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:56:13,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-27 01:56:13,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-27 01:56:13,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:56:13,872 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:56:13,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:56:13,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:56:13,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:56:13,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:13,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:13,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:56:13,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:13,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:13,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:13,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-27 01:56:13,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-27 01:56:13,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:13,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:56:13,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-27 01:56:13,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:56:14,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:56:14,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:56:14,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:14,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:14,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:56:14,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:14,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:14,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:14,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:56:14,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-08-27 01:56:14,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:14,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:56:14,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-27 01:56:14,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:14,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2024-08-27 01:56:14,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:56:14,826 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:56:14,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:56:14,826 INFO L85 PathProgramCache]: Analyzing trace with hash -460996992, now seen corresponding path program 1 times [2024-08-27 01:56:14,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:56:14,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927628064] [2024-08-27 01:56:14,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:56:14,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:56:14,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:56:14,829 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:56:14,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2024-08-27 01:56:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:56:15,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-27 01:56:15,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:56:15,607 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-08-27 01:56:15,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-08-27 01:56:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:56:15,645 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:56:16,055 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:56:16,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:56:16,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927628064] [2024-08-27 01:56:16,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927628064] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:56:16,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:56:16,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2024-08-27 01:56:16,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065928316] [2024-08-27 01:56:16,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:56:16,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-08-27 01:56:16,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:56:16,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-08-27 01:56:16,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=338, Unknown=1, NotChecked=0, Total=420 [2024-08-27 01:56:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:56:16,057 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:56:16,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.761904761904762) internal successors, (163), 20 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:56:16,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:56:16,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:56:16,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:16,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:16,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:56:16,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:16,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:16,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:16,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:56:16,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-08-27 01:56:16,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:16,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:56:16,058 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-27 01:56:16,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:16,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:56:18,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:56:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:56:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:56:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:56:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:56:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:56:18,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-08-27 01:56:18,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:18,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-27 01:56:18,382 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-08-27 01:56:18,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:56:18,576 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:56:18,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:56:18,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1192799301, now seen corresponding path program 1 times [2024-08-27 01:56:18,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:56:18,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891504651] [2024-08-27 01:56:18,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:56:18,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:56:18,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:56:18,578 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:56:18,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2024-08-27 01:56:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:56:18,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 12 conjunts are in the unsatisfiable core [2024-08-27 01:56:18,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:56:19,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 01:56:19,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:56:19,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-08-27 01:56:19,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-08-27 01:56:19,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2024-08-27 01:56:19,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:56:19,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-27 01:56:19,072 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-08-27 01:56:19,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 20 [2024-08-27 01:56:19,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:56:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 01:56:19,121 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-27 01:56:19,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:56:19,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891504651] [2024-08-27 01:56:19,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891504651] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-27 01:56:19,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-27 01:56:19,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-08-27 01:56:19,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316184131] [2024-08-27 01:56:19,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-27 01:56:19,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-27 01:56:19,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:56:19,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-27 01:56:19,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-08-27 01:56:19,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:56:19,122 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:56:19,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:56:19,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:56:19,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:56:19,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:19,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:19,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:56:19,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:19,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:19,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:19,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:56:19,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:56:19,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:19,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:56:19,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-08-27 01:56:19,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:19,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-27 01:56:19,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:56:20,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:56:20,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:56:20,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:20,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:20,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:56:20,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:20,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:20,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:20,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:56:20,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:56:20,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:20,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:56:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-08-27 01:56:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:56:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-27 01:56:20,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Ended with exit code 0 [2024-08-27 01:56:20,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:56:20,440 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:56:20,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:56:20,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1349471029, now seen corresponding path program 1 times [2024-08-27 01:56:20,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:56:20,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777356944] [2024-08-27 01:56:20,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-27 01:56:20,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:56:20,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:56:20,444 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:56:20,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 (37)] Waiting until timeout for monitored process [2024-08-27 01:56:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-27 01:56:20,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 27 conjunts are in the unsatisfiable core [2024-08-27 01:56:20,688 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:56:20,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-08-27 01:56:21,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-08-27 01:56:21,146 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-08-27 01:56:21,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-08-27 01:56:21,195 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 01:56:21,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-08-27 01:56:21,251 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:56:21,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-08-27 01:56:21,341 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-08-27 01:56:21,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 35 [2024-08-27 01:56:21,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2024-08-27 01:56:21,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-08-27 01:56:21,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-08-27 01:56:21,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:56:21,885 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-27 01:56:21,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 51 [2024-08-27 01:56:21,926 INFO L349 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2024-08-27 01:56:21,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 56 [2024-08-27 01:56:21,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2024-08-27 01:56:21,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-27 01:56:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-27 01:56:22,003 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:56:22,057 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_38) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)))) (or (forall ((v_ArrVal_1487 (_ BitVec 32)) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_1487)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_39) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) (not .cse0))))) is different from false [2024-08-27 01:56:23,845 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-27 01:56:23,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:56:23,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2024-08-27 01:56:23,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-08-27 01:56:23,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:56:23,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2024-08-27 01:56:23,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 196 [2024-08-27 01:56:23,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:56:23,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 75 [2024-08-27 01:56:23,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-08-27 01:56:24,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-08-27 01:56:24,369 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-08-27 01:56:24,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:56:24,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777356944] [2024-08-27 01:56:24,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777356944] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:56:24,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:56:24,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2024-08-27 01:56:24,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237951320] [2024-08-27 01:56:24,369 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:56:24,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-08-27 01:56:24,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:56:24,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-08-27 01:56:24,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=686, Unknown=29, NotChecked=54, Total=870 [2024-08-27 01:56:24,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:56:24,372 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:56:24,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.866666666666666) internal successors, (146), 29 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:56:24,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:56:24,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:56:24,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:24,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:24,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:56:24,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:24,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:24,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:24,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:56:24,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:56:24,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:24,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:56:24,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-08-27 01:56:24,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:24,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:56:24,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-27 01:56:24,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:56:30,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 01:56:31,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:56:31,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:56:31,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:31,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:31,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:56:31,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:56:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:56:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:56:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-08-27 01:56:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:56:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-27 01:56:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-08-27 01:56:31,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2024-08-27 01:56:31,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:56:31,708 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:56:31,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:56:31,708 INFO L85 PathProgramCache]: Analyzing trace with hash 116354577, now seen corresponding path program 2 times [2024-08-27 01:56:31,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:56:31,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254956331] [2024-08-27 01:56:31,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 01:56:31,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:56:31,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:56:31,712 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:56:31,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2024-08-27 01:56:31,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-27 01:56:31,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 01:56:31,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 24 conjunts are in the unsatisfiable core [2024-08-27 01:56:31,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 01:56:32,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-08-27 01:56:32,347 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-08-27 01:56:32,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-08-27 01:56:32,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-08-27 01:56:32,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-27 01:56:32,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-08-27 01:56:32,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-27 01:56:32,482 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2024-08-27 01:56:32,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 51 [2024-08-27 01:56:32,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:56:32,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-27 01:56:32,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-08-27 01:56:32,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-27 01:56:32,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:56:32,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-08-27 01:56:32,709 INFO L349 Elim1Store]: treesize reduction 37, result has 28.8 percent of original size [2024-08-27 01:56:32,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 26 [2024-08-27 01:56:32,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2024-08-27 01:56:32,968 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-27 01:56:32,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 01:56:33,136 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (and (or (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse0) (or (not .cse0) (forall ((v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)))))) is different from false [2024-08-27 01:56:33,158 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (and (or (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse0) (or (not .cse0) (forall ((v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)))))) (= (_ bv1 32) |c_thr1Thread2of3ForFork0_push_#t~mem13#1|)) is different from false [2024-08-27 01:56:33,507 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse6 (= |c_thr1Thread3of3ForFork0_push_~oldTop~0#1| (select .cse5 |c_~#top~0.offset|)))) (let ((.cse0 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (.cse1 (not .cse6))) (and (or .cse0 (and (or .cse1 (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse3 (store (select .cse4 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse2 (store .cse4 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse3))) (or (= (select (select .cse2 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32)) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)))))))) (or .cse6 (forall ((v_DerPreprocessor_55 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse7 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_55))) (or (= (_ bv1 32) (select (select .cse7 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (select (select (store (store .cse7 |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32)))))))) (or (not .cse0) (and (or (forall ((|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_52 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_52))) (or (= (_ bv1 32) (select (select .cse8 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (= (select (select (store .cse8 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (_ bv1 32))))) .cse6) (or (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| v_DerPreprocessor_53)))) (store .cse10 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse10 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))))) (or (= (_ bv1 32) (select (select (store .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse9 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53))))) .cse1))))))) is different from false [2024-08-27 01:56:34,357 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-08-27 01:56:55,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-27 01:56:55,238 INFO L349 Elim1Store]: treesize reduction 49, result has 40.2 percent of original size [2024-08-27 01:56:55,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 21470 treesize of output 18804 [2024-08-27 01:56:55,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:56:55,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 179 [2024-08-27 01:56:55,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 169 [2024-08-27 01:56:55,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-27 01:56:55,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-08-27 01:56:55,595 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-08-27 01:56:55,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 51 [2024-08-27 01:56:55,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 01:56:55,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 43 [2024-08-27 01:56:55,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 142 [2024-08-27 01:56:55,774 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-27 01:56:55,880 INFO L349 Elim1Store]: treesize reduction 50, result has 39.0 percent of original size [2024-08-27 01:56:55,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 10927 treesize of output 10522 [2024-08-27 01:56:56,003 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-27 01:56:56,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 876 treesize of output 858 [2024-08-27 01:56:56,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 690 treesize of output 668 [2024-08-27 01:56:56,097 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-08-27 01:56:56,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 355 treesize of output 339 [2024-08-27 01:56:56,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 86 [2024-08-27 01:56:56,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 78 [2024-08-27 01:56:56,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-08-27 01:56:58,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-08-27 01:56:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 1 times theorem prover too weak. 3 trivial. 2 not checked. [2024-08-27 01:56:59,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 01:56:59,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254956331] [2024-08-27 01:56:59,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254956331] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 01:56:59,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 01:56:59,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-08-27 01:56:59,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282748387] [2024-08-27 01:56:59,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 01:56:59,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-08-27 01:56:59,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 01:56:59,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-08-27 01:56:59,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=478, Unknown=37, NotChecked=196, Total=812 [2024-08-27 01:56:59,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:56:59,735 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 01:56:59,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.896551724137931) internal successors, (142), 28 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 01:56:59,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:56:59,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:56:59,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:59,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:59,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:56:59,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:59,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:59,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:56:59,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:56:59,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:56:59,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:56:59,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:56:59,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-08-27 01:56:59,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:56:59,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:56:59,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-27 01:56:59,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-08-27 01:56:59,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 01:57:03,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:09,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:19,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:21,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:25,398 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 [1] [2024-08-27 01:57:36,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:38,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:45,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:47,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:53,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:56,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:57:58,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:58:13,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:58:18,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:58:19,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:58:21,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:58:23,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:58:30,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:58:39,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:58:45,451 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-08-27 01:58:57,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:59:11,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:59:12,218 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-08-27 01:59:18,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:59:20,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:59:22,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:59:24,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:59:29,239 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse22 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse22 |c_~#top~0.offset|))) (.cse2 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (let ((.cse1 (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (_ bv0 32)))) (.cse3 (not .cse2)) (.cse4 (not .cse0))) (and (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv0 32)) (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (_ bv4 32))) (or (forall ((v_DerPreprocessor_51 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_51) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse0) (= (_ bv4 32) |c_~#top~0.base|) (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (_ bv3 32) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) .cse1 (or (and (or (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse2) (or .cse3 (forall ((v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))))) .cse4) (or .cse1 (and (= (_ bv0 32) |c_~#top~0.offset|) (= (_ bv4 32) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (or (and (or .cse3 (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (store .cse7 |c_~#top~0.base| (store (select .cse7 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))))) (store .cse6 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse6 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))))) (or (= (_ bv1 32) (select (select .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse5 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (= (select (select (store .cse5 |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 .cse2 (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse11 (store .cse8 |c_~#top~0.base| (store (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse9 (store (select .cse11 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse10 (store .cse11 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse9))) (or (= (_ bv1 32) (select (select (store (store (store .cse8 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse9) |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 .cse10 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (= (_ bv1 32) (select (select .cse10 |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 .cse2 (and (or .cse0 (forall ((v_DerPreprocessor_57 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_57))) (let ((.cse15 (let ((.cse16 (store .cse14 |c_~#m~0.base| v_ArrVal_1566))) (store .cse16 |c_~#top~0.base| (store (select .cse16 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54))))) (let ((.cse12 (store (select .cse15 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse13 (store .cse15 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse12))) (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| .cse12) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse13 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (not (= (_ bv0 32) (select (select .cse14 |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 ((.cse21 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse22 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse19 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_58) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse21))) (let ((.cse20 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse21) |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| (store (select (store .cse19 |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse18 (store (select .cse20 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse17 (store .cse20 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse18))) (or (not (= v_DerPreprocessor_54 (select (select .cse17 |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| .cse18) |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 .cse17 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse19 |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))))))))) .cse4))) (or .cse3 (and (or .cse0 (forall ((v_DerPreprocessor_56 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.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 .cse22 |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)))))))))) .cse4))))))) is different from true [2024-08-27 01:59:31,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:59:33,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:59:34,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:59:36,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:59:39,156 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse22 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse22 |c_~#top~0.offset|))) (.cse2 (= |c_~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (let ((.cse1 (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (_ bv0 32)))) (.cse3 (not .cse2)) (.cse4 (not .cse0))) (and (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv0 32)) (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (_ bv4 32))) (or (forall ((v_DerPreprocessor_51 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_51) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse0) (= (_ bv4 32) |c_~#top~0.base|) (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (not (= (_ bv3 32) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) .cse1 (or (and (or (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) .cse2) (or .cse3 (forall ((v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_50) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))))) .cse4) (or .cse1 (and (= (_ bv0 32) |c_~#top~0.offset|) (= (_ bv4 32) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|))) (not (= |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|)) (or (and (or .cse3 (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (store .cse7 |c_~#top~0.base| (store (select .cse7 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_53))))) (store .cse6 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| (store (select .cse6 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))))) (or (= (_ bv1 32) (select (select .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse5 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_53)) (= (select (select (store .cse5 |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 .cse2 (forall ((v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_1566))) (let ((.cse11 (store .cse8 |c_~#top~0.base| (store (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse9 (store (select .cse11 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse10 (store .cse11 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse9))) (or (= (_ bv1 32) (select (select (store (store (store .cse8 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse9) |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 .cse10 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (= (_ bv1 32) (select (select .cse10 |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 .cse2 (and (or .cse0 (forall ((v_DerPreprocessor_57 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_57))) (let ((.cse15 (let ((.cse16 (store .cse14 |c_~#m~0.base| v_ArrVal_1566))) (store .cse16 |c_~#top~0.base| (store (select .cse16 |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54))))) (let ((.cse12 (store (select .cse15 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse13 (store .cse15 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse12))) (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| .cse12) |c_~#top~0.base| v_DerPreprocessor_48) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_49) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (= (_ bv1 32) (select (select .cse13 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset|) v_DerPreprocessor_54)) (not (= (_ bv0 32) (select (select .cse14 |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 ((.cse21 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse22 |c_~#top~0.offset| v_ArrVal_1560)) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse19 (store (store |c_#memory_int| |c_~#top~0.base| v_DerPreprocessor_58) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse21))) (let ((.cse20 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse21) |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base| (store (select (store .cse19 |c_~#m~0.base| v_ArrVal_1566) |c_~#top~0.base|) |c_~#top~0.offset| v_DerPreprocessor_54)))) (let ((.cse18 (store (select .cse20 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse17 (store .cse20 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse18))) (or (not (= v_DerPreprocessor_54 (select (select .cse17 |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| .cse18) |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 .cse17 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)) (not (= (select (select .cse19 |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)))))))))) .cse4))) (or .cse3 (and (or .cse0 (forall ((v_DerPreprocessor_56 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_53 (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_1566 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.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 .cse22 |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)))))))))) .cse4))))))) is different from true [2024-08-27 01:59:44,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:59:47,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 01:59:59,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-27 01:59:59,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-08-27 01:59:59,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:59:59,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:59:59,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-27 01:59:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:59:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:59:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-27 01:59:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-27 01:59:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:59:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-27 01:59:59,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-27 01:59:59,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-08-27 01:59:59,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-27 01:59:59,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-27 01:59:59,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-27 01:59:59,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-08-27 01:59:59,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-08-27 01:59:59,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2024-08-27 01:59:59,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:59:59,251 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT] === [2024-08-27 01:59:59,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-27 01:59:59,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1422240575, now seen corresponding path program 2 times [2024-08-27 01:59:59,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-27 01:59:59,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347978900] [2024-08-27 01:59:59,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-27 01:59:59,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-08-27 01:59:59,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-08-27 01:59:59,254 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-27 01:59:59,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2024-08-27 01:59:59,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-08-27 01:59:59,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-27 01:59:59,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 18 conjunts are in the unsatisfiable core [2024-08-27 01:59:59,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-27 02:00:01,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 29 [2024-08-27 02:00:01,849 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2024-08-27 02:00:01,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 45 [2024-08-27 02:00:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-08-27 02:00:02,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-27 02:00:06,130 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse9 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (or (and (or (= (select (select |c_#memory_int| |c_~#m~0.base|) |c_~#m~0.offset|) (_ bv0 32)) (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (= (_ bv1 32) (select (select (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32))) |c_~#m~0.base|) |c_~#m~0.offset|)))) (forall ((v_DerPreprocessor_61 (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_DerPreprocessor_61)))) (store .cse1 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse1 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (= |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (= (_ bv0 32) .cse0) (= (_ bv1 32) .cse0)))) (forall ((v_DerPreprocessor_60 (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse3 (select (select (let ((.cse4 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_DerPreprocessor_60)))) (store .cse4 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse4 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (= (_ bv1 32) .cse3) (= |c_~#top~0.base| |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (= (_ bv0 32) .cse3)))) (forall ((v_DerPreprocessor_62 (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse5 (select (select (let ((.cse6 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_DerPreprocessor_62)))) (store .cse6 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse6 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) |c_~#m2~0.base|) |c_~#m2~0.offset|))) (or (= |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) (= .cse5 (_ bv0 32)) (= .cse5 (_ bv1 32))))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (= (_ bv1 32) (select (select (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32))) |c_~#m2~0.base|) |c_~#m2~0.offset|))) (= (select (select |c_#memory_int| |c_~#m2~0.base|) |c_~#m2~0.offset|) (_ bv0 32))) (forall ((v_DerPreprocessor_63 (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (let ((.cse7 (select (select (let ((.cse8 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_DerPreprocessor_63)))) (store .cse8 |thr1Thread2of3ForFork0_push_~#casret~0#1.base| (store (select .cse8 |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ bv1 32)))) |c_~#m2~0.base|) |c_~#m2~0.offset|))) (or (= .cse7 (_ bv1 32)) (= |c_~#top~0.base| |thr1Thread2of3ForFork0_push_~#casret~0#1.base|) (= .cse7 (_ bv0 32)))))) (not .cse9)) (or .cse9 (and (forall ((v_DerPreprocessor_64 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32))) (let ((.cse10 (select (select (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_64) |c_~#m~0.base|) |c_~#m~0.offset|))) (or (= .cse10 (_ bv0 32)) (= .cse10 (_ bv1 32))))) (not (= (_ bv1 32) (select v_DerPreprocessor_64 |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))) (forall ((v_DerPreprocessor_64 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_push_~#casret~0#1.offset| (_ BitVec 32))) (or (forall ((|thr1Thread2of3ForFork0_push_~#casret~0#1.base| (_ BitVec 32))) (let ((.cse11 (select (select (store |c_#memory_int| |thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_64) |c_~#m2~0.base|) |c_~#m2~0.offset|))) (or (= (_ bv1 32) .cse11) (= (_ bv0 32) .cse11)))) (not (= (_ bv1 32) (select v_DerPreprocessor_64 |thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))) is different from false [2024-08-27 02:00:06,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-27 02:00:06,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 890 treesize of output 813 [2024-08-27 02:00:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 17 trivial. 1 not checked. [2024-08-27 02:00:07,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-08-27 02:00:07,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347978900] [2024-08-27 02:00:07,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347978900] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-27 02:00:07,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-08-27 02:00:07,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2024-08-27 02:00:07,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288784545] [2024-08-27 02:00:07,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-08-27 02:00:07,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-27 02:00:07,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-08-27 02:00:07,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-27 02:00:07,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=91, Unknown=3, NotChecked=20, Total=156 [2024-08-27 02:00:07,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-27 02:00:07,611 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-27 02:00:07,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 10.666666666666666) internal successors, (128), 12 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-27 02:00:07,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-27 02:00:07,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-08-27 02:00:07,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 02:00:07,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 02:00:07,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-27 02:00:07,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 02:00:07,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 02:00:07,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-27 02:00:07,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-27 02:00:07,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-08-27 02:00:07,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-27 02:00:07,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-27 02:00:07,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-08-27 02:00:07,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-27 02:00:07,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-08-27 02:00:07,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-27 02:00:07,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-08-27 02:00:07,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-08-27 02:00:07,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-27 02:00:18,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 02:00:24,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 02:00:31,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 02:00:35,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 02:00:38,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 02:00:48,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 02:00:55,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 02:00:57,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 02:01:02,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 02:01:04,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 02:01:07,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 02:01:16,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 02:01:35,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 02:01:42,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-27 02:01:59,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-27 02:02:07,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15