./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-09-02_08-21-23.files/mutex-meet-local/37_stack_lock_p0_vs_concur-pthread.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a4c57e3 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i ./goblint.2024-09-02_08-21-23.files/mutex-meet-local/37_stack_lock_p0_vs_concur-pthread.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-4a4c57e-m [2024-09-08 14:40:51,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-08 14:40:51,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-08 14:40:51,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-08 14:40:51,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-08 14:40:52,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-08 14:40:52,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-08 14:40:52,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-08 14:40:52,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-08 14:40:52,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-08 14:40:52,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-08 14:40:52,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-08 14:40:52,022 INFO L153 SettingsManager]: * Use SBE=true [2024-09-08 14:40:52,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-08 14:40:52,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-08 14:40:52,023 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-08 14:40:52,023 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-08 14:40:52,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-08 14:40:52,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-08 14:40:52,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-08 14:40:52,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-08 14:40:52,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-08 14:40:52,029 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-08 14:40:52,029 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-08 14:40:52,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-08 14:40:52,030 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-08 14:40:52,030 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-08 14:40:52,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-08 14:40:52,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-08 14:40:52,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-08 14:40:52,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 14:40:52,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-08 14:40:52,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-08 14:40:52,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-08 14:40:52,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-08 14:40:52,033 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-08 14:40:52,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-08 14:40:52,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-08 14:40:52,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-08 14:40:52,034 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-08 14:40:52,035 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-08 14:40:52,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-09-08 14:40:52,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-08 14:40:52,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-08 14:40:52,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-08 14:40:52,301 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-08 14:40:52,302 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-08 14:40:52,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-09-02_08-21-23.files/mutex-meet-local/37_stack_lock_p0_vs_concur-pthread.yml/witness.yml [2024-09-08 14:40:52,361 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-08 14:40:52,361 INFO L274 PluginConnector]: CDTParser initialized [2024-09-08 14:40:52,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2024-09-08 14:40:53,707 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-08 14:40:53,976 INFO L384 CDTParser]: Found 1 translation units. [2024-09-08 14:40:53,976 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2024-09-08 14:40:53,989 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/073dbb9af/c26460dacf3142eeb5d69ba6573c347b/FLAG8fc694a19 [2024-09-08 14:40:54,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/073dbb9af/c26460dacf3142eeb5d69ba6573c347b [2024-09-08 14:40:54,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-08 14:40:54,289 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-08 14:40:54,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-08 14:40:54,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-08 14:40:54,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-08 14:40:54,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 02:40:52" (1/2) ... [2024-09-08 14:40:54,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96e9630 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:40:54, skipping insertion in model container [2024-09-08 14:40:54,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 02:40:52" (1/2) ... [2024-09-08 14:40:54,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@e6b9577 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:40:54, skipping insertion in model container [2024-09-08 14:40:54,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:40:54" (2/2) ... [2024-09-08 14:40:54,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96e9630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:40:54, skipping insertion in model container [2024-09-08 14:40:54,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:40:54" (2/2) ... [2024-09-08 14:40:54,335 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-08 14:40:54,336 INFO L1541 ArrayList]: Location invariant before [L706-L706] ((0 <= top) && (top <= 64)) && (top != 2) [2024-09-08 14:40:54,336 INFO L1541 ArrayList]: Location invariant before [L713-L713] ((0 <= top) && (top <= 64)) && (top != 2) [2024-09-08 14:40:54,380 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-08 14:40:54,773 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i[31052,31065] [2024-09-08 14:40:54,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 14:40:54,801 INFO L200 MainTranslator]: Completed pre-run Start Parsing Local [2024-09-08 14:40:54,864 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i[31052,31065] Start Parsing Local [2024-09-08 14:40:54,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 14:40:54,899 INFO L204 MainTranslator]: Completed translation [2024-09-08 14:40:54,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:40:54 WrapperNode [2024-09-08 14:40:54,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-08 14:40:54,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-08 14:40:54,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-08 14:40:54,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-08 14:40:54,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:40:54" (1/1) ... [2024-09-08 14:40:54,919 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:40:54" (1/1) ... [2024-09-08 14:40:54,938 INFO L138 Inliner]: procedures = 165, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 88 [2024-09-08 14:40:54,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-08 14:40:54,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-08 14:40:54,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-08 14:40:54,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-08 14:40:54,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:40:54" (1/1) ... [2024-09-08 14:40:54,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:40:54" (1/1) ... [2024-09-08 14:40:54,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:40:54" (1/1) ... [2024-09-08 14:40:54,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:40:54" (1/1) ... [2024-09-08 14:40:54,960 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:40:54" (1/1) ... [2024-09-08 14:40:54,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:40:54" (1/1) ... [2024-09-08 14:40:54,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:40:54" (1/1) ... [2024-09-08 14:40:54,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:40:54" (1/1) ... [2024-09-08 14:40:54,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-08 14:40:54,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-08 14:40:54,972 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-08 14:40:54,972 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-08 14:40:54,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:40:54" (1/1) ... [2024-09-08 14:40:54,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 14:40:54,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:40:55,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-09-08 14:40:55,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-09-08 14:40:55,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-09-08 14:40:55,042 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-09-08 14:40:55,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-09-08 14:40:55,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-09-08 14:40:55,042 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-09-08 14:40:55,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-08 14:40:55,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-08 14:40:55,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-08 14:40:55,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-08 14:40:55,043 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-09-08 14:40:55,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-08 14:40:55,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-08 14:40:55,044 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-08 14:40:55,149 INFO L242 CfgBuilder]: Building ICFG [2024-09-08 14:40:55,150 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-08 14:40:55,315 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-08 14:40:55,315 INFO L291 CfgBuilder]: Performing block encoding [2024-09-08 14:40:55,453 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-08 14:40:55,453 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-08 14:40:55,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:40:55 BoogieIcfgContainer [2024-09-08 14:40:55,454 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-08 14:40:55,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-08 14:40:55,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-08 14:40:55,463 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-08 14:40:55,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 02:40:52" (1/4) ... [2024-09-08 14:40:55,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4153b32e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 02:40:55, skipping insertion in model container [2024-09-08 14:40:55,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:40:54" (2/4) ... [2024-09-08 14:40:55,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4153b32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:40:55, skipping insertion in model container [2024-09-08 14:40:55,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:40:54" (3/4) ... [2024-09-08 14:40:55,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4153b32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:40:55, skipping insertion in model container [2024-09-08 14:40:55,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:40:55" (4/4) ... [2024-09-08 14:40:55,467 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur-pthread.i [2024-09-08 14:40:55,485 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-08 14:40:55,485 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-09-08 14:40:55,485 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-08 14:40:55,529 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 14:40:55,577 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 14:40:55,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 14:40:55,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:40:55,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 14:40:55,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-09-08 14:40:55,617 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 14:40:55,631 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-09-08 14:40:55,641 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6deaf245, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 14:40:55,642 INFO L337 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-09-08 14:40:55,773 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:40:55,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:40:55,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1672990485, now seen corresponding path program 1 times [2024-09-08 14:40:55,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:40:55,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632485528] [2024-09-08 14:40:55,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:40:55,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:40:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:40:56,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:40:56,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 14:40:56,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632485528] [2024-09-08 14:40:56,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632485528] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:40:56,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:40:56,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-08 14:40:56,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771554439] [2024-09-08 14:40:56,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:40:56,157 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 14:40:56,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 14:40:56,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 14:40:56,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 14:40:56,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:40:56,183 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:40:56,184 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:40:56,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:40:56,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:40:56,266 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-08 14:40:56,267 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:40:56,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:40:56,267 INFO L85 PathProgramCache]: Analyzing trace with hash -2028657658, now seen corresponding path program 1 times [2024-09-08 14:40:56,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:40:56,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300424389] [2024-09-08 14:40:56,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:40:56,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:40:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:40:56,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:40:56,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 14:40:56,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300424389] [2024-09-08 14:40:56,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300424389] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:40:56,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:40:56,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 14:40:56,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635392545] [2024-09-08 14:40:56,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:40:56,574 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 14:40:56,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 14:40:56,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 14:40:56,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 14:40:56,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:40:56,577 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:40:56,578 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:40:56,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:40:56,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:40:56,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:40:56,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:40:56,730 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-08 14:40:56,730 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:40:56,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:40:56,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1745618998, now seen corresponding path program 1 times [2024-09-08 14:40:56,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:40:56,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489987676] [2024-09-08 14:40:56,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:40:56,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:40:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:40:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:40:57,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 14:40:57,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489987676] [2024-09-08 14:40:57,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489987676] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:40:57,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:40:57,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-08 14:40:57,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942455711] [2024-09-08 14:40:57,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:40:57,056 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-08 14:40:57,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 14:40:57,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-08 14:40:57,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-08 14:40:57,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:40:57,060 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:40:57,061 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:40:57,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:40:57,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:40:57,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:40:57,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:40:57,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:40:57,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:40:57,205 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 3 remaining) [2024-09-08 14:40:57,206 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 3 remaining) [2024-09-08 14:40:57,206 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-09-08 14:40:57,206 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-08 14:40:57,214 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-09-08 14:40:57,218 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE,SAFE (1/2) [2024-09-08 14:40:57,222 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 14:40:57,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 14:40:57,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:40:57,244 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 14:40:57,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-09-08 14:40:57,249 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 14:40:57,250 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 14:40:57,251 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6deaf245, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 14:40:57,252 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 14:40:57,313 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 14:40:57,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:40:57,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1426079415, now seen corresponding path program 1 times [2024-09-08 14:40:57,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:40:57,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401029338] [2024-09-08 14:40:57,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:40:57,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:40:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:40:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:40:57,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 14:40:57,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401029338] [2024-09-08 14:40:57,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401029338] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:40:57,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:40:57,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 14:40:57,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423443881] [2024-09-08 14:40:57,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:40:57,370 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 14:40:57,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 14:40:57,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 14:40:57,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 14:40:57,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:40:57,371 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:40:57,371 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:40:57,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:40:57,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:40:57,425 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-08 14:40:57,426 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 14:40:57,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:40:57,427 INFO L85 PathProgramCache]: Analyzing trace with hash 375151012, now seen corresponding path program 1 times [2024-09-08 14:40:57,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:40:57,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220309766] [2024-09-08 14:40:57,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:40:57,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:40:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:40:57,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:40:57,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 14:40:57,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220309766] [2024-09-08 14:40:57,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220309766] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:40:57,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:40:57,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 14:40:57,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884178406] [2024-09-08 14:40:57,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:40:57,604 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 14:40:57,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 14:40:57,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 14:40:57,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 14:40:57,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:40:57,605 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:40:57,605 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:40:57,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:40:57,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:40:57,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:40:57,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:40:57,700 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-08 14:40:57,701 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 14:40:57,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:40:57,701 INFO L85 PathProgramCache]: Analyzing trace with hash 669902536, now seen corresponding path program 1 times [2024-09-08 14:40:57,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:40:57,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520584285] [2024-09-08 14:40:57,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:40:57,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:40:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:40:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:40:57,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 14:40:57,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520584285] [2024-09-08 14:40:57,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520584285] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:40:57,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:40:57,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-08 14:40:57,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871097189] [2024-09-08 14:40:57,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:40:57,840 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-08 14:40:57,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 14:40:57,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-08 14:40:57,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-08 14:40:57,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:40:57,842 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:40:57,842 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:40:57,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:40:57,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:40:57,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:40:57,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:40:57,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:40:57,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:40:57,920 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-08 14:40:57,920 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 14:40:57,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:40:57,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1255168313, now seen corresponding path program 1 times [2024-09-08 14:40:57,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:40:57,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375862382] [2024-09-08 14:40:57,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:40:57,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:40:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 14:40:57,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 14:40:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 14:40:58,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-08 14:40:58,000 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 14:40:58,000 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-08 14:40:58,000 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-08 14:40:58,002 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-09-08 14:40:58,004 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-09-08 14:40:58,004 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-08 14:40:58,004 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-09-08 14:40:58,026 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 14:40:58,030 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 14:40:58,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 14:40:58,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:40:58,032 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 14:40:58,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-09-08 14:40:58,037 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 14:40:58,037 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 14:40:58,037 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6deaf245, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 14:40:58,038 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 14:40:58,137 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 14:40:58,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:40:58,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1788519608, now seen corresponding path program 1 times [2024-09-08 14:40:58,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:40:58,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957768643] [2024-09-08 14:40:58,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:40:58,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:40:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:40:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 14:40:58,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 14:40:58,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957768643] [2024-09-08 14:40:58,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957768643] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:40:58,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:40:58,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 14:40:58,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986057075] [2024-09-08 14:40:58,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:40:58,219 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 14:40:58,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 14:40:58,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 14:40:58,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 14:40:58,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:40:58,222 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:40:58,223 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:40:58,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:40:58,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:40:58,316 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-08 14:40:58,316 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 14:40:58,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:40:58,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2089098435, now seen corresponding path program 1 times [2024-09-08 14:40:58,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:40:58,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128794427] [2024-09-08 14:40:58,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:40:58,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:40:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:40:58,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:40:58,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 14:40:58,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128794427] [2024-09-08 14:40:58,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128794427] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 14:40:58,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826242240] [2024-09-08 14:40:58,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:40:58,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 14:40:58,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:40:58,467 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 14:40:58,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-08 14:40:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:40:58,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-08 14:40:58,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:40:58,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:40:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:40:58,655 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:40:58,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826242240] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:40:58,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-08 14:40:58,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-09-08 14:40:58,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634778785] [2024-09-08 14:40:58,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:40:58,656 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 14:40:58,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 14:40:58,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 14:40:58,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-08 14:40:58,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:40:58,659 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:40:58,659 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:40:58,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:40:58,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:40:58,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:40:58,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:40:58,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-08 14:40:58,904 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 14:40:58,905 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 14:40:58,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:40:58,905 INFO L85 PathProgramCache]: Analyzing trace with hash -10450704, now seen corresponding path program 1 times [2024-09-08 14:40:58,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:40:58,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454051061] [2024-09-08 14:40:58,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:40:58,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:40:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:40:59,022 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 14:40:59,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 14:40:59,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454051061] [2024-09-08 14:40:59,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454051061] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:40:59,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:40:59,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 14:40:59,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445340017] [2024-09-08 14:40:59,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:40:59,024 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 14:40:59,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 14:40:59,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 14:40:59,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 14:40:59,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:40:59,025 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:40:59,025 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:40:59,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:40:59,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:40:59,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:40:59,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:40:59,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:40:59,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:40:59,163 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-08 14:40:59,163 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 14:40:59,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:40:59,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1531730131, now seen corresponding path program 1 times [2024-09-08 14:40:59,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:40:59,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360201487] [2024-09-08 14:40:59,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:40:59,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:40:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 14:40:59,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 14:40:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 14:40:59,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-08 14:40:59,202 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 14:40:59,202 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-08 14:40:59,202 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-08 14:40:59,203 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-09-08 14:40:59,204 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-09-08 14:40:59,204 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-08 14:40:59,204 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-09-08 14:40:59,239 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 14:40:59,241 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 14:40:59,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 14:40:59,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:40:59,245 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 14:40:59,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-09-08 14:40:59,248 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 14:40:59,249 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-09-08 14:40:59,249 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6deaf245, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 14:40:59,249 INFO L337 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-09-08 14:40:59,440 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:40:59,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:40:59,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1797247194, now seen corresponding path program 1 times [2024-09-08 14:40:59,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:40:59,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449096707] [2024-09-08 14:40:59,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:40:59,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:40:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:40:59,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 14:40:59,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 14:40:59,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449096707] [2024-09-08 14:40:59,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449096707] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:40:59,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:40:59,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 14:40:59,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683194321] [2024-09-08 14:40:59,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:40:59,512 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 14:40:59,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 14:40:59,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 14:40:59,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 14:40:59,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:40:59,513 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:40:59,513 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:40:59,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:40:59,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:40:59,611 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-08 14:40:59,611 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:40:59,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:40:59,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2010799942, now seen corresponding path program 1 times [2024-09-08 14:40:59,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:40:59,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595708767] [2024-09-08 14:40:59,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:40:59,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:40:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:40:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:40:59,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 14:40:59,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595708767] [2024-09-08 14:40:59,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595708767] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 14:40:59,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864801796] [2024-09-08 14:40:59,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:40:59,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 14:40:59,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:40:59,852 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 14:40:59,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-08 14:40:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:40:59,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-08 14:40:59,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:41:00,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:41:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:41:00,029 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:41:00,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864801796] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:41:00,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-08 14:41:00,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-09-08 14:41:00,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804363469] [2024-09-08 14:41:00,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:41:00,030 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 14:41:00,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 14:41:00,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 14:41:00,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-08 14:41:00,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:41:00,031 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:41:00,031 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:41:00,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:00,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:41:00,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:00,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:00,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-08 14:41:01,007 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-08 14:41:01,007 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:41:01,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:41:01,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1154902426, now seen corresponding path program 1 times [2024-09-08 14:41:01,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:41:01,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038011691] [2024-09-08 14:41:01,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:41:01,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:41:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:41:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:41:01,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 14:41:01,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038011691] [2024-09-08 14:41:01,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038011691] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 14:41:01,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145456429] [2024-09-08 14:41:01,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:41:01,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 14:41:01,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:41:01,260 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 14:41:01,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-08 14:41:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:41:01,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-08 14:41:01,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:41:01,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:41:01,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:41:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:41:01,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:41:01,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:01,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-09-08 14:41:01,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:41:01,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145456429] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:41:01,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 14:41:01,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-09-08 14:41:01,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751667984] [2024-09-08 14:41:01,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 14:41:01,911 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-08 14:41:01,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 14:41:01,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-08 14:41:01,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-08 14:41:01,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:41:01,915 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:41:01,915 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:41:01,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:01,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:01,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:41:02,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:02,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:02,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:02,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-08 14:41:02,907 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-08 14:41:02,907 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:41:02,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:41:02,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1111610825, now seen corresponding path program 1 times [2024-09-08 14:41:02,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:41:02,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871525442] [2024-09-08 14:41:02,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:41:02,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:41:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:41:03,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:41:03,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 14:41:03,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871525442] [2024-09-08 14:41:03,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871525442] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 14:41:03,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440517355] [2024-09-08 14:41:03,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:41:03,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 14:41:03,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:41:03,180 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 14:41:03,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-08 14:41:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:41:03,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-08 14:41:03,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:41:03,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:41:03,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:41:03,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:41:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:41:03,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:41:03,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:03,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-09-08 14:41:03,827 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:41:03,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440517355] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:41:03,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 14:41:03,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-09-08 14:41:03,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630962383] [2024-09-08 14:41:03,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 14:41:03,829 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-08 14:41:03,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 14:41:03,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-08 14:41:03,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-09-08 14:41:03,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:41:03,830 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:41:03,830 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:41:03,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:03,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:03,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:03,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:41:04,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:04,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:04,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:04,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 14:41:04,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-08 14:41:04,979 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 14:41:04,980 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:41:04,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:41:04,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1326739354, now seen corresponding path program 1 times [2024-09-08 14:41:04,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:41:04,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708920414] [2024-09-08 14:41:04,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:41:04,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:41:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:41:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 14:41:05,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 14:41:05,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708920414] [2024-09-08 14:41:05,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708920414] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 14:41:05,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860181040] [2024-09-08 14:41:05,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:41:05,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 14:41:05,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:41:05,122 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 14:41:05,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-08 14:41:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:41:05,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-08 14:41:05,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:41:05,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:41:05,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 14:41:05,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:41:05,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:05,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2024-09-08 14:41:05,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:05,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-09-08 14:41:05,501 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 53 treesize of output 37 [2024-09-08 14:41:05,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-09-08 14:41:05,513 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 28 treesize of output 16 [2024-09-08 14:41:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 14:41:05,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860181040] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:41:05,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 14:41:05,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-08 14:41:05,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535591194] [2024-09-08 14:41:05,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 14:41:05,548 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-08 14:41:05,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 14:41:05,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-08 14:41:05,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-09-08 14:41:05,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:41:05,549 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:41:05,549 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:41:05,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:05,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:05,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:05,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 14:41:05,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:41:06,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:06,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:06,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:06,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:06,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 14:41:06,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-08 14:41:06,241 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-08 14:41:06,241 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:41:06,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:41:06,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2050724697, now seen corresponding path program 1 times [2024-09-08 14:41:06,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:41:06,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678433855] [2024-09-08 14:41:06,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:41:06,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:41:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:41:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:41:06,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 14:41:06,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678433855] [2024-09-08 14:41:06,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678433855] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 14:41:06,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107667393] [2024-09-08 14:41:06,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:41:06,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 14:41:06,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:41:06,737 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 14:41:06,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-08 14:41:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:41:06,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-08 14:41:06,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:41:06,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:41:06,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-09-08 14:41:06,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:41:07,002 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 14:41:07,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-08 14:41:07,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-08 14:41:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:41:07,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:41:07,171 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_2 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) is different from false [2024-09-08 14:41:07,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 10 treesize of output 8 [2024-09-08 14:41:07,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-09-08 14:41:07,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:07,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-09-08 14:41:07,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:07,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-09-08 14:41:07,738 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 14:41:07,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-09-08 14:41:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:41:07,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107667393] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:41:07,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 14:41:07,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2024-09-08 14:41:07,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302203446] [2024-09-08 14:41:07,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 14:41:07,789 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-08 14:41:07,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 14:41:07,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-08 14:41:07,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=381, Unknown=2, NotChecked=40, Total=506 [2024-09-08 14:41:07,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:41:07,792 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:41:07,792 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 22 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:41:07,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:07,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:07,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:07,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:07,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 14:41:07,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:41:10,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 14:41:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-08 14:41:10,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-09-08 14:41:10,348 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-09-08 14:41:10,349 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:41:10,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:41:10,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1379541605, now seen corresponding path program 2 times [2024-09-08 14:41:10,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:41:10,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88191337] [2024-09-08 14:41:10,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:41:10,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:41:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:41:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:41:10,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 14:41:10,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88191337] [2024-09-08 14:41:10,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88191337] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 14:41:10,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923742720] [2024-09-08 14:41:10,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 14:41:10,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 14:41:10,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:41:10,692 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 14:41:10,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-08 14:41:10,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-08 14:41:10,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 14:41:10,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-08 14:41:10,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:41:10,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-09-08 14:41:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 14:41:10,892 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:41:10,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923742720] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:41:10,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-08 14:41:10,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-09-08 14:41:10,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725869434] [2024-09-08 14:41:10,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:41:10,893 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-08 14:41:10,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 14:41:10,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-08 14:41:10,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-09-08 14:41:10,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:41:10,894 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:41:10,895 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:41:10,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:10,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:10,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:10,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:10,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 14:41:10,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-09-08 14:41:10,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:41:13,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 14:41:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-09-08 14:41:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 14:41:13,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-09-08 14:41:13,207 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-09-08 14:41:13,208 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:41:13,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:41:13,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1913016729, now seen corresponding path program 3 times [2024-09-08 14:41:13,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:41:13,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414479352] [2024-09-08 14:41:13,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:41:13,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:41:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:41:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:41:13,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 14:41:13,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414479352] [2024-09-08 14:41:13,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414479352] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 14:41:13,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514885235] [2024-09-08 14:41:13,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-08 14:41:13,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 14:41:13,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:41:13,590 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 14:41:13,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-08 14:41:13,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-09-08 14:41:13,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 14:41:13,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-08 14:41:13,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:41:13,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-09-08 14:41:13,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:41:13,830 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-09-08 14:41:13,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 88 [2024-09-08 14:41:13,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-09-08 14:41:13,920 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-09-08 14:41:13,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 36 [2024-09-08 14:41:13,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-09-08 14:41:13,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:13,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-09-08 14:41:15,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:15,002 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 208 treesize of output 156 [2024-09-08 14:41:15,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:15,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 87 [2024-09-08 14:41:15,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 76 [2024-09-08 14:41:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 14:41:15,282 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:41:15,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514885235] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:41:15,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-08 14:41:15,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 19 [2024-09-08 14:41:15,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429206035] [2024-09-08 14:41:15,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:41:15,283 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-08 14:41:15,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 14:41:15,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-08 14:41:15,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=298, Unknown=1, NotChecked=0, Total=342 [2024-09-08 14:41:15,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:41:15,284 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:41:15,284 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:41:15,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:15,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:15,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:15,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:15,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 14:41:15,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-09-08 14:41:15,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 14:41:15,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:41:17,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 14:41:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-09-08 14:41:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 14:41:17,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:17,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-09-08 14:41:17,740 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 14:41:17,741 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:41:17,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:41:17,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1905853925, now seen corresponding path program 1 times [2024-09-08 14:41:17,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:41:17,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868303952] [2024-09-08 14:41:17,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:41:17,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:41:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:41:18,035 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:41:18,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 14:41:18,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868303952] [2024-09-08 14:41:18,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868303952] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 14:41:18,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051830100] [2024-09-08 14:41:18,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:41:18,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 14:41:18,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:41:18,038 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 14:41:18,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-09-08 14:41:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:41:18,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-08 14:41:18,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:41:18,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:41:18,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 6 treesize of output 5 [2024-09-08 14:41:18,263 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-08 14:41:18,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-09-08 14:41:18,318 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 14:41:18,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2024-09-08 14:41:18,364 INFO L349 Elim1Store]: treesize reduction 20, result has 50.0 percent of original size [2024-09-08 14:41:18,364 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 36 treesize of output 46 [2024-09-08 14:41:18,442 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-09-08 14:41:18,443 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 31 treesize of output 39 [2024-09-08 14:41:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:41:18,493 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:41:18,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-09-08 14:41:18,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 38 treesize of output 36 [2024-09-08 14:41:19,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:19,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2024-09-08 14:41:19,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:19,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-09-08 14:41:19,544 INFO L349 Elim1Store]: treesize reduction 36, result has 44.6 percent of original size [2024-09-08 14:41:19,545 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 234 treesize of output 248 [2024-09-08 14:41:19,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 200 [2024-09-08 14:41:19,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 198 [2024-09-08 14:41:19,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 196 [2024-09-08 14:41:20,021 INFO L349 Elim1Store]: treesize reduction 127, result has 48.2 percent of original size [2024-09-08 14:41:20,022 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 16 case distinctions, treesize of input 146 treesize of output 237 [2024-09-08 14:41:20,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 85 [2024-09-08 14:41:20,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2024-09-08 14:41:20,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 81 [2024-09-08 14:41:20,181 INFO L349 Elim1Store]: treesize reduction 22, result has 60.0 percent of original size [2024-09-08 14:41:20,185 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 308 treesize of output 316 [2024-09-08 14:41:20,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2024-09-08 14:41:20,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:20,426 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 20 treesize of output 24 [2024-09-08 14:41:20,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:20,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 79 [2024-09-08 14:41:20,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:41:20,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051830100] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:41:20,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 14:41:20,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 24 [2024-09-08 14:41:20,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102187591] [2024-09-08 14:41:20,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 14:41:20,524 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-08 14:41:20,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 14:41:20,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-08 14:41:20,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=497, Unknown=16, NotChecked=0, Total=600 [2024-09-08 14:41:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:41:20,525 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:41:20,526 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.72) internal successors, (118), 24 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:41:20,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:20,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:20,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:20,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:20,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 14:41:20,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-09-08 14:41:20,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 14:41:20,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:20,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:41:21,030 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~next_alloc_idx~0 65))) (and (forall ((v_ArrVal_872 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (let ((.cse0 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (not (= (+ (select .cse0 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_872) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (forall ((v_DerPreprocessor_6 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse0 0 c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)))))) (or .cse1 (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0))))) (< 0 c_~top~0) (or .cse1 (forall ((v_ArrVal_872 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_872) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (let ((.cse2 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (not (= (+ (select .cse2 0) 1) 0)) (forall ((v_DerPreprocessor_6 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse2 0 c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)))))) (forall ((v_DerPreprocessor_6 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) is different from false [2024-09-08 14:41:21,867 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~next_alloc_idx~0 65))) (and (forall ((v_ArrVal_872 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (let ((.cse0 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (not (= (+ (select .cse0 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_872) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (forall ((v_DerPreprocessor_6 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse0 0 c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)))))) (or .cse1 (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0))))) (or .cse1 (forall ((v_ArrVal_872 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_872) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (let ((.cse2 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (not (= (+ (select .cse2 0) 1) 0)) (forall ((v_DerPreprocessor_6 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse2 0 c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)))))) (forall ((v_DerPreprocessor_6 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) is different from false [2024-09-08 14:41:27,200 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|))) (let ((.cse3 (+ c_~next_alloc_idx~0 1)) (.cse1 (not (= (+ (select .cse0 0) 1) 0))) (.cse5 (< c_~next_alloc_idx~0 65)) (.cse6 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or (forall ((v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store .cse0 0 c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_6) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 0))) .cse1) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (let ((.cse2 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (forall ((v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse2 0 c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))) (not (= (+ (select .cse2 0) 1) 0))))) (<= 0 .cse3) (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (forall ((v_ArrVal_872 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (let ((.cse4 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (not (= (+ (select .cse4 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_872) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (forall ((v_DerPreprocessor_6 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse4 0 c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)))))) (not (= .cse3 0)) (<= c_~next_alloc_idx~0 62) (or .cse5 (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0))))) (or .cse5 (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or .cse5 (forall ((v_ArrVal_872 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_872) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0))))) (forall ((v_DerPreprocessor_6 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse6 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (= |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 0) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (let ((.cse7 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (not (= (+ (select .cse7 0) 1) 0)) (forall ((v_DerPreprocessor_6 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse7 0 c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)))))) (forall ((v_DerPreprocessor_6 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (or (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0) 1) 0)) (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))))) (or .cse1 (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_6) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 0))))) .cse5) (= 3 (select .cse6 0))))) is different from false [2024-09-08 14:41:27,370 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|))) (let ((.cse3 (+ c_~next_alloc_idx~0 1)) (.cse1 (not (= (+ (select .cse0 0) 1) 0))) (.cse5 (< c_~next_alloc_idx~0 65)) (.cse6 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or (forall ((v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store .cse0 0 c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_6) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 0))) .cse1) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (let ((.cse2 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (forall ((v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse2 0 c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))) (not (= (+ (select .cse2 0) 1) 0))))) (<= 0 .cse3) (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0) (forall ((v_ArrVal_872 Int) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (let ((.cse4 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (not (= (+ (select .cse4 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_872) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (forall ((v_DerPreprocessor_6 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse4 0 c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)))))) (not (= .cse3 0)) (<= c_~next_alloc_idx~0 62) (or .cse5 (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0))))) (or .cse5 (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or .cse5 (forall ((v_ArrVal_872 Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0) 1) 0)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_872) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0))))) (forall ((v_DerPreprocessor_6 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse6 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (= |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 0) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (let ((.cse7 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (not (= (+ (select .cse7 0) 1) 0)) (forall ((v_DerPreprocessor_6 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store .cse7 0 c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)))))) (forall ((v_DerPreprocessor_6 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (or (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0) 1) 0)) (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_6) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23|))))) (or .cse1 (forall ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| Int)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_6) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 0))))) .cse5) (<= 3 c_~top~0) (= 3 (select .cse6 0))))) is different from false [2024-09-08 14:41:29,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:29,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:29,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:29,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:29,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 14:41:29,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-09-08 14:41:29,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 14:41:29,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:29,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-09-08 14:41:29,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-09-08 14:41:29,590 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 14:41:29,593 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:41:29,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:41:29,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1700682406, now seen corresponding path program 2 times [2024-09-08 14:41:29,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:41:29,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159922606] [2024-09-08 14:41:29,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:41:29,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:41:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:41:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:41:29,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 14:41:29,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159922606] [2024-09-08 14:41:29,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159922606] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 14:41:29,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256796941] [2024-09-08 14:41:29,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 14:41:29,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 14:41:29,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:41:29,987 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 14:41:29,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-09-08 14:41:30,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 14:41:30,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 14:41:30,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-08 14:41:30,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:41:30,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-09-08 14:41:30,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:41:30,254 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-08 14:41:30,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-09-08 14:41:30,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-08 14:41:30,349 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 14:41:30,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-08 14:41:30,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-08 14:41:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:41:30,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:41:31,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:31,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2024-09-08 14:41:31,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:31,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-09-08 14:41:31,428 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 471 treesize of output 449 [2024-09-08 14:41:31,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 199 [2024-09-08 14:41:31,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 197 [2024-09-08 14:41:31,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 191 [2024-09-08 14:41:31,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 189 [2024-09-08 14:41:31,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 185 [2024-09-08 14:41:31,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 181 [2024-09-08 14:41:31,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 177 [2024-09-08 14:41:31,665 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 447 treesize of output 423 [2024-09-08 14:41:31,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-09-08 14:41:31,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 24 treesize of output 20 [2024-09-08 14:41:31,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2024-09-08 14:41:31,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2024-09-08 14:41:31,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-09-08 14:41:31,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2024-09-08 14:41:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:41:32,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256796941] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:41:32,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 14:41:32,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 28 [2024-09-08 14:41:32,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987152121] [2024-09-08 14:41:32,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 14:41:32,140 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-08 14:41:32,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 14:41:32,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-08 14:41:32,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=694, Unknown=9, NotChecked=0, Total=870 [2024-09-08 14:41:32,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:41:32,141 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:41:32,142 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.2758620689655173) internal successors, (95), 29 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:41:32,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:32,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:32,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:32,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:32,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 14:41:32,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-09-08 14:41:32,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 14:41:32,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:32,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2024-09-08 14:41:32,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:41:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:41:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:41:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 14:41:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-09-08 14:41:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 14:41:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:41:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-09-08 14:41:43,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-09-08 14:41:43,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-09-08 14:41:44,122 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 14:41:44,123 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:41:44,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:41:44,123 INFO L85 PathProgramCache]: Analyzing trace with hash -564805778, now seen corresponding path program 2 times [2024-09-08 14:41:44,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 14:41:44,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078903237] [2024-09-08 14:41:44,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:41:44,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 14:41:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:41:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:41:44,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 14:41:44,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078903237] [2024-09-08 14:41:44,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078903237] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 14:41:44,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864771960] [2024-09-08 14:41:44,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 14:41:44,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 14:41:44,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:41:44,419 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 14:41:44,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-09-08 14:41:44,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 14:41:44,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 14:41:44,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-08 14:41:44,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:41:44,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-09-08 14:41:44,591 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-08 14:41:44,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-09-08 14:41:44,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:41:44,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:41:44,922 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-08 14:41:44,922 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 18 treesize of output 17 [2024-09-08 14:41:45,064 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 14:41:45,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2024-09-08 14:41:45,145 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-09-08 14:41:45,145 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 58 treesize of output 60 [2024-09-08 14:41:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:41:45,222 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:41:45,310 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_13 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) (forall ((v_DerPreprocessor_13 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 64)) (forall ((v_DerPreprocessor_13 (Array Int Int))) (<= 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) is different from false [2024-09-08 14:41:46,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:46,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-09-08 14:41:47,042 INFO L349 Elim1Store]: treesize reduction 60, result has 49.2 percent of original size [2024-09-08 14:41:47,043 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 746 treesize of output 776 [2024-09-08 14:41:47,976 INFO L349 Elim1Store]: treesize reduction 1030, result has 17.9 percent of original size [2024-09-08 14:41:47,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 983 treesize of output 1161 [2024-09-08 14:41:48,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 879 treesize of output 877 [2024-09-08 14:41:48,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:48,138 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 877 treesize of output 894 [2024-09-08 14:41:48,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:48,231 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 869 treesize of output 886 [2024-09-08 14:41:48,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 861 treesize of output 859 [2024-09-08 14:41:48,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:48,393 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 859 treesize of output 876 [2024-09-08 14:41:48,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 851 treesize of output 849 [2024-09-08 14:41:48,643 INFO L349 Elim1Store]: treesize reduction 129, result has 31.0 percent of original size [2024-09-08 14:41:48,644 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 4 new quantified variables, introduced 12 case distinctions, treesize of input 923 treesize of output 961 [2024-09-08 14:41:49,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:49,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 1128 treesize of output 1544 [2024-09-08 14:41:49,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 856 treesize of output 854 [2024-09-08 14:41:50,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 854 treesize of output 852 [2024-09-08 14:41:50,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 852 treesize of output 850 [2024-09-08 14:41:50,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:50,615 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 850 treesize of output 867 [2024-09-08 14:41:50,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 842 treesize of output 840 [2024-09-08 14:41:50,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:50,873 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 840 treesize of output 857 [2024-09-08 14:41:51,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 832 treesize of output 830 [2024-09-08 14:41:51,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:41:51,228 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 830 treesize of output 847 [2024-09-08 14:41:51,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 822 treesize of output 820 [2024-09-08 14:44:37,721 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-09-08 14:44:37,722 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-09-08 14:44:37,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2024-09-08 14:44:37,736 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-09-08 14:44:37,923 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 14:44:37,924 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.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.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:410) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:327) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2024-09-08 14:44:37,929 INFO L158 Benchmark]: Toolchain (without parser) took 223639.61ms. Allocated memory was 163.6MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 108.8MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2024-09-08 14:44:37,929 INFO L158 Benchmark]: Witness Parser took 0.20ms. Allocated memory is still 96.5MB. Free memory was 55.7MB in the beginning and 55.5MB in the end (delta: 142.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 14:44:37,929 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 96.5MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 14:44:37,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 607.46ms. Allocated memory is still 163.6MB. Free memory was 108.8MB in the beginning and 118.7MB in the end (delta: -9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-08 14:44:37,930 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.55ms. Allocated memory is still 163.6MB. Free memory was 118.7MB in the beginning and 116.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-08 14:44:37,930 INFO L158 Benchmark]: Boogie Preprocessor took 31.81ms. Allocated memory is still 163.6MB. Free memory was 116.7MB in the beginning and 114.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-08 14:44:37,930 INFO L158 Benchmark]: RCFGBuilder took 482.58ms. Allocated memory is still 163.6MB. Free memory was 114.6MB in the beginning and 90.2MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-09-08 14:44:37,930 INFO L158 Benchmark]: TraceAbstraction took 222472.46ms. Allocated memory was 163.6MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 89.4MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2024-09-08 14:44:37,931 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.20ms. Allocated memory is still 96.5MB. Free memory was 55.7MB in the beginning and 55.5MB in the end (delta: 142.8kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.10ms. Allocated memory is still 96.5MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 607.46ms. Allocated memory is still 163.6MB. Free memory was 108.8MB in the beginning and 118.7MB in the end (delta: -9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.55ms. Allocated memory is still 163.6MB. Free memory was 118.7MB in the beginning and 116.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.81ms. Allocated memory is still 163.6MB. Free memory was 116.7MB in the beginning and 114.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 482.58ms. Allocated memory is still 163.6MB. Free memory was 114.6MB in the beginning and 90.2MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 222472.46ms. Allocated memory was 163.6MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 89.4MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 454, independent: 421, independent conditional: 112, independent unconditional: 309, dependent: 33, dependent conditional: 24, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 430, independent: 421, independent conditional: 112, independent unconditional: 309, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 430, independent: 421, independent conditional: 112, independent unconditional: 309, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 430, independent: 421, independent conditional: 112, independent unconditional: 309, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 430, independent: 421, independent conditional: 0, independent unconditional: 421, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 430, independent: 421, independent conditional: 0, independent unconditional: 421, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 228, independent: 219, independent conditional: 0, independent unconditional: 219, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 228, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 17, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 128, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 430, independent: 202, independent conditional: 0, independent unconditional: 202, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 228, unknown conditional: 0, unknown unconditional: 228] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 219, Positive conditional cache size: 0, Positive unconditional cache size: 219, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 112, Maximal queried relation: 0, Independence queries for same thread: 24, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 61, Number of trivial persistent sets: 47, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 318, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 454, independent: 421, independent conditional: 112, independent unconditional: 309, dependent: 33, dependent conditional: 24, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 430, independent: 421, independent conditional: 112, independent unconditional: 309, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 430, independent: 421, independent conditional: 112, independent unconditional: 309, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 430, independent: 421, independent conditional: 112, independent unconditional: 309, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 430, independent: 421, independent conditional: 0, independent unconditional: 421, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 430, independent: 421, independent conditional: 0, independent unconditional: 421, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 228, independent: 219, independent conditional: 0, independent unconditional: 219, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 228, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 17, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 128, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 430, independent: 202, independent conditional: 0, independent unconditional: 202, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 228, unknown conditional: 0, unknown unconditional: 228] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 219, Positive conditional cache size: 0, Positive unconditional cache size: 219, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 112, Maximal queried relation: 0, Independence queries for same thread: 24 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 364, independent: 346, independent conditional: 83, independent unconditional: 263, dependent: 18, dependent conditional: 12, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 352, independent: 346, independent conditional: 83, independent unconditional: 263, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 352, independent: 346, independent conditional: 83, independent unconditional: 263, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 352, independent: 346, independent conditional: 83, independent unconditional: 263, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 352, independent: 346, independent conditional: 0, independent unconditional: 346, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 352, independent: 346, independent conditional: 0, independent unconditional: 346, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 211, independent: 205, independent conditional: 0, independent unconditional: 205, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 211, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 70, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 352, independent: 141, independent conditional: 0, independent unconditional: 141, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 211, unknown conditional: 0, unknown unconditional: 211] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 205, Positive conditional cache size: 0, Positive unconditional cache size: 205, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 83, Maximal queried relation: 0, Independence queries for same thread: 12, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 29, Number of trivial persistent sets: 27, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 269, independent: 263, independent conditional: 0, independent unconditional: 263, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 364, independent: 346, independent conditional: 83, independent unconditional: 263, dependent: 18, dependent conditional: 12, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 352, independent: 346, independent conditional: 83, independent unconditional: 263, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 352, independent: 346, independent conditional: 83, independent unconditional: 263, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 352, independent: 346, independent conditional: 83, independent unconditional: 263, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 352, independent: 346, independent conditional: 0, independent unconditional: 346, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 352, independent: 346, independent conditional: 0, independent unconditional: 346, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 211, independent: 205, independent conditional: 0, independent unconditional: 205, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 211, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 70, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 352, independent: 141, independent conditional: 0, independent unconditional: 141, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 211, unknown conditional: 0, unknown unconditional: 211] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 205, Positive conditional cache size: 0, Positive unconditional cache size: 205, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 83, Maximal queried relation: 0, Independence queries for same thread: 12 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1095, independent: 1052, independent conditional: 136, independent unconditional: 916, dependent: 43, dependent conditional: 16, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1079, independent: 1052, independent conditional: 136, independent unconditional: 916, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1079, independent: 1052, independent conditional: 136, independent unconditional: 916, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1079, independent: 1052, independent conditional: 136, independent unconditional: 916, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1079, independent: 1052, independent conditional: 0, independent unconditional: 1052, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1079, independent: 1052, independent conditional: 0, independent unconditional: 1052, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 791, independent: 764, independent conditional: 0, independent unconditional: 764, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 791, independent: 739, independent conditional: 0, independent unconditional: 739, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 52, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 157, independent: 91, independent conditional: 0, independent unconditional: 91, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1079, independent: 288, independent conditional: 0, independent unconditional: 288, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 791, unknown conditional: 0, unknown unconditional: 791] , Statistics on independence cache: Total cache size (in pairs): 791, Positive cache size: 764, Positive conditional cache size: 0, Positive unconditional cache size: 764, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 136, Maximal queried relation: 0, Independence queries for same thread: 16, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 57, Number of trivial persistent sets: 53, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 943, independent: 916, independent conditional: 0, independent unconditional: 916, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1095, independent: 1052, independent conditional: 136, independent unconditional: 916, dependent: 43, dependent conditional: 16, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1079, independent: 1052, independent conditional: 136, independent unconditional: 916, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1079, independent: 1052, independent conditional: 136, independent unconditional: 916, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1079, independent: 1052, independent conditional: 136, independent unconditional: 916, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1079, independent: 1052, independent conditional: 0, independent unconditional: 1052, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1079, independent: 1052, independent conditional: 0, independent unconditional: 1052, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 791, independent: 764, independent conditional: 0, independent unconditional: 764, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 791, independent: 739, independent conditional: 0, independent unconditional: 739, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 52, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 157, independent: 91, independent conditional: 0, independent unconditional: 91, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1079, independent: 288, independent conditional: 0, independent unconditional: 288, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 791, unknown conditional: 0, unknown unconditional: 791] , Statistics on independence cache: Total cache size (in pairs): 791, Positive cache size: 764, Positive conditional cache size: 0, Positive unconditional cache size: 764, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 136, Maximal queried relation: 0, Independence queries for same thread: 16 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-09-08 14:44:37,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2024-09-08 14:44:38,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2024-09-08 14:44:38,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2024-09-08 14:44:38,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i ./goblint.2024-09-02_08-21-23.files/mutex-meet-local/37_stack_lock_p0_vs_concur-pthread.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-4a4c57e-m [2024-09-08 14:44:41,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-08 14:44:41,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-09-08 14:44:41,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-08 14:44:41,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-08 14:44:41,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-08 14:44:41,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-08 14:44:41,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-08 14:44:41,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-08 14:44:41,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-08 14:44:41,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-08 14:44:41,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-08 14:44:41,225 INFO L153 SettingsManager]: * Use SBE=true [2024-09-08 14:44:41,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-08 14:44:41,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-08 14:44:41,228 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-08 14:44:41,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-08 14:44:41,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-08 14:44:41,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-08 14:44:41,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-08 14:44:41,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-08 14:44:41,230 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-08 14:44:41,231 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-08 14:44:41,231 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-08 14:44:41,231 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-08 14:44:41,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-08 14:44:41,232 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-08 14:44:41,232 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-08 14:44:41,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-08 14:44:41,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-08 14:44:41,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-08 14:44:41,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 14:44:41,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-08 14:44:41,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-08 14:44:41,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-08 14:44:41,234 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-08 14:44:41,234 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-08 14:44:41,234 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-08 14:44:41,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-08 14:44:41,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-08 14:44:41,235 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-08 14:44:41,236 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-08 14:44:41,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-08 14:44:41,237 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-09-08 14:44:41,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-08 14:44:41,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-08 14:44:41,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-08 14:44:41,624 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-08 14:44:41,624 INFO L274 PluginConnector]: CDTParser initialized [2024-09-08 14:44:41,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2024-09-08 14:44:43,221 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-08 14:44:43,508 INFO L384 CDTParser]: Found 1 translation units. [2024-09-08 14:44:43,509 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2024-09-08 14:44:43,523 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f428afbfc/3440417fb19e4eb89a9aa0edfce6989f/FLAG6f39f6cf2 [2024-09-08 14:44:43,536 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f428afbfc/3440417fb19e4eb89a9aa0edfce6989f [2024-09-08 14:44:43,539 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-08 14:44:43,539 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-08 14:44:43,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-09-02_08-21-23.files/mutex-meet-local/37_stack_lock_p0_vs_concur-pthread.yml/witness.yml [2024-09-08 14:44:43,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-08 14:44:43,606 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-08 14:44:43,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-08 14:44:43,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-08 14:44:43,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-08 14:44:43,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:44:43" (1/2) ... [2024-09-08 14:44:43,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a7ed772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:44:43, skipping insertion in model container [2024-09-08 14:44:43,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:44:43" (1/2) ... [2024-09-08 14:44:43,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@10a28150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:44:43, skipping insertion in model container [2024-09-08 14:44:43,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 02:44:43" (2/2) ... [2024-09-08 14:44:43,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a7ed772 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:44:43, skipping insertion in model container [2024-09-08 14:44:43,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 02:44:43" (2/2) ... [2024-09-08 14:44:43,655 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-08 14:44:43,658 INFO L1541 ArrayList]: Location invariant before [L706-L706] ((0 <= top) && (top <= 64)) && (top != 2) [2024-09-08 14:44:43,659 INFO L1541 ArrayList]: Location invariant before [L713-L713] ((0 <= top) && (top <= 64)) && (top != 2) [2024-09-08 14:44:43,705 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-08 14:44:44,131 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i[31052,31065] [2024-09-08 14:44:44,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 14:44:44,162 INFO L200 MainTranslator]: Completed pre-run Start Parsing Local [2024-09-08 14:44:44,253 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i[31052,31065] Start Parsing Local [2024-09-08 14:44:44,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 14:44:44,311 INFO L204 MainTranslator]: Completed translation [2024-09-08 14:44:44,312 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:44:44 WrapperNode [2024-09-08 14:44:44,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-08 14:44:44,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-08 14:44:44,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-08 14:44:44,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-08 14:44:44,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:44:44" (1/1) ... [2024-09-08 14:44:44,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:44:44" (1/1) ... [2024-09-08 14:44:44,359 INFO L138 Inliner]: procedures = 169, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 89 [2024-09-08 14:44:44,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-08 14:44:44,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-08 14:44:44,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-08 14:44:44,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-08 14:44:44,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:44:44" (1/1) ... [2024-09-08 14:44:44,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:44:44" (1/1) ... [2024-09-08 14:44:44,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:44:44" (1/1) ... [2024-09-08 14:44:44,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:44:44" (1/1) ... [2024-09-08 14:44:44,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:44:44" (1/1) ... [2024-09-08 14:44:44,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:44:44" (1/1) ... [2024-09-08 14:44:44,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:44:44" (1/1) ... [2024-09-08 14:44:44,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:44:44" (1/1) ... [2024-09-08 14:44:44,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-08 14:44:44,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-08 14:44:44,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-08 14:44:44,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-08 14:44:44,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:44:44" (1/1) ... [2024-09-08 14:44:44,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 14:44:44,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:44:44,438 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-09-08 14:44:44,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-09-08 14:44:44,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-09-08 14:44:44,501 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-09-08 14:44:44,501 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-09-08 14:44:44,501 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-09-08 14:44:44,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-08 14:44:44,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-08 14:44:44,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-08 14:44:44,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-09-08 14:44:44,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-09-08 14:44:44,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-09-08 14:44:44,502 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-09-08 14:44:44,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-08 14:44:44,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-08 14:44:44,505 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-08 14:44:44,678 INFO L242 CfgBuilder]: Building ICFG [2024-09-08 14:44:44,680 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-08 14:44:44,954 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-08 14:44:44,954 INFO L291 CfgBuilder]: Performing block encoding [2024-09-08 14:44:45,095 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-08 14:44:45,095 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-08 14:44:45,095 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:44:45 BoogieIcfgContainer [2024-09-08 14:44:45,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-08 14:44:45,099 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-08 14:44:45,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-08 14:44:45,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-08 14:44:45,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:44:43" (1/4) ... [2024-09-08 14:44:45,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5921b355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:44:45, skipping insertion in model container [2024-09-08 14:44:45,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 02:44:43" (2/4) ... [2024-09-08 14:44:45,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5921b355 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 02:44:45, skipping insertion in model container [2024-09-08 14:44:45,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 02:44:44" (3/4) ... [2024-09-08 14:44:45,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5921b355 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 02:44:45, skipping insertion in model container [2024-09-08 14:44:45,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:44:45" (4/4) ... [2024-09-08 14:44:45,106 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur-pthread.i [2024-09-08 14:44:45,124 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-08 14:44:45,125 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-09-08 14:44:45,125 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-08 14:44:45,177 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 14:44:45,225 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 14:44:45,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 14:44:45,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:44:45,227 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 14:44:45,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-09-08 14:44:45,266 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 14:44:45,296 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-09-08 14:44:45,303 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@18cf5a34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 14:44:45,303 INFO L337 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-09-08 14:44:45,446 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:44:45,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:44:45,452 INFO L85 PathProgramCache]: Analyzing trace with hash 598098539, now seen corresponding path program 1 times [2024-09-08 14:44:45,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:44:45,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227629810] [2024-09-08 14:44:45,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:44:45,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:45,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:44:45,489 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:44:45,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-09-08 14:44:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:44:45,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-08 14:44:45,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:44:45,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:44:45,649 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:44:45,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:44:45,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227629810] [2024-09-08 14:44:45,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227629810] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:44:45,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:44:45,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-08 14:44:45,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986231048] [2024-09-08 14:44:45,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:44:45,657 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 14:44:45,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:44:45,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 14:44:45,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 14:44:45,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:45,685 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:44:45,686 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:44:45,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:45,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:45,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-09-08 14:44:45,980 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:45,981 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:44:45,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:44:45,981 INFO L85 PathProgramCache]: Analyzing trace with hash -337925688, now seen corresponding path program 1 times [2024-09-08 14:44:45,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:44:45,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457276988] [2024-09-08 14:44:45,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:44:45,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:45,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:44:45,986 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:44:45,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-09-08 14:44:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:44:46,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-08 14:44:46,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:44:46,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:44:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:44:46,222 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:44:46,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:44:46,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457276988] [2024-09-08 14:44:46,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457276988] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:44:46,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:44:46,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 14:44:46,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129135722] [2024-09-08 14:44:46,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:44:46,225 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 14:44:46,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:44:46,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 14:44:46,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 14:44:46,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:46,227 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:44:46,227 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:44:46,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:46,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:46,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:46,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:44:46,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-09-08 14:44:46,639 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:46,640 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:44:46,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:44:46,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1397775606, now seen corresponding path program 1 times [2024-09-08 14:44:46,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:44:46,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194997285] [2024-09-08 14:44:46,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:44:46,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:46,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:44:46,645 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:44:46,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-09-08 14:44:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:44:46,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-08 14:44:46,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:44:46,768 INFO L378 Elim1Store]: Elim1 eliminated variable 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 9 [2024-09-08 14:44:46,788 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:44:46,789 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:44:46,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:44:46,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194997285] [2024-09-08 14:44:46,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194997285] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:44:46,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:44:46,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 14:44:46,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5221647] [2024-09-08 14:44:46,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:44:46,791 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 14:44:46,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:44:46,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 14:44:46,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 14:44:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:46,792 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:44:46,792 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:44:46,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:46,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:44:46,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:46,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:46,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:44:46,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:46,912 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 3 remaining) [2024-09-08 14:44:46,913 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 3 remaining) [2024-09-08 14:44:46,913 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-09-08 14:44:46,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-09-08 14:44:47,114 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:47,121 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-09-08 14:44:47,122 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE,SAFE (1/2) [2024-09-08 14:44:47,126 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 14:44:47,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 14:44:47,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:44:47,129 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 14:44:47,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-09-08 14:44:47,133 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 14:44:47,134 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 14:44:47,135 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@18cf5a34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 14:44:47,135 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 14:44:47,218 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 14:44:47,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:44:47,219 INFO L85 PathProgramCache]: Analyzing trace with hash -752913655, now seen corresponding path program 1 times [2024-09-08 14:44:47,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:44:47,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778644711] [2024-09-08 14:44:47,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:44:47,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:47,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:44:47,223 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:44:47,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-09-08 14:44:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:44:47,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-08 14:44:47,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:44:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:44:47,337 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:44:47,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:44:47,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778644711] [2024-09-08 14:44:47,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778644711] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:44:47,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:44:47,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 14:44:47,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100350719] [2024-09-08 14:44:47,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:44:47,338 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 14:44:47,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:44:47,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 14:44:47,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 14:44:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:47,339 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:44:47,340 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:44:47,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:47,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:47,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-09-08 14:44:47,619 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:47,619 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 14:44:47,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:44:47,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1670936358, now seen corresponding path program 1 times [2024-09-08 14:44:47,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:44:47,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487761143] [2024-09-08 14:44:47,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:44:47,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:47,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:44:47,624 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:44:47,626 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 (8)] Waiting until timeout for monitored process [2024-09-08 14:44:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:44:47,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-08 14:44:47,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:44:47,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:44:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:44:47,801 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:44:47,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:44:47,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487761143] [2024-09-08 14:44:47,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487761143] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:44:47,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:44:47,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 14:44:47,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426845068] [2024-09-08 14:44:47,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:44:47,802 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 14:44:47,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:44:47,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 14:44:47,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 14:44:47,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:47,803 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:44:47,803 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:44:47,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:47,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:47,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:47,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:44:47,946 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 (8)] Forceful destruction successful, exit code 0 [2024-09-08 14:44:48,141 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:48,142 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 14:44:48,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:44:48,143 INFO L85 PathProgramCache]: Analyzing trace with hash 245090760, now seen corresponding path program 1 times [2024-09-08 14:44:48,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:44:48,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710917252] [2024-09-08 14:44:48,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:44:48,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:48,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:44:48,147 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:44:48,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-09-08 14:44:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:44:48,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-08 14:44:48,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:44:48,247 INFO L378 Elim1Store]: Elim1 eliminated variable 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 9 [2024-09-08 14:44:48,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:44:48,269 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:44:48,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:44:48,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710917252] [2024-09-08 14:44:48,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710917252] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:44:48,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:44:48,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 14:44:48,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820692440] [2024-09-08 14:44:48,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:44:48,271 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 14:44:48,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:44:48,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 14:44:48,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 14:44:48,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:48,272 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:44:48,272 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:44:48,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:48,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:44:48,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:48,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:48,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:44:48,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:48,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-09-08 14:44:48,535 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:48,535 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 14:44:48,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:44:48,536 INFO L85 PathProgramCache]: Analyzing trace with hash 259471751, now seen corresponding path program 1 times [2024-09-08 14:44:48,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:44:48,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733195143] [2024-09-08 14:44:48,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:44:48,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:48,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:44:48,540 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:44:48,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-09-08 14:44:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 14:44:48,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 14:44:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 14:44:48,717 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-09-08 14:44:48,719 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 14:44:48,719 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-08 14:44:48,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-09-08 14:44:48,920 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:48,922 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-09-08 14:44:48,922 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-09-08 14:44:48,923 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-08 14:44:48,923 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-09-08 14:44:48,955 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 14:44:48,960 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 14:44:48,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 14:44:48,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:44:48,963 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 14:44:48,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2024-09-08 14:44:48,966 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 14:44:48,967 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 14:44:48,967 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@18cf5a34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 14:44:48,967 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 14:44:49,140 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 14:44:49,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:44:49,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1504256442, now seen corresponding path program 1 times [2024-09-08 14:44:49,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:44:49,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279843188] [2024-09-08 14:44:49,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:44:49,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:49,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:44:49,147 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:44:49,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-09-08 14:44:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:44:49,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-08 14:44:49,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:44:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 14:44:49,284 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:44:49,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:44:49,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279843188] [2024-09-08 14:44:49,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279843188] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:44:49,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:44:49,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 14:44:49,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138487216] [2024-09-08 14:44:49,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:44:49,285 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 14:44:49,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:44:49,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 14:44:49,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 14:44:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:49,286 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:44:49,286 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:44:49,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:49,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:49,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-09-08 14:44:49,627 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:49,628 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 14:44:49,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:44:49,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1487628093, now seen corresponding path program 1 times [2024-09-08 14:44:49,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:44:49,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194223785] [2024-09-08 14:44:49,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:44:49,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:49,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:44:49,631 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:44:49,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-09-08 14:44:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:44:49,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-08 14:44:49,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:44:49,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:44:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 14:44:49,788 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:44:49,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:44:49,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194223785] [2024-09-08 14:44:49,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194223785] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:44:49,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:44:49,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 14:44:49,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748480773] [2024-09-08 14:44:49,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:44:49,789 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 14:44:49,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:44:49,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 14:44:49,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 14:44:49,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:49,791 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:44:49,791 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:44:49,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:49,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:50,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:50,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:44:50,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-09-08 14:44:50,266 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:50,267 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 14:44:50,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:44:50,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1069358573, now seen corresponding path program 1 times [2024-09-08 14:44:50,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:44:50,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315678533] [2024-09-08 14:44:50,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:44:50,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:50,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:44:50,269 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:44:50,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-09-08 14:44:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:44:50,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-08 14:44:50,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:44:50,398 INFO L378 Elim1Store]: Elim1 eliminated variable 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 9 [2024-09-08 14:44:50,413 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 14:44:50,413 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:44:50,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:44:50,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315678533] [2024-09-08 14:44:50,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315678533] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:44:50,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:44:50,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 14:44:50,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477861889] [2024-09-08 14:44:50,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:44:50,415 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 14:44:50,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:44:50,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 14:44:50,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 14:44:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:50,416 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:44:50,416 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:44:50,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:50,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:44:50,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:50,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:50,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:44:50,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:50,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-09-08 14:44:50,720 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:50,720 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 14:44:50,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:44:50,721 INFO L85 PathProgramCache]: Analyzing trace with hash -162870125, now seen corresponding path program 1 times [2024-09-08 14:44:50,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:44:50,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211307950] [2024-09-08 14:44:50,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:44:50,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:50,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:44:50,724 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:44:50,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-09-08 14:44:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 14:44:50,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 14:44:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 14:44:50,920 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-09-08 14:44:50,920 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 14:44:50,920 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-08 14:44:50,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-09-08 14:44:51,121 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:51,122 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-09-08 14:44:51,122 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-09-08 14:44:51,123 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-08 14:44:51,123 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-09-08 14:44:51,167 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 14:44:51,170 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 14:44:51,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 14:44:51,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:44:51,173 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 14:44:51,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (16)] Waiting until timeout for monitored process [2024-09-08 14:44:51,178 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 14:44:51,178 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-09-08 14:44:51,179 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@18cf5a34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 14:44:51,179 INFO L337 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-09-08 14:44:51,459 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:44:51,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:44:51,460 INFO L85 PathProgramCache]: Analyzing trace with hash -536890522, now seen corresponding path program 1 times [2024-09-08 14:44:51,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:44:51,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059471900] [2024-09-08 14:44:51,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:44:51,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:51,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:44:51,464 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:44:51,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-09-08 14:44:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:44:51,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-08 14:44:51,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:44:51,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 14:44:51,616 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:44:51,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:44:51,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059471900] [2024-09-08 14:44:51,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059471900] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:44:51,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:44:51,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 14:44:51,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054249957] [2024-09-08 14:44:51,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:44:51,617 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 14:44:51,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:44:51,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 14:44:51,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 14:44:51,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:51,618 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:44:51,618 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:44:51,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:51,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:51,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-09-08 14:44:51,974 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:51,974 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:44:51,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:44:51,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1130571192, now seen corresponding path program 1 times [2024-09-08 14:44:51,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:44:51,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666037654] [2024-09-08 14:44:51,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:44:51,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:51,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:44:51,979 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:44:51,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-09-08 14:44:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:44:52,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-08 14:44:52,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:44:52,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:44:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 14:44:52,155 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:44:52,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:44:52,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666037654] [2024-09-08 14:44:52,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666037654] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:44:52,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:44:52,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 14:44:52,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284682602] [2024-09-08 14:44:52,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:44:52,156 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 14:44:52,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:44:52,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 14:44:52,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 14:44:52,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:52,158 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:44:52,158 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:44:52,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:52,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:52,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:52,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:44:52,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-09-08 14:44:52,608 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:52,608 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:44:52,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:44:52,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1211168723, now seen corresponding path program 1 times [2024-09-08 14:44:52,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:44:52,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598223953] [2024-09-08 14:44:52,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:44:52,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:52,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:44:52,613 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:44:52,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-09-08 14:44:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:44:52,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-08 14:44:52,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:44:52,789 INFO L378 Elim1Store]: Elim1 eliminated variable 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 9 [2024-09-08 14:44:52,803 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 14:44:52,804 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:44:52,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:44:52,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598223953] [2024-09-08 14:44:52,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598223953] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:44:52,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:44:52,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 14:44:52,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912209623] [2024-09-08 14:44:52,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:44:52,805 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 14:44:52,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:44:52,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 14:44:52,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 14:44:52,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:52,806 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:44:52,806 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:44:52,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:52,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:44:52,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:53,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:53,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:44:53,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:53,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-09-08 14:44:53,983 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:53,984 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:44:53,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:44:53,984 INFO L85 PathProgramCache]: Analyzing trace with hash 246840230, now seen corresponding path program 1 times [2024-09-08 14:44:53,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:44:53,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881916139] [2024-09-08 14:44:53,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:44:53,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:53,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:44:53,988 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:44:53,990 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 (20)] Waiting until timeout for monitored process [2024-09-08 14:44:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:44:54,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-08 14:44:54,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:44:54,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:44:54,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:44:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:44:54,223 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:44:54,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:44:54,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2024-09-08 14:44:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:44:54,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:44:54,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881916139] [2024-09-08 14:44:54,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881916139] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:44:54,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 14:44:54,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-09-08 14:44:54,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585230084] [2024-09-08 14:44:54,691 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 14:44:54,692 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-08 14:44:54,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:44:54,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-08 14:44:54,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-08 14:44:54,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:54,693 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:44:54,693 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:44:54,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:54,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:44:54,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:54,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:55,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:55,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:44:55,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:55,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:44:55,842 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 (20)] Forceful destruction successful, exit code 0 [2024-09-08 14:44:56,036 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:56,037 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:44:56,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:44:56,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1735664697, now seen corresponding path program 1 times [2024-09-08 14:44:56,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:44:56,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108431] [2024-09-08 14:44:56,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:44:56,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:56,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:44:56,041 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:44:56,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-09-08 14:44:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:44:56,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-08 14:44:56,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:44:56,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:44:56,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:44:56,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:44:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:44:56,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:44:56,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:44:56,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2024-09-08 14:44:56,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:44:56,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:44:56,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108431] [2024-09-08 14:44:56,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108431] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:44:56,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 14:44:56,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-09-08 14:44:56,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422103473] [2024-09-08 14:44:56,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 14:44:56,807 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-08 14:44:56,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:44:56,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-08 14:44:56,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-09-08 14:44:56,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:56,808 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:44:56,808 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:44:56,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:56,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:44:56,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:56,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:44:56,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:44:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:44:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:44:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:44:58,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:44:58,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-09-08 14:44:58,624 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:58,625 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:44:58,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:44:58,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1713115543, now seen corresponding path program 1 times [2024-09-08 14:44:58,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:44:58,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668859715] [2024-09-08 14:44:58,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:44:58,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:44:58,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:44:58,629 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:44:58,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-09-08 14:44:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:44:58,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-08 14:44:58,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:44:58,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:44:58,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:44:58,990 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-08 14:44:58,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 22 [2024-09-08 14:44:59,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:44:59,073 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:44:59,157 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) is different from false [2024-09-08 14:44:59,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:44:59,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2024-09-08 14:45:00,338 INFO L349 Elim1Store]: treesize reduction 96, result has 38.9 percent of original size [2024-09-08 14:45:00,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 157 treesize of output 208 [2024-09-08 14:45:00,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 129 [2024-09-08 14:45:00,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 127 [2024-09-08 14:45:00,553 INFO L349 Elim1Store]: treesize reduction 68, result has 44.7 percent of original size [2024-09-08 14:45:00,553 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 188 treesize of output 220 [2024-09-08 14:45:00,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 136 [2024-09-08 14:45:00,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:45:00,673 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 201 treesize of output 241 [2024-09-08 14:45:00,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 153 [2024-09-08 14:45:00,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 151 [2024-09-08 14:45:01,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-09-08 14:45:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:45:01,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:45:01,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668859715] [2024-09-08 14:45:01,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668859715] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:45:01,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 14:45:01,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-09-08 14:45:01,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511615043] [2024-09-08 14:45:01,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 14:45:01,204 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-08 14:45:01,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:45:01,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-08 14:45:01,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=160, Unknown=1, NotChecked=26, Total=240 [2024-09-08 14:45:01,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:45:01,206 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:45:01,206 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 15 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:45:01,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:01,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:45:01,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:01,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:01,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:01,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:45:10,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:10,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:45:10,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:10,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:10,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:10,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-08 14:45:10,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-09-08 14:45:10,771 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:45:10,771 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:45:10,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:45:10,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1041932451, now seen corresponding path program 2 times [2024-09-08 14:45:10,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:45:10,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608749336] [2024-09-08 14:45:10,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 14:45:10,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:45:10,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:45:10,774 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:45:10,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-09-08 14:45:10,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-08 14:45:10,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 14:45:10,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-08 14:45:10,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:45:10,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-09-08 14:45:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 14:45:10,909 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:45:10,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:45:10,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608749336] [2024-09-08 14:45:10,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608749336] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:45:10,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:45:10,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 14:45:10,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202712533] [2024-09-08 14:45:10,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:45:10,910 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 14:45:10,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:45:10,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 14:45:10,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 14:45:10,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:45:10,910 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:45:10,911 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:45:10,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:10,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:45:10,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:10,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:10,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:10,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-09-08 14:45:10,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:45:11,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:11,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:45:11,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:11,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:11,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:11,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-08 14:45:11,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:45:11,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-09-08 14:45:11,915 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:45:11,916 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:45:11,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:45:11,916 INFO L85 PathProgramCache]: Analyzing trace with hash 323244207, now seen corresponding path program 3 times [2024-09-08 14:45:11,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:45:11,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474481390] [2024-09-08 14:45:11,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-08 14:45:11,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:45:11,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:45:11,918 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:45:11,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-09-08 14:45:12,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-09-08 14:45:12,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 14:45:12,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-08 14:45:12,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:45:12,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-09-08 14:45:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 14:45:12,082 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:45:12,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:45:12,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474481390] [2024-09-08 14:45:12,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474481390] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:45:12,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:45:12,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 14:45:12,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214775874] [2024-09-08 14:45:12,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:45:12,083 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 14:45:12,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:45:12,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 14:45:12,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 14:45:12,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:45:12,083 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:45:12,084 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:45:12,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:12,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:45:12,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:12,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:12,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:12,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-09-08 14:45:12,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:45:12,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:45:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:45:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-08 14:45:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:45:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:45:12,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-09-08 14:45:13,008 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:45:13,009 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:45:13,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:45:13,009 INFO L85 PathProgramCache]: Analyzing trace with hash 514293891, now seen corresponding path program 4 times [2024-09-08 14:45:13,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:45:13,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433210299] [2024-09-08 14:45:13,010 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-08 14:45:13,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:45:13,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:45:13,011 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:45:13,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-09-08 14:45:13,141 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-08 14:45:13,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 14:45:13,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-08 14:45:13,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:45:13,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:45:13,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:45:13,301 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-08 14:45:13,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-09-08 14:45:13,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-09-08 14:45:13,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-09-08 14:45:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:45:13,537 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:45:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 14:45:14,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:45:14,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433210299] [2024-09-08 14:45:14,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433210299] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-08 14:45:14,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-08 14:45:14,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2024-09-08 14:45:14,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367546319] [2024-09-08 14:45:14,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:45:14,040 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-08 14:45:14,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:45:14,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-08 14:45:14,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=337, Unknown=6, NotChecked=0, Total=420 [2024-09-08 14:45:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:45:14,041 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:45:14,041 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:45:14,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:14,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:45:14,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:14,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:14,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:14,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-09-08 14:45:14,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:45:14,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:45:14,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:45:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:45:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:17,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-08 14:45:17,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:45:17,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:45:17,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:45:17,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-09-08 14:45:17,317 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:45:17,318 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:45:17,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:45:17,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1805406597, now seen corresponding path program 5 times [2024-09-08 14:45:17,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:45:17,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357046210] [2024-09-08 14:45:17,319 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-08 14:45:17,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:45:17,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:45:17,320 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:45:17,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-09-08 14:45:17,457 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-09-08 14:45:17,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 14:45:17,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-08 14:45:17,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:45:17,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:45:17,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-09-08 14:45:17,609 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 14:45:17,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-09-08 14:45:17,655 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-09-08 14:45:17,655 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 1 case distinctions, treesize of input 20 treesize of output 27 [2024-09-08 14:45:17,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-08 14:45:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:45:17,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:45:17,870 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (or (not .cse0) (forall ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) is different from false [2024-09-08 14:45:17,891 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))))) .cse0) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))))) (not .cse0)))) is different from false [2024-09-08 14:45:18,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-09-08 14:45:18,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-09-08 14:45:18,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:45:18,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2024-09-08 14:45:18,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:45:18,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-09-08 14:45:18,551 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 100 treesize of output 96 [2024-09-08 14:45:18,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-09-08 14:45:18,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:45:18,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357046210] [2024-09-08 14:45:18,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357046210] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:45:18,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 14:45:18,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-09-08 14:45:18,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585854537] [2024-09-08 14:45:18,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 14:45:18,640 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-08 14:45:18,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:45:18,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-08 14:45:18,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=225, Unknown=11, NotChecked=66, Total=380 [2024-09-08 14:45:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:45:18,641 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:45:18,641 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.05) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:45:18,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:18,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:45:18,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:18,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:18,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:18,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-09-08 14:45:18,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:45:18,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:45:18,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:45:18,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:45:19,470 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) (not (= (_ bv0 32) c_~top~0)) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or .cse0 (and (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))))) (= (_ bv3 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (or (not .cse0) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))))) is different from false [2024-09-08 14:45:20,185 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or .cse0 (and (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))))) (= (_ bv3 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (or (not .cse0) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))))) is different from false [2024-09-08 14:45:21,483 WARN L854 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) c_~top~0)) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) is different from false [2024-09-08 14:45:24,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:45:28,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-08 14:45:30,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:45:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:45:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-08 14:45:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:45:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:45:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:45:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-09-08 14:45:35,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-09-08 14:45:36,038 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:45:36,038 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:45:36,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:45:36,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1133926884, now seen corresponding path program 1 times [2024-09-08 14:45:36,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:45:36,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964810285] [2024-09-08 14:45:36,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:45:36,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:45:36,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:45:36,041 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:45:36,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-09-08 14:45:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:45:36,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-08 14:45:36,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:45:36,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-09-08 14:45:36,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:45:36,301 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 14:45:36,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-09-08 14:45:36,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-08 14:45:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:45:36,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:45:36,500 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (_ bv64 32))) (forall ((v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (_ bv2 32))))) is different from false [2024-09-08 14:45:36,536 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|))) (forall ((v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_10) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|))) (forall ((v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (select (select (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_10) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (_ bv64 32))))) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|))) (forall ((v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_10) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) is different from false [2024-09-08 14:45:36,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:45:36,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2024-09-08 14:45:36,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:45:36,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-09-08 14:45:36,910 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 193 treesize of output 177 [2024-09-08 14:45:36,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 22 treesize of output 20 [2024-09-08 14:45:36,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-09-08 14:45:36,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 10 treesize of output 8 [2024-09-08 14:45:36,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-09-08 14:45:36,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 9 treesize of output 7 [2024-09-08 14:45:36,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 10 treesize of output 8 [2024-09-08 14:45:36,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-09-08 14:45:37,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-09-08 14:45:37,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-09-08 14:45:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-09-08 14:45:37,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:45:37,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964810285] [2024-09-08 14:45:37,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964810285] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:45:37,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 14:45:37,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-09-08 14:45:37,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282545668] [2024-09-08 14:45:37,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 14:45:37,194 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-08 14:45:37,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:45:37,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-08 14:45:37,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=100, Unknown=2, NotChecked=42, Total=182 [2024-09-08 14:45:37,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:45:37,196 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:45:37,197 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:45:37,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:37,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:45:37,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:37,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:37,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:37,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-09-08 14:45:37,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:45:37,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:45:37,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:45:37,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-09-08 14:45:37,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:45:40,971 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse1 (not .cse0))) (and (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))))) .cse0) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) (or .cse0 (and (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))))) .cse1) (= (_ bv3 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (or .cse1 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))))) is different from false [2024-09-08 14:45:41,242 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse1 (not .cse0))) (and (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))))) .cse0) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) (not (= (_ bv0 32) c_~top~0)) (or .cse0 (and (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))))) .cse1) (= (_ bv3 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (or .cse1 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))))) is different from false [2024-09-08 14:45:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:45:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-08 14:45:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:45:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:45:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:45:41,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-09-08 14:45:41,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-08 14:45:41,317 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 (27)] Forceful destruction successful, exit code 0 [2024-09-08 14:45:41,514 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:45:41,514 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:45:41,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:45:41,515 INFO L85 PathProgramCache]: Analyzing trace with hash 776773429, now seen corresponding path program 6 times [2024-09-08 14:45:41,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:45:41,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734258587] [2024-09-08 14:45:41,515 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-08 14:45:41,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:45:41,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:45:41,516 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:45:41,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-09-08 14:45:41,632 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-09-08 14:45:41,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 14:45:41,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-08 14:45:41,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:45:41,737 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-09-08 14:45:41,738 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 3 case distinctions, treesize of input 47 treesize of output 72 [2024-09-08 14:45:41,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-09-08 14:45:41,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 14 treesize of output 9 [2024-09-08 14:45:41,854 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 14 treesize of output 9 [2024-09-08 14:45:41,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-09-08 14:45:42,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-09-08 14:45:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 14:45:42,041 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:45:42,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:45:42,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734258587] [2024-09-08 14:45:42,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734258587] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:45:42,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:45:42,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-08 14:45:42,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118187005] [2024-09-08 14:45:42,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:45:42,042 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-08 14:45:42,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:45:42,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-08 14:45:42,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-08 14:45:42,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:45:42,042 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:45:42,043 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:45:42,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:42,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:45:42,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:45:42,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:42,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:45:42,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-09-08 14:45:42,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:45:42,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:45:42,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:45:42,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-09-08 14:45:42,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-09-08 14:45:42,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:45:44,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:45:46,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:45:48,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:45:50,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:45:52,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:45:55,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:45:57,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:45:59,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:01,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:03,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:05,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:07,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:09,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:11,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:13,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:15,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:18,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:20,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:22,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:24,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:26,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:28,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:30,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:32,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:34,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-09-08 14:46:36,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:38,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:40,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:42,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:46:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:46:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:46:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:46:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:46:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-08 14:46:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:46:42,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:46:42,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:46:42,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-09-08 14:46:42,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-08 14:46:42,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:46:42,395 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 (28)] Ended with exit code 0 [2024-09-08 14:46:42,590 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:46:42,590 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:46:42,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:46:42,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2135642081, now seen corresponding path program 1 times [2024-09-08 14:46:42,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:46:42,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150234285] [2024-09-08 14:46:42,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:46:42,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:46:42,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:46:42,593 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:46:42,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-09-08 14:46:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:46:42,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-08 14:46:42,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:46:42,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:46:42,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:46:42,896 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-08 14:46:42,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2024-09-08 14:46:43,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:46:43,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2024-09-08 14:46:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 14:46:43,055 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:46:45,627 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (not .cse0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) (or (let ((.cse1 (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (not .cse1)) (or .cse1 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32))) (not (= (_ bv0 32) (select (select (let ((.cse2 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (store .cse2 |thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store (select .cse2 |thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0)))) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) .cse0))) is different from false [2024-09-08 14:46:46,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:46:46,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2024-09-08 14:46:46,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:46:46,085 INFO L378 Elim1Store]: Elim1 eliminated variable 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 21 treesize of output 22 [2024-09-08 14:46:46,090 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 35 treesize of output 27 [2024-09-08 14:46:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 14:46:46,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:46:46,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150234285] [2024-09-08 14:46:46,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150234285] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:46:46,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 14:46:46,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2024-09-08 14:46:46,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068516889] [2024-09-08 14:46:46,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 14:46:46,216 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-08 14:46:46,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:46:46,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-08 14:46:46,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=188, Unknown=1, NotChecked=28, Total=272 [2024-09-08 14:46:46,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:46:46,217 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:46:46,217 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 16 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:46:46,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:46:46,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:46:46,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:46:46,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:46:46,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:46:46,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-09-08 14:46:46,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:46:46,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:46:46,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:46:46,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-09-08 14:46:46,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-09-08 14:46:46,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:46:46,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:46:50,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:54,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:46:57,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:46:59,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:47:01,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:47:03,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:47:05,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-08 14:47:12,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:47:14,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:47:17,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:47:19,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:47:21,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:47:23,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:47:26,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:47:29,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:47:32,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:47:34,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:47:36,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:47:38,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:47:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:47:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:47:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:47:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:47:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-08 14:47:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:47:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:47:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:47:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-09-08 14:47:38,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:47:38,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:47:38,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-08 14:47:38,109 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-09-08 14:47:38,304 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:47:38,304 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:47:38,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:47:38,305 INFO L85 PathProgramCache]: Analyzing trace with hash 596559115, now seen corresponding path program 7 times [2024-09-08 14:47:38,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:47:38,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319782853] [2024-09-08 14:47:38,305 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-08 14:47:38,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:47:38,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:47:38,307 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:47:38,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-09-08 14:47:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:47:38,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-08 14:47:38,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:47:38,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:47:38,549 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-08 14:47:38,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 22 [2024-09-08 14:47:38,674 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-08 14:47:38,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2024-09-08 14:47:38,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:47:38,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2024-09-08 14:47:38,947 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:47:38,947 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:47:39,061 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (not .cse0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0))) is different from false [2024-09-08 14:47:39,364 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or .cse0 (let ((.cse1 (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (not .cse1) (forall ((v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_77 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_18) v_prenex_77 v_DerPreprocessor_16) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse1 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (let ((.cse2 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_18))) (store .cse2 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select .cse2 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0)))) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))))) (or (not .cse0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_17) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) is different from false [2024-09-08 14:47:39,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:47:39,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2024-09-08 14:47:39,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:47:39,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-09-08 14:47:40,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:47:40,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 707 treesize of output 795 [2024-09-08 14:47:40,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 414 treesize of output 406 [2024-09-08 14:47:40,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 406 treesize of output 404 [2024-09-08 14:47:40,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 404 treesize of output 400 [2024-09-08 14:47:40,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 400 treesize of output 396 [2024-09-08 14:47:40,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 396 treesize of output 394 [2024-09-08 14:47:40,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 392 [2024-09-08 14:47:40,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:47:40,438 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 392 treesize of output 397 [2024-09-08 14:47:40,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 388 treesize of output 384 [2024-09-08 14:47:42,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:47:42,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 55 [2024-09-08 14:47:42,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:47:42,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:47:42,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319782853] [2024-09-08 14:47:42,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319782853] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:47:42,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 14:47:42,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2024-09-08 14:47:42,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907565133] [2024-09-08 14:47:42,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 14:47:42,268 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-08 14:47:42,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:47:42,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-08 14:47:42,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=200, Unknown=14, NotChecked=62, Total=342 [2024-09-08 14:47:42,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:47:42,268 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:47:42,268 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 18 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:47:42,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:47:42,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:47:42,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:47:42,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:47:42,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:47:42,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-09-08 14:47:42,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:47:42,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:47:42,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:47:42,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-09-08 14:47:42,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:47:42,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:47:42,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-09-08 14:47:42,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:47:52,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:47:57,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:47:58,576 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or .cse0 (and (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))))) (= (_ bv3 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (or (not .cse0) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))) (= (_ bv3 32) c_~top~0))) is different from false [2024-09-08 14:48:01,694 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (and (bvsle .cse0 (_ bv64 32)) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|))) (forall ((v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_10) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (not (= (_ bv2 32) c_~top~0)) (not (= .cse0 (_ bv2 32))) (bvsle (_ bv0 32) c_~top~0) (bvsle (_ bv0 32) .cse0) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|))) (forall ((v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (select (select (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_10) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (_ bv64 32))))) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|))) (forall ((v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_10) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))) (bvsle c_~top~0 (_ bv64 32)))) is different from false [2024-09-08 14:48:04,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:48:06,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:48:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:48:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:48:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:48:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:48:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:48:06,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-08 14:48:06,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:48:06,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:48:06,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:48:06,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-08 14:48:06,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-08 14:48:06,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:48:06,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:48:06,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-08 14:48:06,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2024-09-08 14:48:07,077 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:48:07,077 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:48:07,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:48:07,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2138877540, now seen corresponding path program 2 times [2024-09-08 14:48:07,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:48:07,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595963645] [2024-09-08 14:48:07,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 14:48:07,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:48:07,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:48:07,079 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:48:07,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2024-09-08 14:48:07,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 14:48:07,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 14:48:07,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-08 14:48:07,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:48:07,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:48:07,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:48:07,262 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 14:48:07,262 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:48:07,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:48:07,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2024-09-08 14:48:07,600 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 14:48:07,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:48:07,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595963645] [2024-09-08 14:48:07,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595963645] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:48:07,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 14:48:07,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-09-08 14:48:07,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572705824] [2024-09-08 14:48:07,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 14:48:07,601 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-08 14:48:07,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:48:07,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-08 14:48:07,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-08 14:48:07,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:48:07,602 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:48:07,602 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:48:07,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:48:07,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:48:07,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:48:07,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:48:07,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:48:07,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-08 14:48:07,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:48:07,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:48:07,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:48:07,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-09-08 14:48:07,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-08 14:48:07,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:48:07,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:48:07,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-09-08 14:48:07,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:48:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:48:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:48:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:48:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:48:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:48:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-08 14:48:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:48:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:48:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:48:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-08 14:48:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-08 14:48:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:48:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:48:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-08 14:48:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:48:10,900 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-09-08 14:48:11,096 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:48:11,097 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:48:11,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:48:11,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1367166121, now seen corresponding path program 8 times [2024-09-08 14:48:11,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:48:11,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663962332] [2024-09-08 14:48:11,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 14:48:11,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:48:11,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:48:11,099 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:48:11,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 (32)] Waiting until timeout for monitored process [2024-09-08 14:48:11,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 14:48:11,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 14:48:11,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-08 14:48:11,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:48:11,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-09-08 14:48:11,292 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 14:48:11,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-09-08 14:48:11,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:48:11,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-08 14:48:11,473 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-08 14:48:11,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 22 [2024-09-08 14:48:11,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:48:11,539 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:48:11,788 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33| (_ BitVec 32)) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22))) (or (not (= (_ bv0 32) (select (select (store .cse0 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 32) (bvadd (_ bv1 32) (select (select .cse0 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33|) (_ bv0 32)))))))) is different from false [2024-09-08 14:48:11,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:48:11,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2024-09-08 14:48:11,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:48:11,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-09-08 14:48:11,921 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-09-08 14:48:11,922 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 201 treesize of output 205 [2024-09-08 14:48:11,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:48:11,944 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 121 treesize of output 126 [2024-09-08 14:48:11,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2024-09-08 14:48:12,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-09-08 14:48:12,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-09-08 14:48:12,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:48:12,246 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 167 treesize of output 162 [2024-09-08 14:48:12,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:48:12,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 84 treesize of output 89 [2024-09-08 14:48:12,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2024-09-08 14:48:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:48:12,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:48:12,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663962332] [2024-09-08 14:48:12,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663962332] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:48:12,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 14:48:12,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-09-08 14:48:12,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195997003] [2024-09-08 14:48:12,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 14:48:12,821 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-08 14:48:12,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:48:12,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-08 14:48:12,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=4, NotChecked=30, Total=306 [2024-09-08 14:48:12,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:48:12,822 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:48:12,822 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.611111111111111) internal successors, (101), 17 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:48:12,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:48:12,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:48:12,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:48:12,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:48:12,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:48:12,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-08 14:48:12,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:48:12,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:48:12,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:48:12,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-09-08 14:48:12,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-08 14:48:12,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:48:12,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:48:12,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-09-08 14:48:12,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:48:12,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:48:13,949 WARN L854 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33| (_ BitVec 32)) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22))) (or (not (= (_ bv0 32) (select (select (store .cse0 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 32) (bvadd (_ bv1 32) (select (select .cse0 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33|) (_ bv0 32)))))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33| (_ BitVec 32)) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (bvadd (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33|) (_ bv0 32)) (_ bv1 32)) (_ bv0 32))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) is different from false [2024-09-08 14:48:16,785 WARN L854 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) c_~top~0)) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33| (_ BitVec 32)) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (bvadd (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33|) (_ bv0 32)) (_ bv1 32)) (_ bv0 32))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_33| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) is different from false [2024-09-08 14:48:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:48:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:48:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:48:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:48:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:48:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-08 14:48:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:48:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:48:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:48:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-08 14:48:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-08 14:48:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:48:22,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:48:22,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-08 14:48:22,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:48:22,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-09-08 14:48:22,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 (32)] Forceful destruction successful, exit code 0 [2024-09-08 14:48:22,435 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:48:22,436 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:48:22,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:48:22,436 INFO L85 PathProgramCache]: Analyzing trace with hash -361057653, now seen corresponding path program 9 times [2024-09-08 14:48:22,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:48:22,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804291324] [2024-09-08 14:48:22,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-08 14:48:22,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:48:22,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:48:22,440 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:48:22,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 (33)] Waiting until timeout for monitored process [2024-09-08 14:48:22,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-08 14:48:22,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 14:48:22,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-08 14:48:22,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:48:22,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:48:22,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:48:22,719 INFO L349 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2024-09-08 14:48:22,720 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 25 [2024-09-08 14:48:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 14:48:23,013 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:48:23,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:48:23,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2024-09-08 14:48:23,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:48:23,899 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 635 treesize of output 625 [2024-09-08 14:48:23,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 187 [2024-09-08 14:48:23,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 167 [2024-09-08 14:48:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 14:48:24,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:48:24,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804291324] [2024-09-08 14:48:24,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804291324] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:48:24,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 14:48:24,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-09-08 14:48:24,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951496655] [2024-09-08 14:48:24,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 14:48:24,046 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-08 14:48:24,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:48:24,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-08 14:48:24,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2024-09-08 14:48:24,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:48:24,047 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:48:24,047 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 17 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:48:24,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:48:24,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:48:24,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:48:24,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:48:24,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:48:24,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-08 14:48:24,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:48:24,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:48:24,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:48:24,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-09-08 14:48:24,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-08 14:48:24,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:48:24,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:48:24,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-09-08 14:48:24,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:48:24,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-09-08 14:48:24,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:48:28,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:48:30,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:48:37,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:48:39,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:48:41,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:48:44,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:48:46,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:48:48,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:48:50,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-09-08 14:48:52,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:48:56,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:48:58,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:49:00,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:49:02,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:49:06,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:49:06,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:49:06,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:49:06,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:49:06,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:49:06,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-08 14:49:06,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:49:06,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:49:06,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:49:06,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-08 14:49:06,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-08 14:49:06,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:49:06,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:49:06,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-09-08 14:49:06,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:49:06,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-09-08 14:49:06,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-09-08 14:49:06,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2024-09-08 14:49:06,740 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:49:06,740 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:49:06,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:49:06,741 INFO L85 PathProgramCache]: Analyzing trace with hash -940743397, now seen corresponding path program 10 times [2024-09-08 14:49:06,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:49:06,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968906498] [2024-09-08 14:49:06,741 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-08 14:49:06,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:49:06,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:49:06,742 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:49:06,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 (34)] Waiting until timeout for monitored process [2024-09-08 14:49:06,854 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-08 14:49:06,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 14:49:06,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-08 14:49:06,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:49:06,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-09-08 14:49:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 14:49:06,904 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:49:06,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:49:06,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968906498] [2024-09-08 14:49:06,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [968906498] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:49:06,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:49:06,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 14:49:06,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763145818] [2024-09-08 14:49:06,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:49:06,904 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 14:49:06,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:49:06,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 14:49:06,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 14:49:06,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:49:06,905 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:49:06,905 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:49:06,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:49:06,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:49:06,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:49:06,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:49:06,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 14:49:06,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-09-08 14:49:06,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:49:06,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:49:06,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:49:06,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-09-08 14:49:06,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-08 14:49:06,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:49:06,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:49:06,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-09-08 14:49:06,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:49:06,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-09-08 14:49:06,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-09-08 14:49:06,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:49:12,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:49:15,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:49:15,174 WARN L854 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) c_~top~0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (bvadd (_ bv1 32) (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_19|) (_ bv0 32))))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_3) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= (_ bv3 32) c_~next_alloc_idx~0) (= (_ bv0 32) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (forall ((v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))))) is different from false [2024-09-08 14:49:15,619 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or .cse0 (and (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))))) (or (not .cse0) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))))) is different from false [2024-09-08 14:49:16,556 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or .cse0 (and (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))))) (or (not .cse0) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))) (= (_ bv3 32) c_~top~0))) is different from false [2024-09-08 14:49:17,180 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (bvadd (_ bv1 32) (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_19|) (_ bv0 32))))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_3) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= (_ bv3 32) c_~next_alloc_idx~0) (= (_ bv0 32) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (forall ((v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))))) is different from false [2024-09-08 14:49:20,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:49:22,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:49:24,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:49:26,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:49:29,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:49:32,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:49:34,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 [1] [2024-09-08 14:49:36,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-08 14:49:38,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:49:40,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:49:42,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:49:44,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:49:45,094 WARN L854 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (= (_ bv1 32) c_~next_alloc_idx~0)) is different from false [2024-09-08 14:49:47,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:49:47,344 WARN L854 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (= (_ bv3 32) c_~next_alloc_idx~0) (exists ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32))) (not (= (select (select |c_#memory_int| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) is different from false [2024-09-08 14:49:52,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:49:54,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:49:56,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:49:58,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:50:00,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:50:03,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:50:05,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:50:07,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:50:10,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:50:13,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:50:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:50:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:50:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:50:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:50:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-08 14:50:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-09-08 14:50:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:50:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:50:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:50:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-09-08 14:50:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-08 14:50:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:50:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-08 14:50:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-09-08 14:50:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:50:14,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-09-08 14:50:14,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-08 14:50:14,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:50:14,413 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-09-08 14:50:14,609 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:50:14,609 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:50:14,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:50:14,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1596796599, now seen corresponding path program 11 times [2024-09-08 14:50:14,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:50:14,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465829074] [2024-09-08 14:50:14,610 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-08 14:50:14,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:50:14,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:50:14,611 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:50:14,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2024-09-08 14:50:14,760 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-09-08 14:50:14,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 14:50:14,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-08 14:50:14,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:50:14,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-09-08 14:50:14,823 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 14:50:14,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-09-08 14:50:14,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:50:14,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:50:14,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-08 14:50:14,954 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:50:14,954 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:50:15,038 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_25 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) is different from false [2024-09-08 14:50:15,073 WARN L854 $PredicateComparison]: unable to prove that (and (or (not (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_25 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))))) is different from false [2024-09-08 14:50:15,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:50:15,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2024-09-08 14:50:15,133 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 14:50:15,387 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:50:15,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:50:15,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465829074] [2024-09-08 14:50:15,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465829074] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:50:15,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 14:50:15,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-09-08 14:50:15,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263919695] [2024-09-08 14:50:15,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 14:50:15,388 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-08 14:50:15,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:50:15,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-08 14:50:15,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=143, Unknown=2, NotChecked=50, Total=240 [2024-09-08 14:50:15,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:50:15,389 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:50:15,389 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 15 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:50:15,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:50:15,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:50:15,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:50:15,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:50:15,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-09-08 14:50:15,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-09-08 14:50:15,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:50:15,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:50:15,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:50:15,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-09-08 14:50:15,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-08 14:50:15,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:50:15,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-09-08 14:50:15,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-09-08 14:50:15,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:50:15,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-09-08 14:50:15,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-09-08 14:50:15,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:50:15,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:50:20,633 WARN L854 $PredicateComparison]: unable to prove that (and (or (not (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_25 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (not (= (_ bv0 32) c_~top~0))) is different from false [2024-09-08 14:50:37,103 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse1 (not .cse0))) (and (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))))) .cse0) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (or .cse0 (and (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))))) .cse1) (or .cse1 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))))) is different from false [2024-09-08 14:50:37,230 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse1 (not .cse0))) (and (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))))) .cse0) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 32) c_~top~0)) (or .cse0 (and (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))))) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|))))) .cse1) (or .cse1 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_8) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| v_DerPreprocessor_7) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))))) is different from false [2024-09-08 14:50:39,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:50:41,641 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-09-08 14:50:45,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:50:47,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:50:49,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:50:51,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:50:51,683 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (not .cse0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) (_ bv0 32) c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0) (not (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) is different from false [2024-09-08 14:50:51,808 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (not .cse0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))) (not (= (_ bv0 32) c_~top~0)) (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) (_ bv0 32) c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))) .cse0))) is different from false [2024-09-08 14:50:54,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:50:59,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:51:01,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:51:03,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:51:05,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:51:07,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:51:09,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:51:15,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:51:18,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:51:20,032 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-09-08 14:51:20,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:20,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:51:20,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:51:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-08 14:51:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-09-08 14:51:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:51:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:51:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:51:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-09-08 14:51:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-08 14:51:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:51:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-08 14:51:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-09-08 14:51:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:51:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-09-08 14:51:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-09-08 14:51:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:51:20,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-09-08 14:51:20,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Ended with exit code 0 [2024-09-08 14:51:20,947 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:20,947 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:51:20,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:51:20,948 INFO L85 PathProgramCache]: Analyzing trace with hash 185894800, now seen corresponding path program 1 times [2024-09-08 14:51:20,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:51:20,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075536729] [2024-09-08 14:51:20,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:51:20,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:20,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:51:20,952 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:51:20,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 (36)] Waiting until timeout for monitored process [2024-09-08 14:51:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:51:21,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-08 14:51:21,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:51:21,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:51:21,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:51:21,299 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-08 14:51:21,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 22 [2024-09-08 14:51:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 14:51:21,335 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:51:21,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:51:21,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075536729] [2024-09-08 14:51:21,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075536729] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:51:21,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:51:21,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-08 14:51:21,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964690364] [2024-09-08 14:51:21,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:51:21,336 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-08 14:51:21,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:51:21,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-08 14:51:21,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-09-08 14:51:21,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:21,337 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:51:21,337 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:51:21,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:21,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:51:21,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:21,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:51:21,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-09-08 14:51:21,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-09-08 14:51:21,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:51:21,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:51:21,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:51:21,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-09-08 14:51:21,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-08 14:51:21,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:51:21,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-09-08 14:51:21,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-09-08 14:51:21,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:51:21,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-09-08 14:51:21,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-09-08 14:51:21,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:51:21,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-09-08 14:51:21,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:30,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:51:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:51:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-08 14:51:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-09-08 14:51:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:51:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:51:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:51:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-09-08 14:51:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-08 14:51:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:51:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-08 14:51:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-09-08 14:51:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:51:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-09-08 14:51:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-09-08 14:51:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:51:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-09-08 14:51:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 14:51:30,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2024-09-08 14:51:30,850 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:30,851 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:51:30,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:51:30,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1245668083, now seen corresponding path program 12 times [2024-09-08 14:51:30,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:51:30,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771068724] [2024-09-08 14:51:30,852 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-08 14:51:30,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:30,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:51:30,853 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:51:30,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2024-09-08 14:51:30,994 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-09-08 14:51:30,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 14:51:30,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-08 14:51:30,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:51:31,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:51:31,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:51:31,101 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-09-08 14:51:31,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2024-09-08 14:51:31,307 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2024-09-08 14:51:31,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 35 [2024-09-08 14:51:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 14:51:31,354 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:51:31,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:51:31,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771068724] [2024-09-08 14:51:31,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771068724] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:51:31,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:51:31,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-08 14:51:31,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969735960] [2024-09-08 14:51:31,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:51:31,355 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-08 14:51:31,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:51:31,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-08 14:51:31,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-09-08 14:51:31,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:31,355 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:51:31,355 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:51:31,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:31,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:51:31,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:31,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:51:31,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-09-08 14:51:31,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-09-08 14:51:31,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:51:31,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:51:31,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:51:31,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-09-08 14:51:31,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-08 14:51:31,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:51:31,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-09-08 14:51:31,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-09-08 14:51:31,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:51:31,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-09-08 14:51:31,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-09-08 14:51:31,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:51:31,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-09-08 14:51:31,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 14:51:31,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:41,522 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (and (bvsle .cse0 (_ bv64 32)) (forall ((v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (_ bv64 32))) (not (= .cse0 (_ bv2 32))) (bvsle (_ bv0 32) .cse0) (forall ((v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (bvsle (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (_ bv2 32)))))) is different from false [2024-09-08 14:51:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:51:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:51:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-08 14:51:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-09-08 14:51:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:51:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:51:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-08 14:51:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-09-08 14:51:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-08 14:51:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:51:42,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-08 14:51:42,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-09-08 14:51:42,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-08 14:51:42,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-09-08 14:51:42,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-09-08 14:51:42,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:51:42,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-09-08 14:51:42,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 14:51:42,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 14:51:42,233 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 3 remaining) [2024-09-08 14:51:42,233 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 3 remaining) [2024-09-08 14:51:42,233 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-09-08 14:51:42,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2024-09-08 14:51:42,435 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:42,438 INFO L408 BasicCegarLoop]: Path program histogram: [12, 2, 1, 1, 1, 1, 1, 1, 1] [2024-09-08 14:51:42,438 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork0 was SAFE,SAFE,SAFE (1/4) [2024-09-08 14:51:42,440 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 14:51:42,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 14:51:42,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:51:42,442 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 14:51:42,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (38)] Waiting until timeout for monitored process [2024-09-08 14:51:42,446 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 14:51:42,446 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 14:51:42,446 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@18cf5a34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 14:51:42,446 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 14:51:42,681 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 14:51:42,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:51:42,681 INFO L85 PathProgramCache]: Analyzing trace with hash -555703562, now seen corresponding path program 1 times [2024-09-08 14:51:42,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:51:42,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131191416] [2024-09-08 14:51:42,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:51:42,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:42,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:51:42,686 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:51:42,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2024-09-08 14:51:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:51:42,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-08 14:51:42,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:51:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 14:51:42,835 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:51:42,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:51:42,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131191416] [2024-09-08 14:51:42,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131191416] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:51:42,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:51:42,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 14:51:42,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291946165] [2024-09-08 14:51:42,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:51:42,836 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 14:51:42,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:51:42,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 14:51:42,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 14:51:42,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:42,836 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:51:42,837 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:51:42,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:42,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:42,998 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 (39)] Ended with exit code 0 [2024-09-08 14:51:43,192 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:43,193 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 14:51:43,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:51:43,193 INFO L85 PathProgramCache]: Analyzing trace with hash 147822936, now seen corresponding path program 1 times [2024-09-08 14:51:43,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:51:43,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823289238] [2024-09-08 14:51:43,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:51:43,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:43,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:51:43,198 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:51:43,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2024-09-08 14:51:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:51:43,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-08 14:51:43,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:51:43,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:51:43,368 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 14:51:43,368 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:51:43,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:51:43,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823289238] [2024-09-08 14:51:43,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823289238] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:51:43,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:51:43,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 14:51:43,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878668079] [2024-09-08 14:51:43,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:51:43,369 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 14:51:43,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:51:43,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 14:51:43,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 14:51:43,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:43,370 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:51:43,370 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:51:43,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:43,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:43,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:43,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:51:43,562 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 (40)] Forceful destruction successful, exit code 0 [2024-09-08 14:51:43,757 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:43,758 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 14:51:43,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:51:43,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2981853, now seen corresponding path program 1 times [2024-09-08 14:51:43,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:51:43,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972217522] [2024-09-08 14:51:43,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:51:43,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:43,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:51:43,760 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:51:43,761 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 (41)] Waiting until timeout for monitored process [2024-09-08 14:51:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:51:43,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-08 14:51:43,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:51:43,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-09-08 14:51:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 14:51:43,914 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:51:43,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:51:43,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972217522] [2024-09-08 14:51:43,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972217522] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:51:43,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:51:43,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 14:51:43,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139759295] [2024-09-08 14:51:43,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:51:43,915 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 14:51:43,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:51:43,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 14:51:43,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 14:51:43,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:43,915 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:51:43,916 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:51:43,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:43,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:51:43,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:44,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:44,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:51:44,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:44,077 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 (41)] Forceful destruction successful, exit code 0 [2024-09-08 14:51:44,273 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:44,273 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 14:51:44,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:51:44,274 INFO L85 PathProgramCache]: Analyzing trace with hash -169642802, now seen corresponding path program 1 times [2024-09-08 14:51:44,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:51:44,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870868469] [2024-09-08 14:51:44,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:51:44,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:44,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:51:44,275 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:51:44,276 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 (42)] Waiting until timeout for monitored process [2024-09-08 14:51:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 14:51:44,416 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 14:51:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 14:51:44,499 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-09-08 14:51:44,500 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 14:51:44,500 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-08 14:51:44,507 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 (42)] Forceful destruction successful, exit code 0 [2024-09-08 14:51:44,700 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:44,701 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-09-08 14:51:44,702 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/4) [2024-09-08 14:51:44,702 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-08 14:51:44,702 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-09-08 14:51:44,726 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 14:51:44,728 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 14:51:44,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 14:51:44,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 14:51:44,731 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 14:51:44,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (43)] Waiting until timeout for monitored process [2024-09-08 14:51:44,734 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 14:51:44,735 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of4ForFork0 ======== [2024-09-08 14:51:44,735 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@18cf5a34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 14:51:44,735 INFO L337 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-09-08 14:51:45,070 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:51:45,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:51:45,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2096209069, now seen corresponding path program 1 times [2024-09-08 14:51:45,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:51:45,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805077467] [2024-09-08 14:51:45,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:51:45,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:45,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:51:45,075 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:51:45,076 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 (44)] Waiting until timeout for monitored process [2024-09-08 14:51:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:51:45,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-08 14:51:45,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:51:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 14:51:45,267 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:51:45,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:51:45,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805077467] [2024-09-08 14:51:45,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805077467] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:51:45,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:51:45,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 14:51:45,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698493384] [2024-09-08 14:51:45,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:51:45,268 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 14:51:45,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:51:45,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 14:51:45,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 14:51:45,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:45,268 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:51:45,268 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:51:45,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:45,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:45,412 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 (44)] Ended with exit code 0 [2024-09-08 14:51:45,608 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:45,608 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:51:45,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:51:45,609 INFO L85 PathProgramCache]: Analyzing trace with hash -649511549, now seen corresponding path program 1 times [2024-09-08 14:51:45,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:51:45,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549060594] [2024-09-08 14:51:45,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:51:45,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:45,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:51:45,610 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:51:45,614 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 (45)] Waiting until timeout for monitored process [2024-09-08 14:51:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:51:45,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-08 14:51:45,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:51:45,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:51:45,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 14:51:45,796 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:51:45,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:51:45,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549060594] [2024-09-08 14:51:45,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549060594] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:51:45,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:51:45,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 14:51:45,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350795039] [2024-09-08 14:51:45,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:51:45,797 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 14:51:45,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:51:45,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 14:51:45,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 14:51:45,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:45,798 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:51:45,798 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:51:45,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:45,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:45,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:45,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:51:46,000 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 (45)] Forceful destruction successful, exit code 0 [2024-09-08 14:51:46,196 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:46,196 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:51:46,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:51:46,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1224952038, now seen corresponding path program 1 times [2024-09-08 14:51:46,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:51:46,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704164964] [2024-09-08 14:51:46,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:51:46,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:46,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:51:46,198 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:51:46,200 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 (46)] Waiting until timeout for monitored process [2024-09-08 14:51:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:51:46,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-08 14:51:46,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:51:46,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-09-08 14:51:46,372 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 14:51:46,372 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:51:46,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:51:46,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704164964] [2024-09-08 14:51:46,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704164964] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:51:46,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:51:46,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 14:51:46,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132427237] [2024-09-08 14:51:46,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:51:46,373 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 14:51:46,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:51:46,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 14:51:46,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 14:51:46,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:46,373 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:51:46,374 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:51:46,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:46,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:51:46,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:48,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:48,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:51:48,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:48,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 (46)] Forceful destruction successful, exit code 0 [2024-09-08 14:51:48,827 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:48,828 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:51:48,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:51:48,828 INFO L85 PathProgramCache]: Analyzing trace with hash 156962541, now seen corresponding path program 1 times [2024-09-08 14:51:48,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:51:48,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637562130] [2024-09-08 14:51:48,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:51:48,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:48,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:51:48,830 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:51:48,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2024-09-08 14:51:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:51:48,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-08 14:51:48,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:51:49,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:51:49,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:51:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:51:49,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:51:49,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:51:49,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2024-09-08 14:51:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:51:49,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:51:49,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637562130] [2024-09-08 14:51:49,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637562130] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:51:49,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 14:51:49,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-09-08 14:51:49,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316485761] [2024-09-08 14:51:49,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 14:51:49,389 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-08 14:51:49,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:51:49,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-08 14:51:49,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-08 14:51:49,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:49,390 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:51:49,390 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:51:49,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:49,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:51:49,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:49,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:51,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:51,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:51:51,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:51,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 14:51:51,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 (47)] Forceful destruction successful, exit code 0 [2024-09-08 14:51:52,005 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:52,005 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:51:52,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:51:52,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1321356959, now seen corresponding path program 1 times [2024-09-08 14:51:52,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:51:52,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749063327] [2024-09-08 14:51:52,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:51:52,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:52,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:51:52,009 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:51:52,010 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 (48)] Waiting until timeout for monitored process [2024-09-08 14:51:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:51:52,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-08 14:51:52,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:51:52,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:51:52,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:51:52,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:51:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:51:52,262 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:51:52,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:51:52,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2024-09-08 14:51:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:51:52,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:51:52,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749063327] [2024-09-08 14:51:52,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749063327] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:51:52,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 14:51:52,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-09-08 14:51:52,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482841094] [2024-09-08 14:51:52,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 14:51:52,645 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-08 14:51:52,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:51:52,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-08 14:51:52,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-09-08 14:51:52,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:52,645 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:51:52,645 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:51:52,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:52,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:51:52,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:52,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 14:51:52,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:55,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:55,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:51:55,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:55,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 14:51:55,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-08 14:51:55,287 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 (48)] Forceful destruction successful, exit code 0 [2024-09-08 14:51:55,483 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:55,484 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:51:55,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:51:55,484 INFO L85 PathProgramCache]: Analyzing trace with hash -70511552, now seen corresponding path program 1 times [2024-09-08 14:51:55,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:51:55,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900030012] [2024-09-08 14:51:55,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:51:55,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:55,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:51:55,486 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:51:55,487 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 (49)] Waiting until timeout for monitored process [2024-09-08 14:51:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:51:55,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-08 14:51:55,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:51:55,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:51:55,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:51:55,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:51:55,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:51:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:51:55,782 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:51:56,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:51:56,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2024-09-08 14:51:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:51:56,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:51:56,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900030012] [2024-09-08 14:51:56,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900030012] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:51:56,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 14:51:56,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-09-08 14:51:56,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106771501] [2024-09-08 14:51:56,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 14:51:56,286 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-08 14:51:56,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:51:56,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-08 14:51:56,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-09-08 14:51:56,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:56,288 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:51:56,288 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:51:56,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:56,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:51:56,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:56,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 14:51:56,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-09-08 14:51:56,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:51:58,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:58,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:51:58,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:51:58,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 14:51:58,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-08 14:51:58,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:51:58,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Forceful destruction successful, exit code 0 [2024-09-08 14:51:59,124 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:59,125 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:51:59,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:51:59,125 INFO L85 PathProgramCache]: Analyzing trace with hash 294902159, now seen corresponding path program 1 times [2024-09-08 14:51:59,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:51:59,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085023721] [2024-09-08 14:51:59,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:51:59,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:51:59,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:51:59,127 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:51:59,128 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 (50)] Waiting until timeout for monitored process [2024-09-08 14:51:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:51:59,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-08 14:51:59,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:51:59,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:51:59,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:51:59,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-09-08 14:51:59,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:51:59,539 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 14:51:59,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-09-08 14:51:59,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-08 14:51:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:51:59,589 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:51:59,638 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_31) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)))) is different from false [2024-09-08 14:51:59,751 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))))) is different from false [2024-09-08 14:51:59,804 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) .cse0) (or (not .cse0) (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_32) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)))))))) is different from false [2024-09-08 14:51:59,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 10 treesize of output 8 [2024-09-08 14:51:59,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-09-08 14:52:00,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:52:00,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2024-09-08 14:52:00,876 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 14:52:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:52:00,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:52:00,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085023721] [2024-09-08 14:52:00,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085023721] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:52:00,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 14:52:00,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2024-09-08 14:52:00,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354560598] [2024-09-08 14:52:00,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 14:52:00,964 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-08 14:52:00,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:52:00,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-08 14:52:00,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=186, Unknown=5, NotChecked=90, Total=342 [2024-09-08 14:52:00,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:52:00,965 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:52:00,966 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.947368421052632) internal successors, (113), 18 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:52:00,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:00,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:52:00,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:00,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 14:52:00,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-09-08 14:52:00,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:52:00,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:52:01,785 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse0 (not .cse2))) (and (or .cse0 (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_32) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|)))) (not (bvsgt (bvadd (_ bv5 32) c_~next_alloc_idx~0) (_ bv65 32))) .cse0 (or (and (or (forall ((v_DerPreprocessor_33 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_33) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_32) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32)))) (forall ((v_DerPreprocessor_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_128 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_127 (_ BitVec 32)) (v_prenex_125 (_ BitVec 32)) (v_prenex_126 (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32))) (or (not (= (select (select (store (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_33))) (store .cse1 v_prenex_126 (store (select .cse1 v_prenex_126) v_prenex_125 (bvadd (_ bv2 32) c_~next_alloc_idx~0)))) v_prenex_127 v_prenex_128) v_prenex_126) v_prenex_125) (_ bv0 32))) (= v_prenex_126 v_prenex_127)))) .cse2) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32))) (or (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))))) (not (= (_ bv0 32) c_~top~0)) (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse0 (forall ((v_prenex_130 (_ BitVec 32)) (v_DerPreprocessor_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_131 (_ BitVec 32)) (v_prenex_132 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_129 (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_prenex_130 v_prenex_131) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_34) v_prenex_130 v_DerPreprocessor_32) v_prenex_131 v_prenex_132) v_prenex_130) v_prenex_129)))))) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 32) (bvadd (_ bv4 32) c_~next_alloc_idx~0)))))) is different from false [2024-09-08 14:52:01,814 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse0 (not .cse2))) (and (or .cse0 (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_32) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|)))) (not (bvsgt (bvadd (_ bv5 32) c_~next_alloc_idx~0) (_ bv65 32))) .cse0 (or (and (or (forall ((v_DerPreprocessor_33 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_33) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_32) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32)))) (forall ((v_DerPreprocessor_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_128 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_127 (_ BitVec 32)) (v_prenex_125 (_ BitVec 32)) (v_prenex_126 (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32))) (or (not (= (select (select (store (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_33))) (store .cse1 v_prenex_126 (store (select .cse1 v_prenex_126) v_prenex_125 (bvadd (_ bv2 32) c_~next_alloc_idx~0)))) v_prenex_127 v_prenex_128) v_prenex_126) v_prenex_125) (_ bv0 32))) (= v_prenex_126 v_prenex_127)))) .cse2) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32))) (or (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))))) (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse0 (forall ((v_prenex_130 (_ BitVec 32)) (v_DerPreprocessor_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_131 (_ BitVec 32)) (v_prenex_132 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_129 (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_prenex_130 v_prenex_131) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_34) v_prenex_130 v_DerPreprocessor_32) v_prenex_131 v_prenex_132) v_prenex_130) v_prenex_129)))))) (not (= (_ bv0 32) (bvadd (_ bv4 32) c_~next_alloc_idx~0)))))) is different from false [2024-09-08 14:52:03,685 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32))) (or (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))))) (not (= (_ bv0 32) c_~top~0)) (= (_ bv3 32) c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_31) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)))) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)))) is different from false [2024-09-08 14:52:04,871 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse0 (not .cse2))) (and (or .cse0 (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_32) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|)))) (not (bvsgt (bvadd (_ bv5 32) c_~next_alloc_idx~0) (_ bv65 32))) .cse0 (or (and (or (forall ((v_DerPreprocessor_33 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_33) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_32) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32)))) (forall ((v_DerPreprocessor_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_128 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_127 (_ BitVec 32)) (v_prenex_125 (_ BitVec 32)) (v_prenex_126 (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32))) (or (not (= (select (select (store (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_33))) (store .cse1 v_prenex_126 (store (select .cse1 v_prenex_126) v_prenex_125 (bvadd (_ bv2 32) c_~next_alloc_idx~0)))) v_prenex_127 v_prenex_128) v_prenex_126) v_prenex_125) (_ bv0 32))) (= v_prenex_126 v_prenex_127)))) .cse2) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32))) (or (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))))) (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse0 (forall ((v_prenex_130 (_ BitVec 32)) (v_DerPreprocessor_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_131 (_ BitVec 32)) (v_prenex_132 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_129 (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_prenex_130 v_prenex_131) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_34) v_prenex_130 v_DerPreprocessor_32) v_prenex_131 v_prenex_132) v_prenex_130) v_prenex_129)))))) (not (= (_ bv0 32) (bvadd (_ bv4 32) c_~next_alloc_idx~0))) (= (_ bv5 32) (select (select |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) is different from false [2024-09-08 14:52:04,990 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse0 (not .cse2))) (and (or .cse0 (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_32) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|)))) (not (bvsgt (bvadd (_ bv5 32) c_~next_alloc_idx~0) (_ bv65 32))) .cse0 (or (and (or (forall ((v_DerPreprocessor_33 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_33) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_32) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32)))) (forall ((v_DerPreprocessor_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_128 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_127 (_ BitVec 32)) (v_prenex_125 (_ BitVec 32)) (v_prenex_126 (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32))) (or (not (= (select (select (store (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_33))) (store .cse1 v_prenex_126 (store (select .cse1 v_prenex_126) v_prenex_125 (bvadd (_ bv2 32) c_~next_alloc_idx~0)))) v_prenex_127 v_prenex_128) v_prenex_126) v_prenex_125) (_ bv0 32))) (= v_prenex_126 v_prenex_127)))) .cse2) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32))) (or (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))))) (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse0 (forall ((v_prenex_130 (_ BitVec 32)) (v_DerPreprocessor_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_131 (_ BitVec 32)) (v_prenex_132 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_129 (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_prenex_130 v_prenex_131) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_34) v_prenex_130 v_DerPreprocessor_32) v_prenex_131 v_prenex_132) v_prenex_130) v_prenex_129)))))) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 32) (bvadd (_ bv4 32) c_~next_alloc_idx~0)))))) is different from false [2024-09-08 14:52:05,225 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32))) (or (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))))) (= (_ bv3 32) c_~next_alloc_idx~0) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)))) is different from false [2024-09-08 14:52:09,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:09,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:52:09,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:09,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 14:52:09,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-08 14:52:09,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:52:09,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-09-08 14:52:09,769 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 (50)] Forceful destruction successful, exit code 0 [2024-09-08 14:52:09,964 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:52:09,964 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:52:09,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:52:09,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1385452686, now seen corresponding path program 1 times [2024-09-08 14:52:09,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:52:09,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051504663] [2024-09-08 14:52:09,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:52:09,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:52:09,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:52:09,966 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:52:09,967 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 (51)] Waiting until timeout for monitored process [2024-09-08 14:52:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:52:10,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-08 14:52:10,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:52:10,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:52:10,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:52:10,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-09-08 14:52:10,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:52:10,313 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 14:52:10,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-09-08 14:52:10,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-09-08 14:52:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:52:10,370 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:52:10,493 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_37) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))))) .cse0) (or (not .cse0) (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_36) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))))) is different from false [2024-09-08 14:52:12,716 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (not .cse0) (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_38) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_36) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))))) (or (let ((.cse2 (select |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|)) (.cse1 (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (not .cse1) (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_36) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (or (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_37) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) .cse1))) .cse0))) is different from false [2024-09-08 14:52:12,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-09-08 14:52:12,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 14:52:12,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-09-08 14:52:13,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:52:13,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2024-09-08 14:52:13,817 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 14:52:13,903 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-09-08 14:52:13,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:52:13,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051504663] [2024-09-08 14:52:13,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051504663] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 14:52:13,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 14:52:13,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-09-08 14:52:13,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047989870] [2024-09-08 14:52:13,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 14:52:13,904 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-08 14:52:13,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:52:13,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-08 14:52:13,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=179, Unknown=10, NotChecked=58, Total=306 [2024-09-08 14:52:13,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:52:13,905 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:52:13,905 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.5) internal successors, (117), 17 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:52:13,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:13,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:52:13,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:13,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 14:52:13,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-09-08 14:52:13,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:52:13,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-09-08 14:52:13,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:52:14,290 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse0 (not .cse2))) (and (or .cse0 (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_36) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) (not (bvsgt (bvadd (_ bv5 32) c_~next_alloc_idx~0) (_ bv65 32))) (or (and (or (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (forall ((v_prenex_164 (_ BitVec 32)) (v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_165 (_ BitVec 32)) (v_prenex_166 (_ BitVec 32))) (or (= v_prenex_166 v_prenex_164) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_40) v_prenex_166 v_DerPreprocessor_38) v_prenex_164 v_DerPreprocessor_36) v_prenex_166) v_prenex_165)))))) (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (not (= (_ bv0 32) (select (select (store (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_40))) (store .cse1 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (store (select .cse1 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (bvadd (_ bv2 32) c_~next_alloc_idx~0)))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_37) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)))))) .cse2) (or (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (not (= (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_39) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_38) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_36) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) .cse0) .cse0 (not (= (_ bv0 32) c_~top~0)) (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_37) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) (or (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_37) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)))) .cse2) (not (= (_ bv0 32) (bvadd (_ bv4 32) c_~next_alloc_idx~0))) (= (_ bv5 32) (select (select |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)) (or .cse0 (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_38) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_36) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))))))) is different from false [2024-09-08 14:52:14,433 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (not .cse0) (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_36) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) (not (= (_ bv0 32) c_~top~0)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|))) (= (_ bv5 32) c_~next_alloc_idx~0) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (or (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_37) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)))) .cse0))) is different from false [2024-09-08 14:52:16,276 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (not .cse0) (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_36) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) (not (= (_ bv0 32) c_~top~0)) (= (_ bv5 32) c_~next_alloc_idx~0) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (or (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_37) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)))) .cse0))) is different from false [2024-09-08 14:52:17,038 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse0 (not .cse2))) (and (or .cse0 (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_36) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) (not (bvsgt (bvadd (_ bv5 32) c_~next_alloc_idx~0) (_ bv65 32))) (or (and (or (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (forall ((v_prenex_164 (_ BitVec 32)) (v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_165 (_ BitVec 32)) (v_prenex_166 (_ BitVec 32))) (or (= v_prenex_166 v_prenex_164) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_40) v_prenex_166 v_DerPreprocessor_38) v_prenex_164 v_DerPreprocessor_36) v_prenex_166) v_prenex_165)))))) (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (not (= (_ bv0 32) (select (select (store (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_40))) (store .cse1 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (store (select .cse1 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (bvadd (_ bv2 32) c_~next_alloc_idx~0)))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_37) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)))))) .cse2) (or (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (not (= (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_39) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_38) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_36) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) .cse0) .cse0 (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_37) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) (or (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_37) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)))) .cse2) (not (= (_ bv0 32) (bvadd (_ bv4 32) c_~next_alloc_idx~0))) (= (_ bv5 32) (select (select |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)) (or .cse0 (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_38) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_36) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))))))) is different from false [2024-09-08 14:52:17,060 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (not .cse0) (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_36) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|))) (= (_ bv5 32) c_~next_alloc_idx~0) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (or (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_37) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)))) .cse0))) is different from false [2024-09-08 14:52:17,961 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (not .cse0) (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_36) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) (= (_ bv5 32) c_~next_alloc_idx~0) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (or (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_37) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)))) .cse0))) is different from false [2024-09-08 14:52:19,687 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse0 (not .cse2))) (and (or .cse0 (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_36) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) (not (bvsgt (bvadd (_ bv5 32) c_~next_alloc_idx~0) (_ bv65 32))) (or (and (or (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (forall ((v_prenex_164 (_ BitVec 32)) (v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_165 (_ BitVec 32)) (v_prenex_166 (_ BitVec 32))) (or (= v_prenex_166 v_prenex_164) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_40) v_prenex_166 v_DerPreprocessor_38) v_prenex_164 v_DerPreprocessor_36) v_prenex_166) v_prenex_165)))))) (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (not (= (_ bv0 32) (select (select (store (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_40))) (store .cse1 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (store (select .cse1 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (bvadd (_ bv2 32) c_~next_alloc_idx~0)))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_37) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)))))) .cse2) (or (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (not (= (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_39) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_38) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_36) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) .cse0) .cse0 (= (_ bv5 32) c_~top~0) (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_37) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) (or (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_37) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)))) .cse2) (not (= (_ bv0 32) (bvadd (_ bv4 32) c_~next_alloc_idx~0))) (= (_ bv5 32) (select (select |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)) (or .cse0 (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_38) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_36) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))))))) is different from false [2024-09-08 14:52:21,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:21,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:52:21,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:21,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 14:52:21,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-08 14:52:21,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-08 14:52:21,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-09-08 14:52:21,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-09-08 14:52:21,352 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 (51)] Ended with exit code 0 [2024-09-08 14:52:21,547 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:52:21,548 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:52:21,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:52:21,548 INFO L85 PathProgramCache]: Analyzing trace with hash -737401841, now seen corresponding path program 2 times [2024-09-08 14:52:21,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:52:21,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418081408] [2024-09-08 14:52:21,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 14:52:21,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:52:21,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:52:21,552 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:52:21,553 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 (52)] Waiting until timeout for monitored process [2024-09-08 14:52:21,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-08 14:52:21,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 14:52:21,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-08 14:52:21,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:52:21,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-09-08 14:52:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-08 14:52:21,756 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:52:21,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:52:21,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418081408] [2024-09-08 14:52:21,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418081408] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:52:21,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:52:21,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 14:52:21,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375118815] [2024-09-08 14:52:21,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:52:21,757 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 14:52:21,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:52:21,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 14:52:21,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 14:52:21,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:52:21,758 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:52:21,758 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:52:21,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:21,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:52:21,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:21,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 14:52:21,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-09-08 14:52:21,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-09-08 14:52:21,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-09-08 14:52:21,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-09-08 14:52:21,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:52:23,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:23,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:52:23,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:23,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 14:52:23,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-08 14:52:23,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-08 14:52:23,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-09-08 14:52:23,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-09-08 14:52:23,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:52:23,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Ended with exit code 0 [2024-09-08 14:52:23,660 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:52:23,660 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:52:23,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:52:23,661 INFO L85 PathProgramCache]: Analyzing trace with hash -124732924, now seen corresponding path program 1 times [2024-09-08 14:52:23,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:52:23,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252244739] [2024-09-08 14:52:23,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 14:52: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-09-08 14:52:23,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:52:23,662 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:52:23,663 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 (53)] Waiting until timeout for monitored process [2024-09-08 14:52:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 14:52:23,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-08 14:52:23,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:52:23,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-09-08 14:52:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-08 14:52:23,876 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:52:23,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:52:23,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252244739] [2024-09-08 14:52:23,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252244739] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:52:23,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:52:23,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 14:52:23,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070850876] [2024-09-08 14:52:23,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:52:23,876 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 14:52:23,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:52:23,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 14:52:23,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 14:52:23,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:52:23,877 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:52:23,877 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:52:23,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:23,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:52:23,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:23,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 14:52:23,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-09-08 14:52:23,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-09-08 14:52:23,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-09-08 14:52:23,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-09-08 14:52:23,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:52:23,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:52:25,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:25,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:52:25,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:25,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 14:52:25,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-08 14:52:25,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-08 14:52:25,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-09-08 14:52:25,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-09-08 14:52:25,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:52:25,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:52:25,841 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 (53)] Forceful destruction successful, exit code 0 [2024-09-08 14:52:26,037 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:52:26,037 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:52:26,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:52:26,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1380506006, now seen corresponding path program 2 times [2024-09-08 14:52:26,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:52:26,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367893594] [2024-09-08 14:52:26,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 14:52:26,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:52:26,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:52:26,040 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:52:26,041 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 (54)] Waiting until timeout for monitored process [2024-09-08 14:52:26,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-08 14:52:26,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 14:52:26,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-08 14:52:26,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:52:26,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:52:26,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:52:26,444 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-09-08 14:52:26,444 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 72 treesize of output 100 [2024-09-08 14:52:26,511 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-09-08 14:52:26,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 36 [2024-09-08 14:52:26,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-09-08 14:52:26,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:52:26,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-09-08 14:52:27,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:52:27,392 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 75 treesize of output 55 [2024-09-08 14:52:27,414 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-08 14:52:27,414 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:52:27,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:52:27,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367893594] [2024-09-08 14:52:27,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367893594] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:52:27,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:52:27,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-08 14:52:27,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406944769] [2024-09-08 14:52:27,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:52:27,415 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-08 14:52:27,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:52:27,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-08 14:52:27,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-09-08 14:52:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:52:27,415 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:52:27,416 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:52:27,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:27,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:52:27,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:27,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 14:52:27,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-09-08 14:52:27,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-09-08 14:52:27,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-09-08 14:52:27,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-09-08 14:52:27,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:52:27,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:52:27,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:52:33,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:33,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:52:33,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:33,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 14:52:33,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-08 14:52:33,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-08 14:52:33,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-09-08 14:52:33,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-09-08 14:52:33,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:52:33,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:52:33,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-08 14:52:33,496 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 (54)] Forceful destruction successful, exit code 0 [2024-09-08 14:52:33,693 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:52:33,693 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:52:33,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:52:33,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1610659682, now seen corresponding path program 3 times [2024-09-08 14:52:33,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:52:33,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190627781] [2024-09-08 14:52:33,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-08 14:52:33,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:52:33,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:52:33,695 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:52:33,696 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 (55)] Waiting until timeout for monitored process [2024-09-08 14:52:33,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-09-08 14:52:33,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 14:52:33,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-08 14:52:33,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:52:33,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:52:33,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:52:33,985 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-09-08 14:52:33,986 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 72 treesize of output 100 [2024-09-08 14:52:34,129 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-09-08 14:52:34,130 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 47 treesize of output 50 [2024-09-08 14:52:34,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 14:52:34,159 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 25 treesize of output 19 [2024-09-08 14:52:34,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-09-08 14:52:35,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:52:35,623 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 170 treesize of output 150 [2024-09-08 14:52:35,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:52:35,640 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 99 treesize of output 102 [2024-09-08 14:52:35,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 91 [2024-09-08 14:52:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-08 14:52:35,994 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 14:52:35,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:52:35,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190627781] [2024-09-08 14:52:35,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190627781] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 14:52:35,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 14:52:35,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-08 14:52:35,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963750505] [2024-09-08 14:52:35,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:52:35,995 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-08 14:52:35,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:52:35,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-08 14:52:35,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=65, Unknown=1, NotChecked=0, Total=90 [2024-09-08 14:52:35,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:52:35,995 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:52:35,996 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:52:35,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:35,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:52:35,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:52:35,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 14:52:35,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-09-08 14:52:35,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-09-08 14:52:35,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-09-08 14:52:35,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-09-08 14:52:35,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:52:35,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:52:35,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-09-08 14:52:35,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:52:38,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:52:40,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:52:42,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:52:45,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:52:54,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:52:57,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:52:59,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:53:01,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:53:03,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:53:05,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:53:07,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:53:09,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:53:11,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:53:13,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:53:15,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:53:19,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 14:53:20,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:53:20,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:53:20,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:53:20,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 14:53:20,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-08 14:53:20,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-08 14:53:20,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-09-08 14:53:20,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-09-08 14:53:20,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:53:20,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:53:20,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-08 14:53:20,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:53:20,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (55)] Ended with exit code 0 [2024-09-08 14:53:21,190 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:53:21,190 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:53:21,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:53:21,190 INFO L85 PathProgramCache]: Analyzing trace with hash -382543868, now seen corresponding path program 4 times [2024-09-08 14:53:21,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:53:21,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184902497] [2024-09-08 14:53:21,191 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-08 14:53:21,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:53:21,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:53:21,192 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:53:21,193 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 (56)] Waiting until timeout for monitored process [2024-09-08 14:53:21,409 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-08 14:53:21,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 14:53:21,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-08 14:53:21,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:53:21,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:53:21,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 14:53:21,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-09-08 14:53:21,536 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 14:53:21,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-09-08 14:53:21,553 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 8 treesize of output 1 [2024-09-08 14:53:21,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-09-08 14:53:21,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-09-08 14:53:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:53:21,656 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 14:53:21,714 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (forall ((v_DerPreprocessor_44 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) .cse0) (or (not .cse0) (forall ((v_DerPreprocessor_45 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))) is different from false [2024-09-08 14:53:21,889 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (let ((.cse0 (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (forall ((v_DerPreprocessor_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_202 (_ BitVec 32))) (or (= (select v_DerPreprocessor_46 v_prenex_202) (_ bv0 32)) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_46) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) v_prenex_202) (_ bv0 32))))) (not .cse0)) (or .cse0 (forall ((v_DerPreprocessor_44 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_46 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_46) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (= (select v_DerPreprocessor_46 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))))) .cse1) (or (not .cse1) (forall ((v_DerPreprocessor_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_47 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32))) (or (= (_ bv0 32) (select v_DerPreprocessor_47 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_47) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) is different from false [2024-09-08 14:53:21,973 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (let ((.cse0 (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (not .cse0) (forall ((v_DerPreprocessor_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (v_prenex_202 (_ BitVec 32))) (or (= (select v_DerPreprocessor_46 v_prenex_202) (_ bv0 32)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_46) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) v_prenex_202) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (or .cse0 (forall ((v_DerPreprocessor_44 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_46 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32))) (or (= (select v_DerPreprocessor_46 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_46) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))))) .cse1) (or (not .cse1) (forall ((v_DerPreprocessor_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_47 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))) (= (_ bv0 32) (select v_DerPreprocessor_47 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_47) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) is different from false [2024-09-08 14:53:22,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 14:53:22,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 14:53:22,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 14:53:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 14:53:22,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 14:53:22,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184902497] [2024-09-08 14:53:22,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184902497] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-08 14:53:22,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-08 14:53:22,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 17 [2024-09-08 14:53:22,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703205868] [2024-09-08 14:53:22,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 14:53:22,200 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-08 14:53:22,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 14:53:22,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-08 14:53:22,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=148, Unknown=4, NotChecked=78, Total=272 [2024-09-08 14:53:22,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:53:22,201 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 14:53:22,201 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 14:53:22,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:53:22,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:53:22,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:53:22,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 14:53:22,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-09-08 14:53:22,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-09-08 14:53:22,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-09-08 14:53:22,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-09-08 14:53:22,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:53:22,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:53:22,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-09-08 14:53:22,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:53:22,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 14:53:22,384 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (not (= (_ bv0 32) c_~top~0)) (or (let ((.cse0 (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (not .cse0) (forall ((v_DerPreprocessor_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (v_prenex_202 (_ BitVec 32))) (or (= (select v_DerPreprocessor_46 v_prenex_202) (_ bv0 32)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_46) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) v_prenex_202) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (or .cse0 (forall ((v_DerPreprocessor_44 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_46 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32))) (or (= (select v_DerPreprocessor_46 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_46) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))))) .cse1) (or (not .cse1) (forall ((v_DerPreprocessor_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_47 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))) (= (_ bv0 32) (select v_DerPreprocessor_47 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_47) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) is different from false [2024-09-08 14:53:22,755 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse0 (not .cse3))) (let ((.cse1 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse2 (or (forall ((v_DerPreprocessor_44 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) .cse3)) (.cse4 (or .cse0 (forall ((v_DerPreprocessor_45 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))))) (and (or .cse0 (forall ((v_DerPreprocessor_45 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32))) (or (= (_ bv0 32) (select .cse1 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))) .cse2 (or (forall ((v_DerPreprocessor_44 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32))) (or (= (_ bv0 32) (select .cse1 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) .cse3) (or (= |c_thr1Thread4of4ForFork0_push_#t~mem1#1| (_ bv0 32)) (and .cse2 .cse4)) .cse4)))) is different from false [2024-09-08 14:53:24,790 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (not (= (_ bv0 32) c_~top~0)) (or (let ((.cse0 (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (not .cse0) (forall ((v_DerPreprocessor_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (v_prenex_202 (_ BitVec 32))) (or (= (select v_DerPreprocessor_46 v_prenex_202) (_ bv0 32)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_46) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) v_prenex_202) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (or .cse0 (forall ((v_DerPreprocessor_44 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_46 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32))) (or (= (select v_DerPreprocessor_46 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_46) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))))) .cse1) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (or (not .cse1) (forall ((v_DerPreprocessor_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_47 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))) (= (_ bv0 32) (select v_DerPreprocessor_47 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_47) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) is different from false [2024-09-08 14:53:24,880 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (let ((.cse0 (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (not .cse0) (forall ((v_DerPreprocessor_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (v_prenex_202 (_ BitVec 32))) (or (= (select v_DerPreprocessor_46 v_prenex_202) (_ bv0 32)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_46) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) v_prenex_202) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))) (or .cse0 (forall ((v_DerPreprocessor_44 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_46 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32))) (or (= (select v_DerPreprocessor_46 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_46) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|)))))))) .cse1) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))) (or (not .cse1) (forall ((v_DerPreprocessor_45 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_47 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|))) (= (_ bv0 32) (select v_DerPreprocessor_47 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_47) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_45) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))))) is different from false [2024-09-08 14:53:25,834 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse0 (not .cse2)) (.cse1 (select |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|))) (and (or .cse0 (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_32) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|)))) (not (bvsgt (bvadd (_ bv5 32) c_~next_alloc_idx~0) (_ bv65 32))) (or (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) .cse2) (or .cse0 (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_32) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)))))) .cse0 (or (and (or (forall ((v_DerPreprocessor_33 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_33) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_32) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32)))) (forall ((v_DerPreprocessor_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_128 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_127 (_ BitVec 32)) (v_prenex_125 (_ BitVec 32)) (v_prenex_126 (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32))) (or (not (= (select (select (store (let ((.cse3 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_33))) (store .cse3 v_prenex_126 (store (select .cse3 v_prenex_126) v_prenex_125 (bvadd (_ bv2 32) c_~next_alloc_idx~0)))) v_prenex_127 v_prenex_128) v_prenex_126) v_prenex_125) (_ bv0 32))) (= v_prenex_126 v_prenex_127)))) .cse2) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32))) (or (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))))) (not (= (_ bv0 32) c_~top~0)) (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse0 (forall ((v_prenex_130 (_ BitVec 32)) (v_DerPreprocessor_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_131 (_ BitVec 32)) (v_prenex_132 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_129 (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_prenex_130 v_prenex_131) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_34) v_prenex_130 v_DerPreprocessor_32) v_prenex_131 v_prenex_132) v_prenex_130) v_prenex_129)))))) (not (= (_ bv0 32) (select .cse1 |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 32) (bvadd (_ bv4 32) c_~next_alloc_idx~0)))))) is different from false [2024-09-08 14:53:25,847 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32))) (.cse5 (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse0 (not .cse5)) (.cse4 (select |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|)) (.cse3 (not .cse2))) (and (not (bvsgt (bvadd (_ bv5 32) c_~next_alloc_idx~0) (_ bv65 32))) (or (and (or .cse0 (forall ((v_prenex_164 (_ BitVec 32)) (v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_165 (_ BitVec 32)) (v_prenex_166 (_ BitVec 32))) (or (= v_prenex_166 v_prenex_164) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_40) v_prenex_166 v_DerPreprocessor_38) v_prenex_164 v_DerPreprocessor_36) v_prenex_166) v_prenex_165)))))) (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (not (= (_ bv0 32) (select (select (store (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_40))) (store .cse1 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (store (select .cse1 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (bvadd (_ bv2 32) c_~next_alloc_idx~0)))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_37) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)))))) .cse2) (or (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (not (= (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_39) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_38) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_36) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) .cse3) .cse3 (or .cse3 (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_38) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_36) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))))) (not (= (_ bv0 32) c_~top~0)) (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_37) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) (not (= (_ bv0 32) (select .cse4 |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (or (and (or .cse0 (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| (store .cse4 |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_36) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (or (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| (store .cse4 |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_37) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) .cse5)) .cse2) (not (= (_ bv0 32) (bvadd (_ bv4 32) c_~next_alloc_idx~0))) (or .cse3 (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_38) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_36) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))))))) is different from false [2024-09-08 14:53:26,060 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse0 (not .cse2)) (.cse1 (select |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|))) (and (or .cse0 (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_32) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|)))) (not (bvsgt (bvadd (_ bv5 32) c_~next_alloc_idx~0) (_ bv65 32))) (or (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) .cse2) (or .cse0 (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_32) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)))))) .cse0 (or (and (or (forall ((v_DerPreprocessor_33 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_33) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_32) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32)))) (forall ((v_DerPreprocessor_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_128 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_127 (_ BitVec 32)) (v_prenex_125 (_ BitVec 32)) (v_prenex_126 (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32))) (or (not (= (select (select (store (let ((.cse3 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_33))) (store .cse3 v_prenex_126 (store (select .cse3 v_prenex_126) v_prenex_125 (bvadd (_ bv2 32) c_~next_alloc_idx~0)))) v_prenex_127 v_prenex_128) v_prenex_126) v_prenex_125) (_ bv0 32))) (= v_prenex_126 v_prenex_127)))) .cse2) (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32))) (or (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))))) (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (_ BitVec 32)) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21| (store (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_21|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse0 (forall ((v_prenex_130 (_ BitVec 32)) (v_DerPreprocessor_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_131 (_ BitVec 32)) (v_prenex_132 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_129 (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_prenex_130 v_prenex_131) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_34) v_prenex_130 v_DerPreprocessor_32) v_prenex_131 v_prenex_132) v_prenex_130) v_prenex_129)))))) (not (= (_ bv0 32) (select .cse1 |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 32) (bvadd (_ bv4 32) c_~next_alloc_idx~0)))))) is different from false [2024-09-08 14:53:26,072 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32))) (.cse5 (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse0 (not .cse5)) (.cse4 (select |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|)) (.cse3 (not .cse2))) (and (not (bvsgt (bvadd (_ bv5 32) c_~next_alloc_idx~0) (_ bv65 32))) (or (and (or .cse0 (forall ((v_prenex_164 (_ BitVec 32)) (v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_165 (_ BitVec 32)) (v_prenex_166 (_ BitVec 32))) (or (= v_prenex_166 v_prenex_164) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_40) v_prenex_166 v_DerPreprocessor_38) v_prenex_164 v_DerPreprocessor_36) v_prenex_166) v_prenex_165)))))) (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_40 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (not (= (_ bv0 32) (select (select (store (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_40))) (store .cse1 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (store (select .cse1 |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (bvadd (_ bv2 32) c_~next_alloc_idx~0)))) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_37) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|)))))) .cse2) (or (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (not (= (select (select (store (store (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_39) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_38) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_36) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) .cse3) .cse3 (or .cse3 (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_38) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_36) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))))) (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (store (select |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_37) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) (not (= (_ bv0 32) (select .cse4 |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (or (and (or .cse0 (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| (store .cse4 |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_36) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|)))))) (or (forall ((v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| (store .cse4 |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_37) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))) .cse5)) .cse2) (not (= (_ bv0 32) (bvadd (_ bv4 32) c_~next_alloc_idx~0))) (or .cse3 (forall ((v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| (_ BitVec 32)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| (_ BitVec 32))) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_38) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_19| v_DerPreprocessor_36) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))))))))) is different from false [2024-09-08 14:53:26,138 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32))) (or (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_31) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_17|))))) (not (= (_ bv0 32) c_~top~0))) is different from false [2024-09-08 14:53:27,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:53:29,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:53:31,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:53:33,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:53:35,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:53:37,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 14:53:40,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:53:40,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 14:53:40,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 14:53:40,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 14:53:40,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-08 14:53:40,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-08 14:53:40,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-09-08 14:53:40,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-09-08 14:53:40,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:53:40,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 14:53:40,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-08 14:53:40,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-08 14:53:40,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-08 14:53:40,409 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 (56)] Forceful destruction successful, exit code 0 [2024-09-08 14:53:40,604 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:53:40,604 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 14:53:40,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 14:53:40,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1168944828, now seen corresponding path program 5 times [2024-09-08 14:53:40,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 14:53:40,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368840686] [2024-09-08 14:53:40,605 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-08 14:53:40,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 14:53:40,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 14:53:40,607 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 14:53:40,607 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 (57)] Waiting until timeout for monitored process [2024-09-08 14:53:40,833 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-09-08 14:53:40,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 14:53:40,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-08 14:53:40,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 14:53:40,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 14:53:40,958 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-08 14:53:40,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-09-08 14:53:41,166 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-09-08 14:53:41,167 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 20 treesize of output 27 [2024-09-08 14:53:41,224 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-09-08 14:53:41,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2024-09-08 14:53:41,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 14:53:41,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2024-09-08 14:53:41,428 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 14:53:41,428 INFO L327 TraceCheckSpWp]: Computing backward predicates... Killed by 15