./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 --validate ./goblint.2024-08-08_07-59-58.files/mutex-meet-local/37_stack_lock_p0_vs_concur-pthread.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c091e2ee 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-08-08_07-59-58.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.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-c091e2e-m [2024-08-13 21:09:06,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-13 21:09:06,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-13 21:09:06,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-13 21:09:06,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-13 21:09:06,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-13 21:09:06,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-13 21:09:06,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-13 21:09:06,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-13 21:09:06,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-13 21:09:06,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-13 21:09:06,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-13 21:09:06,912 INFO L153 SettingsManager]: * Use SBE=true [2024-08-13 21:09:06,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-13 21:09:06,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-13 21:09:06,914 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-13 21:09:06,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-13 21:09:06,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-13 21:09:06,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-13 21:09:06,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-13 21:09:06,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-13 21:09:06,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-13 21:09:06,920 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-13 21:09:06,920 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-13 21:09:06,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-13 21:09:06,920 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-13 21:09:06,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-13 21:09:06,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-13 21:09:06,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-13 21:09:06,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-13 21:09:06,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-13 21:09:06,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-13 21:09:06,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-13 21:09:06,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-13 21:09:06,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-13 21:09:06,922 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-13 21:09:06,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-13 21:09:06,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-13 21:09:06,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-13 21:09:06,923 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-13 21:09:06,923 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-13 21:09:06,925 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-13 21:09:06,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false [2024-08-13 21:09:07,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-13 21:09:07,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-13 21:09:07,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-13 21:09:07,190 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-13 21:09:07,191 INFO L274 PluginConnector]: CDTParser initialized [2024-08-13 21:09:07,192 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-08-13 21:09:08,635 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-13 21:09:08,872 INFO L384 CDTParser]: Found 1 translation units. [2024-08-13 21:09:08,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2024-08-13 21:09:08,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/05019f981/7698b723da81426089c21fe25d8e6b32/FLAG647a1317f [2024-08-13 21:09:09,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/05019f981/7698b723da81426089c21fe25d8e6b32 [2024-08-13 21:09:09,216 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-13 21:09:09,217 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-13 21:09:09,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-08_07-59-58.files/mutex-meet-local/37_stack_lock_p0_vs_concur-pthread.yml/witness.yml [2024-08-13 21:09:09,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-13 21:09:09,322 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-13 21:09:09,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-13 21:09:09,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-13 21:09:09,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-13 21:09:09,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 09:09:09" (1/2) ... [2024-08-13 21:09:09,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5515fb3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 09:09:09, skipping insertion in model container [2024-08-13 21:09:09,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 09:09:09" (1/2) ... [2024-08-13 21:09:09,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@290c7ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 09:09:09, skipping insertion in model container [2024-08-13 21:09:09,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.08 09:09:09" (2/2) ... [2024-08-13 21:09:09,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5515fb3f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 09:09:09, skipping insertion in model container [2024-08-13 21:09:09,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.08 09:09:09" (2/2) ... [2024-08-13 21:09:09,335 INFO L81 nessWitnessExtractor]: Only extracting loop invariants from correctness witness [2024-08-13 21:09:09,339 INFO L92 edCorrectnessWitness]: Witness did not contain any usable entries. [2024-08-13 21:09:09,390 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-13 21:09:09,791 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-08-13 21:09:09,801 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-13 21:09:09,820 INFO L202 MainTranslator]: Completed pre-run [2024-08-13 21:09:09,889 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-08-13 21:09:09,891 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-13 21:09:09,936 INFO L206 MainTranslator]: Completed translation [2024-08-13 21:09:09,938 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 09:09:09 WrapperNode [2024-08-13 21:09:09,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-13 21:09:09,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-13 21:09:09,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-13 21:09:09,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-13 21:09:09,947 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 13.08 09:09:09" (1/1) ... [2024-08-13 21:09:09,963 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 13.08 09:09:09" (1/1) ... [2024-08-13 21:09:09,988 INFO L138 Inliner]: procedures = 165, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 84 [2024-08-13 21:09:09,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-13 21:09:09,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-13 21:09:09,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-13 21:09:09,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-13 21:09:09,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 09:09:09" (1/1) ... [2024-08-13 21:09:10,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 09:09:09" (1/1) ... [2024-08-13 21:09:10,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 09:09:09" (1/1) ... [2024-08-13 21:09:10,005 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 09:09:09" (1/1) ... [2024-08-13 21:09:10,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 09:09:09" (1/1) ... [2024-08-13 21:09:10,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 09:09:09" (1/1) ... [2024-08-13 21:09:10,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 09:09:09" (1/1) ... [2024-08-13 21:09:10,027 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 09:09:09" (1/1) ... [2024-08-13 21:09:10,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-13 21:09:10,033 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-13 21:09:10,033 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-13 21:09:10,033 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-13 21:09:10,034 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 09:09:09" (1/1) ... [2024-08-13 21:09:10,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-13 21:09:10,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 21:09:10,074 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-08-13 21:09:10,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-08-13 21:09:10,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-08-13 21:09:10,111 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-08-13 21:09:10,112 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-08-13 21:09:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-08-13 21:09:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-08-13 21:09:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-13 21:09:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-13 21:09:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-13 21:09:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-13 21:09:10,114 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-08-13 21:09:10,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-13 21:09:10,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-13 21:09:10,115 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-08-13 21:09:10,264 INFO L244 CfgBuilder]: Building ICFG [2024-08-13 21:09:10,267 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-13 21:09:10,455 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-08-13 21:09:10,456 INFO L293 CfgBuilder]: Performing block encoding [2024-08-13 21:09:10,577 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-13 21:09:10,577 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-08-13 21:09:10,578 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 09:09:10 BoogieIcfgContainer [2024-08-13 21:09:10,578 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-13 21:09:10,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-13 21:09:10,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-13 21:09:10,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-13 21:09:10,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 09:09:09" (1/4) ... [2024-08-13 21:09:10,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0aa814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 09:09:10, skipping insertion in model container [2024-08-13 21:09:10,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.08 09:09:09" (2/4) ... [2024-08-13 21:09:10,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0aa814 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.08 09:09:10, skipping insertion in model container [2024-08-13 21:09:10,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 09:09:09" (3/4) ... [2024-08-13 21:09:10,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0aa814 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.08 09:09:10, skipping insertion in model container [2024-08-13 21:09:10,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 09:09:10" (4/4) ... [2024-08-13 21:09:10,588 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur-pthread.i [2024-08-13 21:09:10,604 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-13 21:09:10,605 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-13 21:09:10,605 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-13 21:09:10,650 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-13 21:09:10,692 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 21:09:10,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-13 21:09:10,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 21:09:10,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-13 21:09:10,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-08-13 21:09:10,732 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-13 21:09:10,744 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-08-13 21:09:10,754 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5d7b27e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 21:09:10,754 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-13 21:09:10,879 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:09:10,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:09:10,886 INFO L85 PathProgramCache]: Analyzing trace with hash 253978131, now seen corresponding path program 1 times [2024-08-13 21:09:10,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:09:10,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785607765] [2024-08-13 21:09:10,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:09:10,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:09:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:09:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:09:11,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:09:11,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785607765] [2024-08-13 21:09:11,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785607765] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:09:11,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:09:11,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-13 21:09:11,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974067198] [2024-08-13 21:09:11,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:09:11,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-13 21:09:11,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:09:11,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-13 21:09:11,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-13 21:09:11,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:11,306 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:09:11,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:09:11,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:11,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:11,531 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-13 21:09:11,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-13 21:09:11,540 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-13 21:09:11,544 INFO L308 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-08-13 21:09:11,549 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 21:09:11,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-13 21:09:11,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 21:09:11,566 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-08-13 21:09:11,568 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-08-13 21:09:11,571 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-13 21:09:11,575 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-13 21:09:11,576 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5d7b27e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 21:09:11,576 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-13 21:09:11,690 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 21:09:11,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:09:11,694 INFO L85 PathProgramCache]: Analyzing trace with hash -740144592, now seen corresponding path program 1 times [2024-08-13 21:09:11,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:09:11,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860853414] [2024-08-13 21:09:11,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:09:11,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:09:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:09:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:09:11,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:09:11,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860853414] [2024-08-13 21:09:11,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860853414] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:09:11,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:09:11,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-13 21:09:11,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144716071] [2024-08-13 21:09:11,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:09:11,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-13 21:09:11,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:09:11,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-13 21:09:11,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-13 21:09:11,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:11,861 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:09:11,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:09:11,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 21:09:11,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-13 21:09:11,982 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 21:09:11,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:09:11,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1468636501, now seen corresponding path program 1 times [2024-08-13 21:09:11,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:09:11,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387647170] [2024-08-13 21:09:11,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:09:11,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:09:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:09:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:09:12,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:09:12,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387647170] [2024-08-13 21:09:12,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387647170] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:09:12,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:09:12,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-13 21:09:12,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74033836] [2024-08-13 21:09:12,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:09:12,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-13 21:09:12,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:09:12,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-13 21:09:12,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-13 21:09:12,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:12,253 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:09:12,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:09:12,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-13 21:09:12,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:12,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 21:09:12,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:12,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-13 21:09:12,348 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 21:09:12,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:09:12,349 INFO L85 PathProgramCache]: Analyzing trace with hash -716612086, now seen corresponding path program 1 times [2024-08-13 21:09:12,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:09:12,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265627317] [2024-08-13 21:09:12,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:09:12,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:09:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-13 21:09:12,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-13 21:09:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-13 21:09:12,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-13 21:09:12,420 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-13 21:09:12,421 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-13 21:09:12,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-08-13 21:09:12,426 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-08-13 21:09:12,426 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-08-13 21:09:12,427 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-13 21:09:12,427 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-08-13 21:09:12,454 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-13 21:09:12,457 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 21:09:12,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-13 21:09:12,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 21:09:12,459 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-08-13 21:09:12,461 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-08-13 21:09:12,464 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-13 21:09:12,465 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-13 21:09:12,465 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5d7b27e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 21:09:12,465 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-13 21:09:12,698 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 21:09:12,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:09:12,704 INFO L85 PathProgramCache]: Analyzing trace with hash 669381600, now seen corresponding path program 1 times [2024-08-13 21:09:12,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:09:12,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838213752] [2024-08-13 21:09:12,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:09:12,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:09:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:09:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-08-13 21:09:12,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:09:12,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838213752] [2024-08-13 21:09:12,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838213752] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:09:12,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:09:12,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-13 21:09:12,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725937039] [2024-08-13 21:09:12,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:09:12,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-13 21:09:12,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:09:12,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-13 21:09:12,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-13 21:09:12,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:12,835 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:09:12,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:09:12,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:13,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:13,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-13 21:09:13,071 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 21:09:13,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:09:13,072 INFO L85 PathProgramCache]: Analyzing trace with hash 524904189, now seen corresponding path program 1 times [2024-08-13 21:09:13,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:09:13,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762220420] [2024-08-13 21:09:13,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:09:13,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:09:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:09:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-13 21:09:13,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:09:13,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762220420] [2024-08-13 21:09:13,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762220420] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:09:13,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:09:13,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-13 21:09:13,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490307743] [2024-08-13 21:09:13,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:09:13,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-13 21:09:13,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:09:13,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-13 21:09:13,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-13 21:09:13,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:13,330 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:09:13,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:09:13,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:13,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:13,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:13,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:13,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-13 21:09:13,430 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 21:09:13,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:09:13,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1190301475, now seen corresponding path program 1 times [2024-08-13 21:09:13,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:09:13,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996280420] [2024-08-13 21:09:13,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:09:13,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:09:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-13 21:09:13,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-13 21:09:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-13 21:09:13,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-13 21:09:13,493 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-13 21:09:13,493 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-13 21:09:13,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-13 21:09:13,495 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-08-13 21:09:13,495 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-08-13 21:09:13,495 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-13 21:09:13,495 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-08-13 21:09:13,523 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-13 21:09:13,525 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 21:09:13,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-13 21:09:13,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 21:09:13,528 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-13 21:09:13,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-08-13 21:09:13,543 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-13 21:09:13,544 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-08-13 21:09:13,544 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5d7b27e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 21:09:13,544 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-13 21:09:13,780 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:09:13,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:09:13,782 INFO L85 PathProgramCache]: Analyzing trace with hash 696823810, now seen corresponding path program 1 times [2024-08-13 21:09:13,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:09:13,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896728012] [2024-08-13 21:09:13,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:09:13,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:09:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:09:13,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-13 21:09:13,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:09:13,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896728012] [2024-08-13 21:09:13,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896728012] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:09:13,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:09:13,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-13 21:09:13,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128673144] [2024-08-13 21:09:13,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:09:13,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-13 21:09:13,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:09:13,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-13 21:09:13,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-13 21:09:13,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:13,878 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:09:13,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:09:13,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:14,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:14,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-08-13 21:09:14,173 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:09:14,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:09:14,174 INFO L85 PathProgramCache]: Analyzing trace with hash -939184924, now seen corresponding path program 1 times [2024-08-13 21:09:14,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:09:14,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453903811] [2024-08-13 21:09:14,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:09:14,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:09:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:09:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-08-13 21:09:14,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:09:14,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453903811] [2024-08-13 21:09:14,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453903811] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:09:14,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:09:14,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-13 21:09:14,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819360325] [2024-08-13 21:09:14,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:09:14,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-13 21:09:14,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:09:14,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-13 21:09:14,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-13 21:09:14,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:14,570 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:09:14,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:09:14,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:14,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:15,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:15,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:15,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-08-13 21:09:15,126 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:09:15,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:09:15,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1852416898, now seen corresponding path program 1 times [2024-08-13 21:09:15,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:09:15,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629717034] [2024-08-13 21:09:15,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:09:15,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:09:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:09:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-13 21:09:15,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:09:15,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629717034] [2024-08-13 21:09:15,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629717034] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:09:15,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:09:15,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-13 21:09:15,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000319664] [2024-08-13 21:09:15,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:09:15,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-13 21:09:15,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:09:15,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-13 21:09:15,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-13 21:09:15,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:15,204 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:09:15,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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-08-13 21:09:15,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:15,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:15,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:15,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:15,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:15,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:15,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-08-13 21:09:15,606 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:09:15,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:09:15,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1064549038, now seen corresponding path program 2 times [2024-08-13 21:09:15,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:09:15,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104796585] [2024-08-13 21:09:15,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:09:15,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:09:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:09:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:09:16,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:09:16,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104796585] [2024-08-13 21:09:16,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104796585] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 21:09:16,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943782197] [2024-08-13 21:09:16,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-13 21:09:16,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 21:09:16,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 21:09:16,104 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 21:09:16,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-08-13 21:09:16,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-13 21:09:16,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 21:09:16,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 15 conjunts are in the unsatisfiable core [2024-08-13 21:09:16,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 21:09:16,327 INFO L378 Elim1Store]: Elim1 eliminated variable 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-08-13 21:09:16,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-13 21:09:16,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-13 21:09:16,470 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-13 21:09:16,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-13 21:09:16,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-13 21:09:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:09:16,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 21:09:16,654 WARN L854 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_2 (Array Int Int))) (not (= (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|) 0)))) (or (< 64 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_1 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))))) is different from false [2024-08-13 21:09:17,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-08-13 21:09:17,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-13 21:09:17,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 10 treesize of output 8 [2024-08-13 21:09:17,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:09:17,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 33 treesize of output 49 [2024-08-13 21:09:17,369 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-13 21:09:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:09:17,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943782197] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 21:09:17,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 21:09:17,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 25 [2024-08-13 21:09:17,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876432142] [2024-08-13 21:09:17,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 21:09:17,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-08-13 21:09:17,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:09:17,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-08-13 21:09:17,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=4, NotChecked=46, Total=650 [2024-08-13 21:09:17,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:17,421 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:09:17,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:09:17,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:17,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:17,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:17,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:18,177 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse2 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))))) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|))) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse2) (not (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)) (not (= c_~top~0 0)) (not (= (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|)))))) is different from false [2024-08-13 21:09:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:20,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:20,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:20,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-08-13 21:09:20,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-08-13 21:09:20,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-08-13 21:09:20,337 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:09:20,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:09:20,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1804183114, now seen corresponding path program 3 times [2024-08-13 21:09:20,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:09:20,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136757390] [2024-08-13 21:09:20,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:09:20,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:09:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:09:20,411 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-13 21:09:20,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:09:20,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136757390] [2024-08-13 21:09:20,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136757390] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:09:20,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:09:20,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-13 21:09:20,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132120880] [2024-08-13 21:09:20,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:09:20,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-13 21:09:20,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:09:20,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-13 21:09:20,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-13 21:09:20,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:20,418 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:09:20,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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-08-13 21:09:20,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:20,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:20,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:20,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-08-13 21:09:20,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:21,238 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse2 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))))) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|))) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse2) (not (= c_~top~0 0)) (not (= (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|)))))) is different from false [2024-08-13 21:09:21,349 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse2 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))))) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|))) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse2) (not (= (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|)))))) is different from false [2024-08-13 21:09:22,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:22,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:22,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:22,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-08-13 21:09:22,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:22,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-08-13 21:09:22,262 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:09:22,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:09:22,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1259425046, now seen corresponding path program 4 times [2024-08-13 21:09:22,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:09:22,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691803726] [2024-08-13 21:09:22,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:09:22,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:09:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:09:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:09:22,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:09:22,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691803726] [2024-08-13 21:09:22,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691803726] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 21:09:22,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425757748] [2024-08-13 21:09:22,669 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-08-13 21:09:22,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 21:09:22,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 21:09:22,671 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-08-13 21:09:22,673 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-08-13 21:09:22,807 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-08-13 21:09:22,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 21:09:22,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 20 conjunts are in the unsatisfiable core [2024-08-13 21:09:22,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 21:09:22,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-13 21:09:22,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-13 21:09:22,944 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-08-13 21:09:22,945 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-08-13 21:09:23,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:09:23,139 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-08-13 21:09:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:09:23,175 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 21:09:24,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:09:24,076 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-08-13 21:09:24,223 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:09:24,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425757748] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 21:09:24,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 21:09:24,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 29 [2024-08-13 21:09:24,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708988054] [2024-08-13 21:09:24,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 21:09:24,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-08-13 21:09:24,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:09:24,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-08-13 21:09:24,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=742, Unknown=4, NotChecked=0, Total=870 [2024-08-13 21:09:24,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:24,227 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:09:24,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 29 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:09:24,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:24,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:24,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:24,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2024-08-13 21:09:24,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:24,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:27,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:09:35,654 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse2 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))))) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|))) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse2) (not (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)) (not (= (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|)))))) is different from false [2024-08-13 21:09:36,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:36,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:36,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:36,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-08-13 21:09:36,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:36,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-08-13 21:09:36,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-08-13 21:09:36,549 WARN L477 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-08-13 21:09:36,549 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:09:36,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:09:36,550 INFO L85 PathProgramCache]: Analyzing trace with hash 334643482, now seen corresponding path program 5 times [2024-08-13 21:09:36,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:09:36,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889970315] [2024-08-13 21:09:36,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:09:36,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:09:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:09:37,120 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:09:37,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:09:37,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889970315] [2024-08-13 21:09:37,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889970315] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 21:09:37,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301596425] [2024-08-13 21:09:37,121 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-08-13 21:09:37,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 21:09:37,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 21:09:37,123 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 21:09:37,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-08-13 21:09:37,273 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-08-13 21:09:37,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 21:09:37,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 21 conjunts are in the unsatisfiable core [2024-08-13 21:09:37,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 21:09:37,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-13 21:09:37,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-13 21:09:37,381 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-13 21:09:37,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-13 21:09:37,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-13 21:09:37,521 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-08-13 21:09:37,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 22 [2024-08-13 21:09:37,581 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:09:37,581 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 21:09:37,657 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_8 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) is different from false [2024-08-13 21:09:37,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:09:37,934 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-08-13 21:09:37,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:09:37,947 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-08-13 21:09:38,009 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-08-13 21:09:38,009 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 186 treesize of output 190 [2024-08-13 21:09:38,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:09:38,023 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 110 treesize of output 115 [2024-08-13 21:09:38,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2024-08-13 21:09:38,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-13 21:09:38,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-13 21:09:38,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:09:38,292 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 155 treesize of output 150 [2024-08-13 21:09:38,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:09:38,306 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 76 treesize of output 81 [2024-08-13 21:09:38,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2024-08-13 21:09:38,500 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:09:38,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301596425] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 21:09:38,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 21:09:38,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 28 [2024-08-13 21:09:38,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450135116] [2024-08-13 21:09:38,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 21:09:38,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-08-13 21:09:38,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:09:38,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-08-13 21:09:38,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=640, Unknown=7, NotChecked=52, Total=812 [2024-08-13 21:09:38,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:38,506 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:09:38,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.0) internal successors, (116), 28 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:09:38,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:38,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:38,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:38,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-08-13 21:09:38,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:38,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2024-08-13 21:09:38,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:09:42,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:09:44,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:09:48,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:09:50,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:09:58,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:58,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 21:09:58,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:58,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-08-13 21:09:58,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:09:58,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-08-13 21:09:58,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2024-08-13 21:09:58,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-08-13 21:09:58,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-08-13 21:09:58,362 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:09:58,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:09:58,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1728300370, now seen corresponding path program 6 times [2024-08-13 21:09:58,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:09:58,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642554049] [2024-08-13 21:09:58,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:09:58,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:09:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:09:58,825 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:09:58,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:09:58,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642554049] [2024-08-13 21:09:58,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642554049] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 21:09:58,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205092663] [2024-08-13 21:09:58,826 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-08-13 21:09:58,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 21:09:58,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 21:09:58,828 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 21:09:58,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-08-13 21:09:58,980 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-08-13 21:09:58,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 21:09:58,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 20 conjunts are in the unsatisfiable core [2024-08-13 21:09:58,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 21:09:59,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-13 21:09:59,033 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-08-13 21:09:59,033 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 17 treesize of output 21 [2024-08-13 21:09:59,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-13 21:09:59,172 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-08-13 21:09:59,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-08-13 21:09:59,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-13 21:09:59,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-13 21:09:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:09:59,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 21:09:59,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:09:59,866 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-08-13 21:09:59,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:09:59,877 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-08-13 21:09:59,975 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 480 treesize of output 452 [2024-08-13 21:09:59,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2024-08-13 21:10:00,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-08-13 21:10:00,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 50 [2024-08-13 21:10:00,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2024-08-13 21:10:00,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2024-08-13 21:10:00,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-08-13 21:10:00,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 54 treesize of output 50 [2024-08-13 21:10:00,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2024-08-13 21:10:00,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-08-13 21:10:00,469 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:10:00,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205092663] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 21:10:00,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 21:10:00,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2024-08-13 21:10:00,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835773506] [2024-08-13 21:10:00,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 21:10:00,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-08-13 21:10:00,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:10:00,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-08-13 21:10:00,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=537, Unknown=14, NotChecked=0, Total=650 [2024-08-13 21:10:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:00,472 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:10:00,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.423076923076923) internal successors, (115), 25 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:10:00,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:00,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 21:10:00,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:00,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2024-08-13 21:10:00,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:00,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2024-08-13 21:10:00,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2024-08-13 21:10:00,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:01,812 WARN L854 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_11 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (not (= c_~top~0 0)) (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_10 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0))))) is different from false [2024-08-13 21:10:15,382 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0)) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse2 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (< c_~next_alloc_idx~0 63) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))))) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|))) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_1) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse0) (= 3 c_~top~0) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15|) 0)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)))) .cse2) (not (= (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| Int) (v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_15| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_15|)))))) is different from false [2024-08-13 21:10:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 21:10:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:10:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:15,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:15,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-08-13 21:10:15,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:15,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-08-13 21:10:15,630 WARN L477 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-08-13 21:10:15,631 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:10:15,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:10:15,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1542178822, now seen corresponding path program 1 times [2024-08-13 21:10:15,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:10:15,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394581174] [2024-08-13 21:10:15,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:10:15,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:10:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:10:15,953 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-13 21:10:15,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:10:15,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394581174] [2024-08-13 21:10:15,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394581174] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:10:15,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:10:15,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-08-13 21:10:15,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293340693] [2024-08-13 21:10:15,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:10:15,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-13 21:10:15,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:10:15,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-13 21:10:15,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-08-13 21:10:15,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:15,955 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:10:15,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:10:15,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:15,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 21:10:15,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:15,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:10:15,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:15,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:15,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 165 states. [2024-08-13 21:10:15,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:15,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:18,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:18,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 21:10:18,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:18,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:10:18,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:18,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:18,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-08-13 21:10:18,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:18,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-13 21:10:18,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-08-13 21:10:18,948 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:10:18,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:10:18,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2059797706, now seen corresponding path program 2 times [2024-08-13 21:10:18,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:10:18,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231412837] [2024-08-13 21:10:18,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:10:18,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:10:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:10:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-13 21:10:19,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:10:19,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231412837] [2024-08-13 21:10:19,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231412837] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:10:19,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:10:19,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-08-13 21:10:19,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310289224] [2024-08-13 21:10:19,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:10:19,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-13 21:10:19,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:10:19,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-13 21:10:19,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-08-13 21:10:19,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:19,243 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:10:19,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:10:19,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:19,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 21:10:19,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:19,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:10:19,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:19,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:19,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 165 states. [2024-08-13 21:10:19,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:19,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-13 21:10:19,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:22,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:22,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 21:10:22,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:22,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:10:22,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:22,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:22,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-08-13 21:10:22,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:22,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-08-13 21:10:22,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-08-13 21:10:22,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-08-13 21:10:22,793 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:10:22,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:10:22,794 INFO L85 PathProgramCache]: Analyzing trace with hash 754040759, now seen corresponding path program 1 times [2024-08-13 21:10:22,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:10:22,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290195671] [2024-08-13 21:10:22,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:10:22,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:10:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:10:23,245 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-13 21:10:23,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:10:23,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290195671] [2024-08-13 21:10:23,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290195671] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:10:23,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:10:23,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-08-13 21:10:23,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832197551] [2024-08-13 21:10:23,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:10:23,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-13 21:10:23,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:10:23,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-13 21:10:23,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-08-13 21:10:23,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:23,247 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:10:23,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:10:23,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:23,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 21:10:23,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:23,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:10:23,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:23,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:23,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 165 states. [2024-08-13 21:10:23,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:23,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-08-13 21:10:23,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-08-13 21:10:23,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:26,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:26,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 21:10:26,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:26,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:10:26,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:26,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:26,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-08-13 21:10:26,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-08-13 21:10:26,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-08-13 21:10:26,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-08-13 21:10:26,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 21:10:26,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-08-13 21:10:26,769 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:10:26,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:10:26,770 INFO L85 PathProgramCache]: Analyzing trace with hash 56092652, now seen corresponding path program 1 times [2024-08-13 21:10:26,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:10:26,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786234420] [2024-08-13 21:10:26,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:10:26,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:10:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:10:27,079 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-13 21:10:27,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:10:27,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786234420] [2024-08-13 21:10:27,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786234420] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:10:27,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:10:27,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-08-13 21:10:27,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69798224] [2024-08-13 21:10:27,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:10:27,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-08-13 21:10:27,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:10:27,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-08-13 21:10:27,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-08-13 21:10:27,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:27,082 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:10:27,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:10:27,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:27,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 21:10:27,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:27,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:10:27,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:27,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:27,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 165 states. [2024-08-13 21:10:27,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2024-08-13 21:10:27,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-08-13 21:10:27,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-08-13 21:10:27,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 21:10:27,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 21:10:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:10:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-08-13 21:10:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-08-13 21:10:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-08-13 21:10:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-08-13 21:10:30,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 21:10:30,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-08-13 21:10:30,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-08-13 21:10:30,982 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:10:30,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:10:30,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1663336715, now seen corresponding path program 1 times [2024-08-13 21:10:30,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:10:30,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367893901] [2024-08-13 21:10:30,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:10:30,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:10:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:10:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-13 21:10:31,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:10:31,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367893901] [2024-08-13 21:10:31,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367893901] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:10:31,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:10:31,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-08-13 21:10:31,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563451281] [2024-08-13 21:10:31,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:10:31,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-13 21:10:31,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:10:31,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-13 21:10:31,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-08-13 21:10:31,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:31,284 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:10:31,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:10:31,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:31,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 21:10:31,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:31,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:10:31,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:31,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:31,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 165 states. [2024-08-13 21:10:31,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2024-08-13 21:10:31,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-08-13 21:10:31,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-08-13 21:10:31,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 21:10:31,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-08-13 21:10:31,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:38,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:10:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 21:10:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:10:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:38,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2024-08-13 21:10:38,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-08-13 21:10:38,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-08-13 21:10:38,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-08-13 21:10:38,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 21:10:38,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-08-13 21:10:38,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-13 21:10:38,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-08-13 21:10:38,371 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:10:38,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:10:38,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1518022142, now seen corresponding path program 2 times [2024-08-13 21:10:38,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:10:38,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175498453] [2024-08-13 21:10:38,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:10:38,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:10:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:10:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-13 21:10:38,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:10:38,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175498453] [2024-08-13 21:10:38,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175498453] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:10:38,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:10:38,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-08-13 21:10:38,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422609995] [2024-08-13 21:10:38,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:10:38,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-08-13 21:10:38,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:10:38,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-08-13 21:10:38,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-08-13 21:10:38,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:38,676 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:10:38,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:10:38,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:38,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 21:10:38,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:38,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:10:38,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:38,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:38,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 170 states. [2024-08-13 21:10:38,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-08-13 21:10:38,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-08-13 21:10:38,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-08-13 21:10:38,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 21:10:38,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-08-13 21:10:38,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-13 21:10:38,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 21:10:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:10:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2024-08-13 21:10:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-08-13 21:10:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-08-13 21:10:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-08-13 21:10:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 21:10:44,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-08-13 21:10:44,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-13 21:10:44,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-08-13 21:10:44,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-08-13 21:10:44,127 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:10:44,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:10:44,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1789404414, now seen corresponding path program 3 times [2024-08-13 21:10:44,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:10:44,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071565205] [2024-08-13 21:10:44,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:10:44,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:10:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:10:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-13 21:10:44,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:10:44,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071565205] [2024-08-13 21:10:44,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071565205] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:10:44,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:10:44,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-08-13 21:10:44,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48377077] [2024-08-13 21:10:44,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:10:44,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-13 21:10:44,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:10:44,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-13 21:10:44,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-08-13 21:10:44,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:44,401 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:10:44,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:10:44,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:44,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 21:10:44,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:44,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:10:44,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:44,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:44,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 171 states. [2024-08-13 21:10:44,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-08-13 21:10:44,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-08-13 21:10:44,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-08-13 21:10:44,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 21:10:44,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-08-13 21:10:44,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-13 21:10:44,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-08-13 21:10:44,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 21:10:49,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:49,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:10:49,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:49,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-08-13 21:10:49,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2024-08-13 21:10:49,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-08-13 21:10:49,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-08-13 21:10:49,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-08-13 21:10:49,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 21:10:49,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-08-13 21:10:49,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-13 21:10:49,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-08-13 21:10:49,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-08-13 21:10:49,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-13 21:10:49,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-08-13 21:10:49,366 INFO L445 BasicCegarLoop]: Path program histogram: [6, 3, 2, 1, 1, 1, 1] [2024-08-13 21:10:49,366 INFO L308 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork0 was SAFE (1/4) [2024-08-13 21:10:49,368 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 21:10:49,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-13 21:10:49,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 21:10:49,371 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-13 21:10:49,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2024-08-13 21:10:49,376 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-13 21:10:49,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-13 21:10:49,377 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5d7b27e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 21:10:49,377 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-13 21:10:49,560 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 21:10:49,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:10:49,560 INFO L85 PathProgramCache]: Analyzing trace with hash -367205657, now seen corresponding path program 1 times [2024-08-13 21:10:49,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:10:49,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617348031] [2024-08-13 21:10:49,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:10:49,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:10:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:10:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-08-13 21:10:49,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:10:49,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617348031] [2024-08-13 21:10:49,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617348031] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:10:49,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:10:49,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-13 21:10:49,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145610190] [2024-08-13 21:10:49,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:10:49,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-13 21:10:49,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:10:49,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-13 21:10:49,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-13 21:10:49,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:49,624 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:10:49,625 INFO L496 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-08-13 21:10:49,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:49,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:49,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-08-13 21:10:49,905 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 21:10:49,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:10:49,906 INFO L85 PathProgramCache]: Analyzing trace with hash -613568695, now seen corresponding path program 1 times [2024-08-13 21:10:49,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:10:49,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024029164] [2024-08-13 21:10:49,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:10:49,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:10:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:10:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-08-13 21:10:50,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:10:50,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024029164] [2024-08-13 21:10:50,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024029164] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:10:50,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:10:50,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-13 21:10:50,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191348771] [2024-08-13 21:10:50,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:10:50,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-13 21:10:50,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:10:50,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-13 21:10:50,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-13 21:10:50,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:50,150 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:10:50,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:10:50,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:50,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:50,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:50,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:50,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-08-13 21:10:50,267 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-08-13 21:10:50,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:10:50,267 INFO L85 PathProgramCache]: Analyzing trace with hash 884164538, now seen corresponding path program 1 times [2024-08-13 21:10:50,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:10:50,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828914627] [2024-08-13 21:10:50,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:10:50,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:10:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-13 21:10:50,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-13 21:10:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-13 21:10:50,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-13 21:10:50,329 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-13 21:10:50,329 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-08-13 21:10:50,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-08-13 21:10:50,331 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-08-13 21:10:50,331 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/4) [2024-08-13 21:10:50,331 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-08-13 21:10:50,331 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-08-13 21:10:50,368 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-13 21:10:50,370 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 21:10:50,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-13 21:10:50,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 21:10:50,372 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-13 21:10:50,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2024-08-13 21:10:50,377 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-13 21:10:50,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of4ForFork0 ======== [2024-08-13 21:10:50,378 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5d7b27e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 21:10:50,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-13 21:10:50,637 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:10:50,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:10:50,638 INFO L85 PathProgramCache]: Analyzing trace with hash -880348114, now seen corresponding path program 1 times [2024-08-13 21:10:50,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:10:50,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659858287] [2024-08-13 21:10:50,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:10:50,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:10:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:10:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-13 21:10:50,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:10:50,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659858287] [2024-08-13 21:10:50,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659858287] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:10:50,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:10:50,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-13 21:10:50,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009662892] [2024-08-13 21:10:50,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:10:50,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-13 21:10:50,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:10:50,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-13 21:10:50,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-13 21:10:50,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:50,726 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:10:50,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:10:50,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:51,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:51,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-08-13 21:10:51,101 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:10:51,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:10:51,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1485995627, now seen corresponding path program 1 times [2024-08-13 21:10:51,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:10:51,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059175383] [2024-08-13 21:10:51,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:10:51,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:10:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:10:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-08-13 21:10:51,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:10:51,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059175383] [2024-08-13 21:10:51,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059175383] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:10:51,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:10:51,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-08-13 21:10:51,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131499627] [2024-08-13 21:10:51,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:10:51,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-13 21:10:51,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:10:51,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-13 21:10:51,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-08-13 21:10:51,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:51,263 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:10:51,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:10:51,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:51,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:52,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:52,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:52,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-08-13 21:10:52,571 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:10:52,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:10:52,571 INFO L85 PathProgramCache]: Analyzing trace with hash -167217874, now seen corresponding path program 1 times [2024-08-13 21:10:52,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:10:52,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990567310] [2024-08-13 21:10:52,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:10:52,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:10:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:10:52,624 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-13 21:10:52,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:10:52,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990567310] [2024-08-13 21:10:52,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990567310] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:10:52,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:10:52,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-13 21:10:52,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194396410] [2024-08-13 21:10:52,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:10:52,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-13 21:10:52,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:10:52,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-13 21:10:52,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-13 21:10:52,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:52,626 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:10:52,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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-08-13 21:10:52,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:52,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:52,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:53,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:53,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:53,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:53,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-08-13 21:10:53,433 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:10:53,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:10:53,433 INFO L85 PathProgramCache]: Analyzing trace with hash 471521324, now seen corresponding path program 1 times [2024-08-13 21:10:53,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:10:53,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374703416] [2024-08-13 21:10:53,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:10:53,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:10:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:10:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-13 21:10:53,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:10:53,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374703416] [2024-08-13 21:10:53,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374703416] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:10:53,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 21:10:53,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-13 21:10:53,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57371788] [2024-08-13 21:10:53,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:10:53,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-13 21:10:53,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:10:53,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-13 21:10:53,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-08-13 21:10:53,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:53,493 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:10:53,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 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-08-13 21:10:53,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:53,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:53,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:53,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:54,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:54,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:54,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:54,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:54,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-08-13 21:10:54,239 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:10:54,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:10:54,239 INFO L85 PathProgramCache]: Analyzing trace with hash 798454995, now seen corresponding path program 1 times [2024-08-13 21:10:54,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:10:54,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105833078] [2024-08-13 21:10:54,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:10:54,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:10:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:10:54,575 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:10:54,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:10:54,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105833078] [2024-08-13 21:10:54,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105833078] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 21:10:54,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183719555] [2024-08-13 21:10:54,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:10:54,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 21:10:54,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 21:10:54,578 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 21:10:54,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-08-13 21:10:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:10:54,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 14 conjunts are in the unsatisfiable core [2024-08-13 21:10:54,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 21:10:54,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 8 treesize of output 1 [2024-08-13 21:10:54,821 INFO L378 Elim1Store]: Elim1 eliminated variable 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-08-13 21:10:54,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-13 21:10:54,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-13 21:10:54,951 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-13 21:10:54,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-13 21:10:54,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-13 21:10:55,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:10:55,026 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 21:10:55,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-08-13 21:10:55,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-08-13 21:10:56,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:10:56,073 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-08-13 21:10:56,138 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-13 21:10:56,191 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:10:56,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183719555] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 21:10:56,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 21:10:56,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 28 [2024-08-13 21:10:56,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108723297] [2024-08-13 21:10:56,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 21:10:56,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-08-13 21:10:56,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:10:56,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-08-13 21:10:56,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=692, Unknown=8, NotChecked=0, Total=812 [2024-08-13 21:10:56,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:10:56,194 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:10:56,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.896551724137931) internal successors, (142), 28 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:10:56,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:56,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:56,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:56,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:10:56,194 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:11:06,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:06,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:06,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:06,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:06,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:11:06,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-08-13 21:11:06,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 21:11:06,609 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:11:06,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:11:06,610 INFO L85 PathProgramCache]: Analyzing trace with hash 845683098, now seen corresponding path program 2 times [2024-08-13 21:11:06,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:11:06,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165538693] [2024-08-13 21:11:06,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:11:06,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:11:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:11:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:11:07,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:11:07,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165538693] [2024-08-13 21:11:07,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165538693] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 21:11:07,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389074083] [2024-08-13 21:11:07,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-13 21:11:07,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 21:11:07,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 21:11:07,021 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 21:11:07,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-08-13 21:11:07,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-08-13 21:11:07,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 21:11:07,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 22 conjunts are in the unsatisfiable core [2024-08-13 21:11:07,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 21:11: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 13 treesize of output 9 [2024-08-13 21:11:07,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-13 21:11:07,335 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-08-13 21:11:07,336 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 96 [2024-08-13 21:11:07,401 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-08-13 21:11:07,402 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-08-13 21:11:07,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-13 21:11:07,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:11:07,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-08-13 21:11:07,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-08-13 21:11:07,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-13 21:11:08,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:11:08,085 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 62 treesize of output 42 [2024-08-13 21:11:08,121 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-13 21:11:08,121 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-13 21:11:08,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389074083] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:11:08,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-13 21:11:08,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 23 [2024-08-13 21:11:08,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848425418] [2024-08-13 21:11:08,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:11:08,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-13 21:11:08,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:11:08,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-13 21:11:08,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2024-08-13 21:11:08,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:11:08,123 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:11:08,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 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-08-13 21:11:08,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:08,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:08,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:08,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:08,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:11:08,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:11:09,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:09,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:09,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:09,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:09,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:11:09,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-13 21:11:09,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-08-13 21:11:10,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-08-13 21:11:10,061 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:11:10,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:11:10,061 INFO L85 PathProgramCache]: Analyzing trace with hash -665294148, now seen corresponding path program 3 times [2024-08-13 21:11:10,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:11:10,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044463651] [2024-08-13 21:11:10,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:11:10,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:11:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:11:10,450 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:11:10,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:11:10,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044463651] [2024-08-13 21:11:10,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044463651] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 21:11:10,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805547463] [2024-08-13 21:11:10,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-08-13 21:11:10,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 21:11:10,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 21:11:10,452 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 21:11:10,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-08-13 21:11:10,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-08-13 21:11:10,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 21:11:10,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 19 conjunts are in the unsatisfiable core [2024-08-13 21:11:10,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 21:11:10,630 INFO L378 Elim1Store]: Elim1 eliminated variable 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-08-13 21:11:10,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-08-13 21:11:10,716 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-08-13 21:11:10,717 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-08-13 21:11:10,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-13 21:11:10,817 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-08-13 21:11:10,818 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-08-13 21:11:10,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-13 21:11:10,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:11:10,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-08-13 21:11:11,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:11:11,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 131 [2024-08-13 21:11:11,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:11:11,550 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 63 treesize of output 68 [2024-08-13 21:11:11,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 57 [2024-08-13 21:11:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-13 21:11:11,696 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-13 21:11:11,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805547463] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:11:11,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-13 21:11:11,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 21 [2024-08-13 21:11:11,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018988262] [2024-08-13 21:11:11,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:11:11,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-13 21:11:11,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:11:11,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-13 21:11:11,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2024-08-13 21:11:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:11:11,698 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:11:11,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 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-08-13 21:11:11,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:11,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:11,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:11,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:11,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:11:11,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-13 21:11:11,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:11:13,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:13,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:13,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:13,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:13,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:11:13,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-13 21:11:13,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-13 21:11:13,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-08-13 21:11:13,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-08-13 21:11:13,911 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:11:13,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:11:13,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1507100570, now seen corresponding path program 4 times [2024-08-13 21:11:13,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:11:13,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129583044] [2024-08-13 21:11:13,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:11:13,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:11:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:11:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:11:14,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:11:14,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129583044] [2024-08-13 21:11:14,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129583044] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 21:11:14,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063665179] [2024-08-13 21:11:14,282 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-08-13 21:11:14,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 21:11:14,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 21:11:14,284 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 21:11:14,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-08-13 21:11:14,461 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-08-13 21:11:14,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 21:11:14,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 26 conjunts are in the unsatisfiable core [2024-08-13 21:11:14,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 21:11:14,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-08-13 21:11:14,498 INFO L378 Elim1Store]: Elim1 eliminated variable 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-08-13 21:11:14,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-13 21:11:14,631 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-08-13 21:11:14,632 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-08-13 21:11:14,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:11:14,756 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-08-13 21:11:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:11:14,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 21:11:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-08-13 21:11:15,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063665179] provided 1 perfect and 1 imperfect interpolant sequences [2024-08-13 21:11:15,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-08-13 21:11:15,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14, 12] total 32 [2024-08-13 21:11:15,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656207334] [2024-08-13 21:11:15,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:11:15,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-13 21:11:15,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:11:15,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-13 21:11:15,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=803, Unknown=15, NotChecked=0, Total=992 [2024-08-13 21:11:15,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:11:15,274 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:11:15,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:11:15,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:15,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:15,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:15,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:15,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-08-13 21:11:15,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-13 21:11:15,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-13 21:11:15,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:11:15,756 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_DerPreprocessor_22 (Array Int Int)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.base| Int)) (or (= (select v_DerPreprocessor_22 |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0))))) (.cse1 (< c_~next_alloc_idx~0 65))) (and (or (= |c_thr1Thread4of4ForFork0_push_#t~mem1#1| 0) (and (or (< 64 c_~next_alloc_idx~0) (= c_~next_alloc_idx~0 0) (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store |c_#memory_int| |thr1Thread3of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0)))) (or .cse0 .cse1))) (not (= c_~top~0 0)) (or .cse0 .cse1 (= (select (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0)))) is different from false [2024-08-13 21:11:17,430 WARN L854 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (= c_~next_alloc_idx~0 0) (forall ((|thr1Thread3of4ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store |c_#memory_int| |thr1Thread3of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0)))) (not (= c_~top~0 0)) (or (forall ((v_DerPreprocessor_22 (Array Int Int)) (|thr1Thread3of4ForFork0_push_~#newTop~0#1.base| Int)) (or (= (select v_DerPreprocessor_22 |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0)))) (< c_~next_alloc_idx~0 65))) is different from false [2024-08-13 21:11:19,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:11:21,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2024-08-13 21:11:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-13 21:11:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-13 21:11:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-08-13 21:11:21,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-08-13 21:11:21,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 21:11:21,268 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:11:21,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:11:21,269 INFO L85 PathProgramCache]: Analyzing trace with hash -55149094, now seen corresponding path program 5 times [2024-08-13 21:11:21,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:11:21,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879286479] [2024-08-13 21:11:21,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:11:21,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:11:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:11:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-13 21:11:21,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:11:21,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879286479] [2024-08-13 21:11:21,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879286479] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 21:11:21,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504851260] [2024-08-13 21:11:21,644 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-08-13 21:11:21,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 21:11:21,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 21:11:21,646 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 21:11:21,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-08-13 21:11:21,833 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-08-13 21:11:21,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 21:11:21,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 31 conjunts are in the unsatisfiable core [2024-08-13 21:11:21,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 21:11:21,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-13 21:11:21,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-13 21:11:21,946 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-08-13 21:11:21,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-08-13 21:11:22,066 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-08-13 21:11:22,066 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 17 treesize of output 21 [2024-08-13 21:11:22,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2024-08-13 21:11:22,137 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-13 21:11:22,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-13 21:11:22,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-08-13 21:11:22,238 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-08-13 21:11:22,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2024-08-13 21:11:22,268 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 15 treesize of output 7 [2024-08-13 21:11:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-13 21:11:22,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 21:11:22,449 WARN L854 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_24) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or (< 64 c_~next_alloc_idx~0) (let ((.cse0 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_1908 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1908)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_1908 c_~next_alloc_idx~0)))) (or (forall ((v_ArrVal_1908 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_24 (Array Int Int))) (or (< v_ArrVal_1908 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1908)) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_24) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 63)))))) is different from false [2024-08-13 21:11:22,583 WARN L854 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|))) (and (or (< c_~next_alloc_idx~0 63) (forall ((v_ArrVal_1905 Int) (v_ArrVal_1908 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18| Int) (v_DerPreprocessor_24 (Array Int Int))) (or (< v_ArrVal_1908 c_~next_alloc_idx~0) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_1905) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1908)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_24) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_1905 Int) (v_ArrVal_1908 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse0 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1908)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_25) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_1908 c_~next_alloc_idx~0) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_1905) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18|) 0))))))) (< 64 c_~next_alloc_idx~0)) (or (forall ((v_ArrVal_1905 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18| Int) (v_DerPreprocessor_24 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_1905) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_24) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65))) is different from false [2024-08-13 21:11:23,945 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-13 21:11:23,945 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 48 treesize of output 44 [2024-08-13 21:11:23,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-13 21:11:23,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-08-13 21:11:23,988 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-08-13 21:11:23,989 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 94 treesize of output 88 [2024-08-13 21:11:24,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:11:24,717 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-08-13 21:11:24,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:11:24,727 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-08-13 21:11:24,792 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 119 treesize of output 106 [2024-08-13 21:11:24,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-08-13 21:11:26,868 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 3 times theorem prover too weak. 3 trivial. 0 not checked. [2024-08-13 21:11:26,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504851260] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 21:11:26,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 21:11:26,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 40 [2024-08-13 21:11:26,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607627948] [2024-08-13 21:11:26,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 21:11:26,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-08-13 21:11:26,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:11:26,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-08-13 21:11:26,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1255, Unknown=28, NotChecked=150, Total=1640 [2024-08-13 21:11:26,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:11:26,871 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:11:26,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.682926829268293) internal successors, (151), 40 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:11:26,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:26,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:26,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:26,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:11:26,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2024-08-13 21:11:26,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-13 21:11:26,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-13 21:11:26,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-08-13 21:11:26,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:11:32,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:11:34,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:11:36,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:11:38,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:11:40,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:11:43,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:11:45,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:11:47,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:11:50,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:11:52,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:11:54,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:11:56,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:11:58,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:12:00,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:12:02,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:12:04,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:12:07,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:12:09,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:12:11,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:12:13,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:12:15,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-13 21:12:19,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-13 21:12:21,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-13 21:12:31,031 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< 62 c_~next_alloc_idx~0)) (.cse1 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse2 (< c_~next_alloc_idx~0 63)) (.cse3 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (and (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)))) (not (= (select .cse1 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0)) (or (and (or .cse2 (forall ((v_ArrVal_1905 Int) (v_ArrVal_1908 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18| Int) (v_DerPreprocessor_24 (Array Int Int))) (or (< v_ArrVal_1908 c_~next_alloc_idx~0) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_1905) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1908)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_24) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse0 (forall ((v_ArrVal_1905 Int) (v_ArrVal_1908 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1908)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_25) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_1908 c_~next_alloc_idx~0) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_1905) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18|) 0)))))) .cse3) (or (forall ((v_ArrVal_1905 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18| Int) (v_DerPreprocessor_24 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_1905) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_24) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65)) (or (and (forall ((v_prenex_127 Int) (v_prenex_128 Int) (v_prenex_125 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_27 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_18| Int) (v_prenex_129 Int) (v_DerPreprocessor_25 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_18| v_prenex_125) (= (select v_DerPreprocessor_27 |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|) 0) (< v_prenex_127 (+ c_~next_alloc_idx~0 2)) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_27) v_prenex_125 (store (select |c_#memory_int| v_prenex_125) v_prenex_128 v_prenex_127)) v_prenex_129 v_DerPreprocessor_25) v_prenex_125) v_prenex_128)) (= v_prenex_129 v_prenex_125))) (or (and (forall ((v_prenex_130 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_18| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_18| v_prenex_130) (forall ((v_prenex_132 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_prenex_134 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| v_prenex_130 v_DerPreprocessor_26) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_18| v_prenex_134) v_prenex_130) v_prenex_132))))) (forall ((v_prenex_130 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_18| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_18| v_prenex_130) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_27 (Array Int Int))) (or (= (select v_DerPreprocessor_27 |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|) 0) (forall ((v_prenex_132 Int) (v_prenex_133 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_prenex_134 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_27) v_prenex_130 v_DerPreprocessor_26) v_prenex_133 v_prenex_134) v_prenex_130) v_prenex_132)) (= v_prenex_133 v_prenex_130)))))))) .cse2)) .cse3))) is different from false [2024-08-13 21:12:43,294 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< 62 c_~next_alloc_idx~0)) (.cse1 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|)) (.cse2 (< c_~next_alloc_idx~0 63)) (.cse3 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (and (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)))) (not (= (select .cse1 |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|) 0)) (or (and (or .cse2 (forall ((v_ArrVal_1905 Int) (v_ArrVal_1908 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18| Int) (v_DerPreprocessor_24 (Array Int Int))) (or (< v_ArrVal_1908 c_~next_alloc_idx~0) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_1905) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1908)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_24) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) (or .cse0 (forall ((v_ArrVal_1905 Int) (v_ArrVal_1908 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18| Int) (v_DerPreprocessor_25 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_1908)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_25) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_1908 c_~next_alloc_idx~0) (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_1905) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18|) 0)))))) .cse3) (or (forall ((v_ArrVal_1905 Int) (v_DerPreprocessor_26 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18| Int) (v_DerPreprocessor_24 (Array Int Int))) (or (not (= (select (store |c_#valid| |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_1905) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_24) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (< c_~next_alloc_idx~0 65)) (not (= c_~top~0 0)) (or (and (forall ((v_prenex_127 Int) (v_prenex_128 Int) (v_prenex_125 Int) (|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_27 (Array Int Int)) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_18| Int) (v_prenex_129 Int) (v_DerPreprocessor_25 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_18| v_prenex_125) (= (select v_DerPreprocessor_27 |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|) 0) (< v_prenex_127 (+ c_~next_alloc_idx~0 2)) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_27) v_prenex_125 (store (select |c_#memory_int| v_prenex_125) v_prenex_128 v_prenex_127)) v_prenex_129 v_DerPreprocessor_25) v_prenex_125) v_prenex_128)) (= v_prenex_129 v_prenex_125))) (or (and (forall ((v_prenex_130 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_18| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_18| v_prenex_130) (forall ((v_prenex_132 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_prenex_134 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| v_prenex_130 v_DerPreprocessor_26) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_18| v_prenex_134) v_prenex_130) v_prenex_132))))) (forall ((v_prenex_130 Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_18| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_18| v_prenex_130) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_27 (Array Int Int))) (or (= (select v_DerPreprocessor_27 |thr1Thread2of4ForFork0_push_~#newTop~0#1.offset|) 0) (forall ((v_prenex_132 Int) (v_prenex_133 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_prenex_134 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_18| v_DerPreprocessor_27) v_prenex_130 v_DerPreprocessor_26) v_prenex_133 v_prenex_134) v_prenex_130) v_prenex_132)) (= v_prenex_133 v_prenex_130)))))))) .cse2)) .cse3))) is different from false [2024-08-13 21:12:47,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:12:49,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:12:51,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:12:52,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:12:54,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:12:56,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:12:58,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:00,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:02,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:04,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:06,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:08,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:10,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:12,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:14,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:16,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:18,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:20,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:22,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:24,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:26,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:28,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:30,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:32,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:34,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:36,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:38,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:40,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:42,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:44,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:46,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:48,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:50,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:56,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:13:58,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:00,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:02,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:04,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:06,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:08,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:13,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:15,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:17,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:19,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:21,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:23,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:26,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:28,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:30,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:32,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:34,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:36,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:38,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:40,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:43,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:46,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:48,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:50,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:52,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:54,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:56,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:14:58,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:00,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:02,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:04,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:06,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:09,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:11,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:13,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:15,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:17,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:19,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:21,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:23,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:25,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:27,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:29,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:31,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:33,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:36,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:38,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:40,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:42,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:44,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:46,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:48,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:50,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:15:50,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:15:50,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:15:50,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:15:50,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:15:50,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2024-08-13 21:15:50,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-13 21:15:50,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-13 21:15:50,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-08-13 21:15:50,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-08-13 21:15:50,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-08-13 21:15:50,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 21:15:50,548 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:15:50,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:15:50,548 INFO L85 PathProgramCache]: Analyzing trace with hash 763411534, now seen corresponding path program 2 times [2024-08-13 21:15:50,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:15:50,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306134554] [2024-08-13 21:15:50,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:15:50,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:15:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:15:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:15:50,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:15:50,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306134554] [2024-08-13 21:15:50,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306134554] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 21:15:50,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292496701] [2024-08-13 21:15:50,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-08-13 21:15:50,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 21:15:50,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 21:15:50,831 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 21:15:50,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-08-13 21:15:51,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-08-13 21:15:51,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 21:15:51,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 17 conjunts are in the unsatisfiable core [2024-08-13 21:15:51,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 21:15:51,016 INFO L378 Elim1Store]: Elim1 eliminated variable 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-08-13 21:15:51,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-08-13 21:15:51,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-08-13 21:15:51,102 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-08-13 21:15:51,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-08-13 21:15:51,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-08-13 21:15:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:15:51,159 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 21:15:51,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-08-13 21:15:51,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-08-13 21:15:51,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-08-13 21:15:51,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:15:51,600 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-08-13 21:15:51,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:15:51,633 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 21 treesize of output 22 [2024-08-13 21:15:51,636 INFO L173 IndexEqualityManager]: detected equality via solver [2024-08-13 21:15:51,638 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 19 treesize of output 11 [2024-08-13 21:15:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:15:51,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292496701] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 21:15:51,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 21:15:51,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 25 [2024-08-13 21:15:51,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146450790] [2024-08-13 21:15:51,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 21:15:51,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-08-13 21:15:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:15:51,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-08-13 21:15:51,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=544, Unknown=13, NotChecked=0, Total=650 [2024-08-13 21:15:51,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:15:51,682 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:15:51,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 25 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:15:51,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:15:51,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:15:51,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:15:51,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:15:51,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2024-08-13 21:15:51,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-13 21:15:51,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-13 21:15:51,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-08-13 21:15:51,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-08-13 21:15:51,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:16:01,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:16:04,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:16:06,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:16:12,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:16:14,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:16:16,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:16:18,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:16:21,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:16:23,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:16:25,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:16:30,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:16:40,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:16:42,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:16:44,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:16:49,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:16:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:16:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:16:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:16:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:16:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2024-08-13 21:16:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-13 21:16:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-13 21:16:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-08-13 21:16:49,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-08-13 21:16:49,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-08-13 21:16:49,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-08-13 21:16:49,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-08-13 21:16:49,493 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:16:49,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:16:49,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1413091372, now seen corresponding path program 6 times [2024-08-13 21:16:49,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:16:49,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467290095] [2024-08-13 21:16:49,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:16:49,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:16:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:16:49,840 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:16:49,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:16:49,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467290095] [2024-08-13 21:16:49,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467290095] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 21:16:49,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423274868] [2024-08-13 21:16:49,841 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-08-13 21:16:49,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 21:16:49,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 21:16:49,843 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 21:16:49,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-08-13 21:16:50,027 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-08-13 21:16:50,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-08-13 21:16:50,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjunts are in the unsatisfiable core [2024-08-13 21:16:50,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 21:16:50,038 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 0 case distinctions, treesize of input 34 treesize of output 45 [2024-08-13 21:16:50,042 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 12 treesize of output 1 [2024-08-13 21:16:50,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2024-08-13 21:16:50,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-13 21:16:50,148 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-08-13 21:16:50,148 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-08-13 21:16:50,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-13 21:16:50,219 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-08-13 21:16:50,219 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-08-13 21:16:50,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-08-13 21:16:50,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:16:50,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-08-13 21:16:50,709 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-08-13 21:16:50,713 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-08-13 21:16:50,713 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-08-13 21:16:50,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423274868] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 21:16:50,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-08-13 21:16:50,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 21 [2024-08-13 21:16:50,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227282671] [2024-08-13 21:16:50,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 21:16:50,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-13 21:16:50,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:16:50,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-13 21:16:50,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2024-08-13 21:16:50,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:16:50,714 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:16:50,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 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-08-13 21:16:50,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:16:50,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:16:50,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:16:50,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:16:50,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 138 states. [2024-08-13 21:16:50,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-13 21:16:50,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-13 21:16:50,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-08-13 21:16:50,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-08-13 21:16:50,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-08-13 21:16:50,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:16:54,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:16:54,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:16:54,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:16:54,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:16:54,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2024-08-13 21:16:54,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-13 21:16:54,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-13 21:16:54,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-08-13 21:16:54,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-08-13 21:16:54,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-08-13 21:16:54,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-08-13 21:16:54,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-08-13 21:16:54,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-08-13 21:16:54,804 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-13 21:16:54,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 21:16:54,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1660265550, now seen corresponding path program 7 times [2024-08-13 21:16:54,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 21:16:54,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573370875] [2024-08-13 21:16:54,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 21:16:54,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 21:16:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:16:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:16:55,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 21:16:55,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573370875] [2024-08-13 21:16:55,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573370875] provided 0 perfect and 1 imperfect interpolant sequences [2024-08-13 21:16:55,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865946064] [2024-08-13 21:16:55,243 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-08-13 21:16:55,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-08-13 21:16:55,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 21:16:55,245 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-08-13 21:16:55,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-08-13 21:16:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 21:16:55,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 16 conjunts are in the unsatisfiable core [2024-08-13 21:16:55,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-08-13 21:16:55,442 INFO L378 Elim1Store]: Elim1 eliminated variable 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-08-13 21:16:55,488 INFO L378 Elim1Store]: Elim1 eliminated variable 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-08-13 21:16:55,546 INFO L378 Elim1Store]: Elim1 eliminated variable 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 15 treesize of output 1 [2024-08-13 21:16:55,585 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-08-13 21:16:55,585 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 23 treesize of output 15 [2024-08-13 21:16:55,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:16:55,670 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 22 treesize of output 18 [2024-08-13 21:16:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:16:55,687 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-08-13 21:17:00,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:17:00,355 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-08-13 21:17:00,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-08-13 21:17:00,432 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 3674 treesize of output 3638 [2024-08-13 21:17:00,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2024-08-13 21:17:00,911 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 21:17:00,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865946064] provided 0 perfect and 2 imperfect interpolant sequences [2024-08-13 21:17:00,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-08-13 21:17:00,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 27 [2024-08-13 21:17:00,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823768623] [2024-08-13 21:17:00,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-08-13 21:17:00,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-08-13 21:17:00,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 21:17:00,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-08-13 21:17:00,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=634, Unknown=13, NotChecked=0, Total=756 [2024-08-13 21:17:00,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:17:00,913 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 21:17:00,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.607142857142857) internal successors, (157), 27 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 21:17:00,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:17:00,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:17:00,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:17:00,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-08-13 21:17:00,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 138 states. [2024-08-13 21:17:00,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-08-13 21:17:00,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-13 21:17:00,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-08-13 21:17:00,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2024-08-13 21:17:00,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-08-13 21:17:00,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-08-13 21:17:00,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 21:17:04,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:17:06,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:17:08,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:17:10,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:17:13,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:17:15,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:17:18,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:17:20,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:17:24,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:17:26,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:17:28,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:17:30,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:17:32,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:17:34,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:17:36,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:17:38,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:17:40,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:17:42,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:17:49,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:00,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:02,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:04,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:06,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:09,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:12,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:14,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:16,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:18,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:19,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:21,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:22,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:23,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:25,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:26,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:27,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:29,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:30,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:31,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:33,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:34,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:35,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-13 21:18:40,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:42,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:44,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:46,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:49,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:51,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:18:55,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:18:57,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:18:59,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:19:01,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:19:04,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:19:06,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:19:10,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:19:12,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:19:14,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:19:16,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:19:18,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:19:20,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:19:22,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:19:24,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:19:26,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:19:29,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:19:31,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:19:33,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:19:38,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:19:40,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:19:44,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:19:46,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:19:50,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:19:56,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:19:58,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:20:02,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:20:04,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:20:06,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:20:08,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:20:10,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-13 21:20:12,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:20:14,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:20:17,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:20:19,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:20:21,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:20:23,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:20:28,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:20:30,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:20:32,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:20:34,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:20:36,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:20:38,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:20:40,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:20:42,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:20:44,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:20:46,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:20:48,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:20:51,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:20:53,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:20:56,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:20:58,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:21:00,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:21:02,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:21:04,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:21:06,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-08-13 21:21:08,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:21:10,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:21:18,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:21:20,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:21:22,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:21:24,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:21:26,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:21:29,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:21:31,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:21:34,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-13 21:21:36,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-13 21:21:39,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-13 21:21:41,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-08-13 21:21:45,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:21:47,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:21:49,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:21:51,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:21:53,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:21:55,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:21:57,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:21:59,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:22:01,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:22:03,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:22:05,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:22:07,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:22:09,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:22:11,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:22:13,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:22:34,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:22:36,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:22:38,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:22:40,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:22:42,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:22:44,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:22:46,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-08-13 21:22:48,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15