./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 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2520d7ca 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/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d59c014df9ead169c56b7ae39b852ef0f17fdf8c183ee9a03f7bf209d03f772f --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-2520d7c-m [2024-07-17 08:42:54,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-07-17 08:42:54,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-07-17 08:42:54,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-07-17 08:42:54,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-07-17 08:42:54,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-07-17 08:42:54,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-07-17 08:42:54,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-07-17 08:42:54,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-07-17 08:42:54,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-07-17 08:42:54,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-07-17 08:42:54,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-07-17 08:42:54,796 INFO L153 SettingsManager]: * Use SBE=true [2024-07-17 08:42:54,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-07-17 08:42:54,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-07-17 08:42:54,797 INFO L153 SettingsManager]: * sizeof long=4 [2024-07-17 08:42:54,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-07-17 08:42:54,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-07-17 08:42:54,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-07-17 08:42:54,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-07-17 08:42:54,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-07-17 08:42:54,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-07-17 08:42:54,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-07-17 08:42:54,799 INFO L153 SettingsManager]: * sizeof long double=12 [2024-07-17 08:42:54,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-07-17 08:42:54,799 INFO L153 SettingsManager]: * Use constant arrays=true [2024-07-17 08:42:54,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-07-17 08:42:54,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-07-17 08:42:54,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-07-17 08:42:54,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-07-17 08:42:54,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-07-17 08:42:54,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-07-17 08:42:54,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-07-17 08:42:54,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-07-17 08:42:54,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-07-17 08:42:54,802 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-07-17 08:42:54,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-07-17 08:42:54,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-07-17 08:42:54,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-07-17 08:42:54,803 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-07-17 08:42:54,803 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-07-17 08:42:54,803 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-07-17 08:42:54,803 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d59c014df9ead169c56b7ae39b852ef0f17fdf8c183ee9a03f7bf209d03f772f [2024-07-17 08:42:55,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-07-17 08:42:55,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-07-17 08:42:55,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-07-17 08:42:55,055 INFO L270 PluginConnector]: Initializing CDTParser... [2024-07-17 08:42:55,055 INFO L274 PluginConnector]: CDTParser initialized [2024-07-17 08:42:55,056 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-07-17 08:42:56,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-07-17 08:42:56,262 INFO L384 CDTParser]: Found 1 translation units. [2024-07-17 08:42:56,263 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2024-07-17 08:42:56,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6d0e26f02/7848d63183644dc2a4d6006064696545/FLAGdee05c25f [2024-07-17 08:42:56,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6d0e26f02/7848d63183644dc2a4d6006064696545 [2024-07-17 08:42:56,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-07-17 08:42:56,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-07-17 08:42:56,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-07-17 08:42:56,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-07-17 08:42:56,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-07-17 08:42:56,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 08:42:56" (1/1) ... [2024-07-17 08:42:56,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f002b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 08:42:56, skipping insertion in model container [2024-07-17 08:42:56,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 08:42:56" (1/1) ... [2024-07-17 08:42:56,327 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-07-17 08:42:56,563 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-07-17 08:42:56,577 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-07-17 08:42:56,585 INFO L202 MainTranslator]: Completed pre-run [2024-07-17 08:42:56,632 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-07-17 08:42:56,633 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-07-17 08:42:56,664 INFO L206 MainTranslator]: Completed translation [2024-07-17 08:42:56,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 08:42:56 WrapperNode [2024-07-17 08:42:56,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-07-17 08:42:56,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-07-17 08:42:56,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-07-17 08:42:56,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-07-17 08:42:56,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 08:42:56" (1/1) ... [2024-07-17 08:42:56,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 08:42:56" (1/1) ... [2024-07-17 08:42:56,695 INFO L138 Inliner]: procedures = 165, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 84 [2024-07-17 08:42:56,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-07-17 08:42:56,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-07-17 08:42:56,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-07-17 08:42:56,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-07-17 08:42:56,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 08:42:56" (1/1) ... [2024-07-17 08:42:56,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 08:42:56" (1/1) ... [2024-07-17 08:42:56,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 08:42:56" (1/1) ... [2024-07-17 08:42:56,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 08:42:56" (1/1) ... [2024-07-17 08:42:56,710 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 08:42:56" (1/1) ... [2024-07-17 08:42:56,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 08:42:56" (1/1) ... [2024-07-17 08:42:56,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 08:42:56" (1/1) ... [2024-07-17 08:42:56,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 08:42:56" (1/1) ... [2024-07-17 08:42:56,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-07-17 08:42:56,728 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-07-17 08:42:56,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-07-17 08:42:56,729 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-07-17 08:42:56,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 08:42:56" (1/1) ... [2024-07-17 08:42:56,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-07-17 08:42:56,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:42:56,763 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-07-17 08:42:56,778 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-07-17 08:42:56,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-07-17 08:42:56,800 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-07-17 08:42:56,800 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-07-17 08:42:56,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-07-17 08:42:56,801 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-07-17 08:42:56,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-07-17 08:42:56,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-07-17 08:42:56,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-07-17 08:42:56,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-07-17 08:42:56,803 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-07-17 08:42:56,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-07-17 08:42:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-07-17 08:42:56,805 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-07-17 08:42:56,958 INFO L244 CfgBuilder]: Building ICFG [2024-07-17 08:42:56,960 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-07-17 08:42:57,132 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-07-17 08:42:57,133 INFO L293 CfgBuilder]: Performing block encoding [2024-07-17 08:42:57,228 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-07-17 08:42:57,229 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-07-17 08:42:57,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 08:42:57 BoogieIcfgContainer [2024-07-17 08:42:57,230 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-07-17 08:42:57,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-07-17 08:42:57,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-07-17 08:42:57,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-07-17 08:42:57,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 08:42:56" (1/3) ... [2024-07-17 08:42:57,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163c5040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 08:42:57, skipping insertion in model container [2024-07-17 08:42:57,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 08:42:56" (2/3) ... [2024-07-17 08:42:57,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163c5040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 08:42:57, skipping insertion in model container [2024-07-17 08:42:57,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 08:42:57" (3/3) ... [2024-07-17 08:42:57,237 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur-pthread.i [2024-07-17 08:42:57,243 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-07-17 08:42:57,250 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-07-17 08:42:57,251 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-07-17 08:42:57,251 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-07-17 08:42:57,284 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-07-17 08:42:57,315 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-17 08:42:57,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-07-17 08:42:57,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:42:57,316 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-07-17 08:42:57,317 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-07-17 08:42:57,344 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-07-17 08:42:57,352 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-07-17 08:42:57,358 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=true, 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;@765906f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-17 08:42:57,358 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-07-17 08:42:57,492 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:42:57,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:42:57,497 INFO L85 PathProgramCache]: Analyzing trace with hash 253978131, now seen corresponding path program 1 times [2024-07-17 08:42:57,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:42:57,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500059104] [2024-07-17 08:42:57,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:42:57,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:42:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:42:57,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:42:57,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:42:57,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500059104] [2024-07-17 08:42:57,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500059104] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:42:57,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:42:57,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-07-17 08:42:57,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873722829] [2024-07-17 08:42:57,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:42:57,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-07-17 08:42:57,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:42:57,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-07-17 08:42:57,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-07-17 08:42:57,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:42:57,790 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:42:57,791 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-07-17 08:42:57,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:42:57,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:42:57,904 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-07-17 08:42:57,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-07-17 08:42:57,910 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-07-17 08:42:57,911 INFO L308 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-07-17 08:42:57,913 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-17 08:42:57,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-07-17 08:42:57,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:42:57,941 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-07-17 08:42:57,943 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-07-17 08:42:57,945 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-07-17 08:42:57,946 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-07-17 08:42:57,946 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=true, 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;@765906f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-17 08:42:57,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-07-17 08:42:58,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-17 08:42:58,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:42:58,030 INFO L85 PathProgramCache]: Analyzing trace with hash -740144592, now seen corresponding path program 1 times [2024-07-17 08:42:58,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:42:58,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838193206] [2024-07-17 08:42:58,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:42:58,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:42:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:42:58,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:42:58,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:42:58,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838193206] [2024-07-17 08:42:58,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838193206] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:42:58,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:42:58,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-07-17 08:42:58,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328128201] [2024-07-17 08:42:58,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:42:58,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-07-17 08:42:58,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:42:58,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-07-17 08:42:58,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-07-17 08:42:58,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:42:58,208 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:42:58,209 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-07-17 08:42:58,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:42:58,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-17 08:42:58,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-07-17 08:42:58,269 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-17 08:42:58,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:42:58,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1468636501, now seen corresponding path program 1 times [2024-07-17 08:42:58,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:42:58,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485170382] [2024-07-17 08:42:58,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:42:58,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:42:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:42:58,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:42:58,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:42:58,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485170382] [2024-07-17 08:42:58,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485170382] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:42:58,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:42:58,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-07-17 08:42:58,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540125854] [2024-07-17 08:42:58,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:42:58,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-07-17 08:42:58,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:42:58,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-07-17 08:42:58,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-07-17 08:42:58,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:42:58,401 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:42:58,401 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-07-17 08:42:58,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-07-17 08:42:58,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:42:58,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-17 08:42:58,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:42:58,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-07-17 08:42:58,475 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-17 08:42:58,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:42:58,477 INFO L85 PathProgramCache]: Analyzing trace with hash -716612086, now seen corresponding path program 1 times [2024-07-17 08:42:58,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:42:58,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909791458] [2024-07-17 08:42:58,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:42:58,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:42:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-07-17 08:42:58,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-07-17 08:42:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-07-17 08:42:58,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-07-17 08:42:58,547 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-07-17 08:42:58,548 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-07-17 08:42:58,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-07-17 08:42:58,560 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-07-17 08:42:58,561 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-07-17 08:42:58,561 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-07-17 08:42:58,562 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-07-17 08:42:58,577 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-07-17 08:42:58,579 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-17 08:42:58,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-07-17 08:42:58,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:42:58,581 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-07-17 08:42:58,587 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-07-17 08:42:58,587 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-07-17 08:42:58,587 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=true, 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;@765906f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-17 08:42:58,587 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-07-17 08:42:58,596 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-07-17 08:42:58,749 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-17 08:42:58,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:42:58,750 INFO L85 PathProgramCache]: Analyzing trace with hash 669381600, now seen corresponding path program 1 times [2024-07-17 08:42:58,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:42:58,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352274550] [2024-07-17 08:42:58,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:42:58,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:42:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:42:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-07-17 08:42:58,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:42:58,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352274550] [2024-07-17 08:42:58,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352274550] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:42:58,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:42:58,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-07-17 08:42:58,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534066436] [2024-07-17 08:42:58,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:42:58,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-07-17 08:42:58,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:42:58,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-07-17 08:42:58,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-07-17 08:42:58,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:42:58,867 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:42:58,867 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-07-17 08:42:58,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:42:59,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:42:59,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-07-17 08:42:59,040 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-17 08:42:59,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:42:59,040 INFO L85 PathProgramCache]: Analyzing trace with hash 524904189, now seen corresponding path program 1 times [2024-07-17 08:42:59,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:42:59,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293157827] [2024-07-17 08:42:59,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:42:59,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:42:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:42:59,244 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-17 08:42:59,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:42:59,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293157827] [2024-07-17 08:42:59,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293157827] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:42:59,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:42:59,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-07-17 08:42:59,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036814353] [2024-07-17 08:42:59,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:42:59,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-07-17 08:42:59,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:42:59,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-07-17 08:42:59,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-07-17 08:42:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:42:59,247 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:42:59,247 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-07-17 08:42:59,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:42:59,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:42:59,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:42:59,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:42:59,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-07-17 08:42:59,313 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-17 08:42:59,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:42:59,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1190301475, now seen corresponding path program 1 times [2024-07-17 08:42:59,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:42:59,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800945109] [2024-07-17 08:42:59,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:42:59,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:42:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-07-17 08:42:59,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-07-17 08:42:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-07-17 08:42:59,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-07-17 08:42:59,369 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-07-17 08:42:59,370 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-07-17 08:42:59,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-07-17 08:42:59,371 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-07-17 08:42:59,371 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-07-17 08:42:59,371 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-07-17 08:42:59,371 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-07-17 08:42:59,390 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-07-17 08:42:59,392 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-17 08:42:59,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-07-17 08:42:59,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:42:59,394 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-07-17 08:42:59,396 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-07-17 08:42:59,397 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-07-17 08:42:59,398 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-07-17 08:42:59,398 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=true, 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;@765906f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-17 08:42:59,398 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-07-17 08:42:59,556 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:42:59,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:42:59,556 INFO L85 PathProgramCache]: Analyzing trace with hash 696823810, now seen corresponding path program 1 times [2024-07-17 08:42:59,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:42:59,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809794305] [2024-07-17 08:42:59,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:42:59,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:42:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:42:59,613 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-17 08:42:59,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:42:59,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809794305] [2024-07-17 08:42:59,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809794305] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:42:59,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:42:59,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-07-17 08:42:59,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841946180] [2024-07-17 08:42:59,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:42:59,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-07-17 08:42:59,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:42:59,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-07-17 08:42:59,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-07-17 08:42:59,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:42:59,615 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:42:59,616 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-07-17 08:42:59,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:42:59,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:42:59,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-07-17 08:42:59,802 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:42:59,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:42:59,802 INFO L85 PathProgramCache]: Analyzing trace with hash -939184924, now seen corresponding path program 1 times [2024-07-17 08:42:59,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:42:59,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650200975] [2024-07-17 08:42:59,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:42:59,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:42:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:43:00,030 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-07-17 08:43:00,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:43:00,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650200975] [2024-07-17 08:43:00,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650200975] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:43:00,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:43:00,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-07-17 08:43:00,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945163579] [2024-07-17 08:43:00,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:43:00,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-07-17 08:43:00,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:43:00,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-07-17 08:43:00,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-07-17 08:43:00,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:43:00,040 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:43:00,041 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-07-17 08:43:00,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:00,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:43:00,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:00,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:00,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-07-17 08:43:00,438 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:43:00,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:43:00,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1852416898, now seen corresponding path program 1 times [2024-07-17 08:43:00,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:43:00,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712188834] [2024-07-17 08:43:00,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:43:00,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:43:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:43:00,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-07-17 08:43:00,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:43:00,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712188834] [2024-07-17 08:43:00,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712188834] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:43:00,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:43:00,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-07-17 08:43:00,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977741559] [2024-07-17 08:43:00,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:43:00,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-07-17 08:43:00,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:43:00,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-07-17 08:43:00,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-07-17 08:43:00,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:43:00,490 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:43:00,491 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-07-17 08:43:00,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:00,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:00,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:43:00,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:00,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:00,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:00,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-07-17 08:43:00,823 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:43:00,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:43:00,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1064549038, now seen corresponding path program 2 times [2024-07-17 08:43:00,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:43:00,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191600666] [2024-07-17 08:43:00,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:43:00,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:43:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:43:01,128 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:43:01,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:43:01,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191600666] [2024-07-17 08:43:01,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191600666] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-17 08:43:01,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512772632] [2024-07-17 08:43:01,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-07-17 08:43:01,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-17 08:43:01,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:43:01,130 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-07-17 08:43:01,138 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-07-17 08:43:01,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-07-17 08:43:01,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-07-17 08:43:01,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 15 conjunts are in the unsatisfiable core [2024-07-17 08:43:01,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-17 08:43:01,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-07-17 08:43:01,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-07-17 08:43:01,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-07-17 08:43:01,452 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-07-17 08:43:01,453 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-07-17 08:43:01,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-07-17 08:43:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:43:01,517 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-17 08:43:01,591 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-07-17 08:43:01,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:43:01,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-07-17 08:43:01,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:43:02,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:43:02,095 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-07-17 08:43:02,135 INFO L173 IndexEqualityManager]: detected equality via solver [2024-07-17 08:43:02,166 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:43:02,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512772632] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-17 08:43:02,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-17 08:43:02,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 25 [2024-07-17 08:43:02,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523112162] [2024-07-17 08:43:02,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-17 08:43:02,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-07-17 08:43:02,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:43:02,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-07-17 08:43:02,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=4, NotChecked=46, Total=650 [2024-07-17 08:43:02,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:43:02,171 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:43:02,171 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-07-17 08:43:02,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:02,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:02,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:02,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:43:02,697 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-07-17 08:43:04,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:04,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:04,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:04,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-07-17 08:43:04,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-07-17 08:43:04,227 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-07-17 08:43:04,227 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:43:04,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:43:04,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1804183114, now seen corresponding path program 3 times [2024-07-17 08:43:04,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:43:04,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026160614] [2024-07-17 08:43:04,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:43:04,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:43:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:43:04,283 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-07-17 08:43:04,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:43:04,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026160614] [2024-07-17 08:43:04,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026160614] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:43:04,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:43:04,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-07-17 08:43:04,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296542811] [2024-07-17 08:43:04,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:43:04,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-07-17 08:43:04,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:43:04,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-07-17 08:43:04,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-07-17 08:43:04,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:43:04,285 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:43:04,286 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-07-17 08:43:04,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:04,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:04,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:04,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-07-17 08:43:04,286 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:43:04,893 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-07-17 08:43:04,978 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-07-17 08:43:05,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:05,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-07-17 08:43:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:05,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-07-17 08:43:05,688 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:43:05,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:43:05,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1259425046, now seen corresponding path program 4 times [2024-07-17 08:43:05,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:43:05,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606299283] [2024-07-17 08:43:05,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:43:05,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:43:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:43:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:43:06,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:43:06,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606299283] [2024-07-17 08:43:06,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606299283] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-17 08:43:06,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040489962] [2024-07-17 08:43:06,002 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-07-17 08:43:06,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-17 08:43:06,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:43:06,004 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-07-17 08:43:06,010 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-07-17 08:43:06,133 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-07-17 08:43:06,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-07-17 08:43:06,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 20 conjunts are in the unsatisfiable core [2024-07-17 08:43:06,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-17 08:43:06,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-17 08:43:06,202 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-07-17 08:43:06,241 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-07-17 08:43:06,241 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-07-17 08:43:06,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:43:06,371 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-07-17 08:43:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:43:06,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-17 08:43:07,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:43:07,044 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-07-17 08:43:07,111 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:43:07,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040489962] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-17 08:43:07,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-17 08:43:07,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 29 [2024-07-17 08:43:07,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428768836] [2024-07-17 08:43:07,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-17 08:43:07,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-07-17 08:43:07,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:43:07,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-07-17 08:43:07,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=742, Unknown=4, NotChecked=0, Total=870 [2024-07-17 08:43:07,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:43:07,114 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:43:07,114 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-07-17 08:43:07,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:07,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:07,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:07,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-07-17 08:43:07,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:07,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:43:14,661 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-07-17 08:43:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-07-17 08:43:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-07-17 08:43:15,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-07-17 08:43:15,540 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-07-17 08:43:15,540 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:43:15,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:43:15,541 INFO L85 PathProgramCache]: Analyzing trace with hash 334643482, now seen corresponding path program 5 times [2024-07-17 08:43:15,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:43:15,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045108158] [2024-07-17 08:43:15,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:43:15,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:43:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:43:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:43:15,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:43:15,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045108158] [2024-07-17 08:43:15,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045108158] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-17 08:43:15,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861318808] [2024-07-17 08:43:15,917 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-07-17 08:43:15,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-17 08:43:15,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:43:15,918 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-07-17 08:43:15,952 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-07-17 08:43:16,111 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-07-17 08:43:16,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-07-17 08:43:16,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 21 conjunts are in the unsatisfiable core [2024-07-17 08:43:16,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-17 08:43:16,127 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-07-17 08:43:16,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-07-17 08:43:16,188 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-07-17 08:43:16,189 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-07-17 08:43:16,209 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-07-17 08:43:16,307 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-07-17 08:43:16,308 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-07-17 08:43:16,361 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:43:16,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-17 08:43:16,416 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-07-17 08:43:16,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:43:16,622 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-07-17 08:43:16,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:43:16,630 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-07-17 08:43:16,685 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-07-17 08:43:16,686 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-07-17 08:43:16,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:43:16,697 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-07-17 08:43:16,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:43:16,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-07-17 08:43:16,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:43:16,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:43:16,846 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-07-17 08:43:16,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:43:16,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 81 [2024-07-17 08:43:16,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2024-07-17 08:43:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:43:16,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861318808] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-17 08:43:16,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-17 08:43:16,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 28 [2024-07-17 08:43:16,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28385608] [2024-07-17 08:43:16,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-17 08:43:16,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-07-17 08:43:16,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:43:16,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-07-17 08:43:16,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=640, Unknown=7, NotChecked=52, Total=812 [2024-07-17 08:43:16,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:43:16,997 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:43:16,998 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-07-17 08:43:16,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:16,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:16,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:16,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2024-07-17 08:43:16,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:16,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-07-17 08:43:16,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:43:20,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-17 08:43:22,796 WARN L539 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-07-17 08:43:26,430 WARN L539 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-07-17 08:43:28,900 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-07-17 08:43:31,167 WARN L539 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-07-17 08:43:37,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:37,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-07-17 08:43:37,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:37,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-07-17 08:43:37,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:37,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-07-17 08:43:37,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2024-07-17 08:43:37,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-07-17 08:43:37,586 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-07-17 08:43:37,587 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:43:37,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:43:37,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1728300370, now seen corresponding path program 6 times [2024-07-17 08:43:37,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:43:37,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009278129] [2024-07-17 08:43:37,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:43:37,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:43:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:43:37,915 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:43:37,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:43:37,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009278129] [2024-07-17 08:43:37,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009278129] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-17 08:43:37,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662360170] [2024-07-17 08:43:37,915 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-07-17 08:43:37,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-17 08:43:37,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:43:37,917 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-07-17 08:43:37,918 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-07-17 08:43:38,073 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-07-17 08:43:38,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-07-17 08:43:38,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 20 conjunts are in the unsatisfiable core [2024-07-17 08:43:38,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-17 08:43:38,087 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-07-17 08:43:38,117 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-07-17 08:43:38,118 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-07-17 08:43:38,145 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-07-17 08:43:38,226 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-07-17 08:43:38,226 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-07-17 08:43:38,250 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-07-17 08:43:38,272 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-07-17 08:43:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:43:38,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-17 08:43:38,377 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)))) (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-07-17 08:43:38,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:43:38,803 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-07-17 08:43:38,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:43:38,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-07-17 08:43:38,901 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-07-17 08:43:38,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2024-07-17 08:43:38,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:43:38,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:43:38,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:43:38,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:43:38,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:43:38,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:43:38,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:43:38,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:43:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:43:39,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662360170] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-17 08:43:39,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-17 08:43:39,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2024-07-17 08:43:39,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526968501] [2024-07-17 08:43:39,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-17 08:43:39,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-07-17 08:43:39,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:43:39,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-07-17 08:43:39,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=508, Unknown=3, NotChecked=46, Total=650 [2024-07-17 08:43:39,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:43:39,361 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:43:39,361 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-07-17 08:43:39,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:39,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-07-17 08:43:39,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:39,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2024-07-17 08:43:39,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:39,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-07-17 08:43:39,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2024-07-17 08:43:39,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:43:53,072 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-07-17 08:43:53,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:53,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-07-17 08:43:53,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:53,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-07-17 08:43:53,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:53,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-07-17 08:43:53,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-07-17 08:43:53,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-07-17 08:43:53,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-07-17 08:43:53,297 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-07-17 08:43:53,298 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:43:53,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:43:53,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1542178822, now seen corresponding path program 1 times [2024-07-17 08:43:53,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:43:53,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611898117] [2024-07-17 08:43:53,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:43:53,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:43:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:43:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-17 08:43:53,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:43:53,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611898117] [2024-07-17 08:43:53,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611898117] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:43:53,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:43:53,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-07-17 08:43:53,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43036061] [2024-07-17 08:43:53,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:43:53,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-07-17 08:43:53,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:43:53,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-07-17 08:43:53,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-07-17 08:43:53,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:43:53,543 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:43:53,543 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-07-17 08:43:53,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:53,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-07-17 08:43:53,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:53,543 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2024-07-17 08:43:53,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:53,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-07-17 08:43:53,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 165 states. [2024-07-17 08:43:53,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-07-17 08:43:53,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:43:56,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:56,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-07-17 08:43:56,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:56,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-07-17 08:43:56,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:56,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-07-17 08:43:56,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-07-17 08:43:56,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-07-17 08:43:56,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-07-17 08:43:56,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-07-17 08:43:56,657 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:43:56,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:43:56,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2059797706, now seen corresponding path program 2 times [2024-07-17 08:43:56,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:43:56,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788605350] [2024-07-17 08:43:56,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:43:56,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:43:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:43:56,866 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-17 08:43:56,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:43:56,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788605350] [2024-07-17 08:43:56,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788605350] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:43:56,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:43:56,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-07-17 08:43:56,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235634385] [2024-07-17 08:43:56,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:43:56,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-07-17 08:43:56,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:43:56,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-07-17 08:43:56,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-07-17 08:43:56,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:43:56,868 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:43:56,868 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-07-17 08:43:56,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:56,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-07-17 08:43:56,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:56,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2024-07-17 08:43:56,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:56,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-07-17 08:43:56,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 165 states. [2024-07-17 08:43:56,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-07-17 08:43:56,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-07-17 08:43:56,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:43:59,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:59,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-07-17 08:43:59,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:59,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-07-17 08:43:59,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:59,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-07-17 08:43:59,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-07-17 08:43:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-07-17 08:43:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-07-17 08:43:59,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-07-17 08:43:59,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-07-17 08:43:59,808 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:43:59,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:43:59,809 INFO L85 PathProgramCache]: Analyzing trace with hash 754040759, now seen corresponding path program 1 times [2024-07-17 08:43:59,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:43:59,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518607183] [2024-07-17 08:43:59,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:43:59,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:43:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:43:59,993 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-17 08:43:59,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:43:59,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518607183] [2024-07-17 08:43:59,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518607183] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:43:59,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:43:59,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-07-17 08:43:59,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370371106] [2024-07-17 08:43:59,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:43:59,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-07-17 08:43:59,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:43:59,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-07-17 08:43:59,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-07-17 08:43:59,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:43:59,996 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:43:59,996 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-07-17 08:43:59,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:59,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-07-17 08:43:59,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:59,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2024-07-17 08:43:59,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:43:59,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-07-17 08:43:59,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 165 states. [2024-07-17 08:43:59,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-07-17 08:43:59,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-07-17 08:43:59,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-07-17 08:43:59,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:03,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:03,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-07-17 08:44:03,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:03,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-07-17 08:44:03,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:03,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-07-17 08:44:03,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-07-17 08:44:03,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-07-17 08:44:03,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-07-17 08:44:03,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-07-17 08:44:03,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-07-17 08:44:03,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-07-17 08:44:03,510 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:44:03,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:44:03,511 INFO L85 PathProgramCache]: Analyzing trace with hash 56092652, now seen corresponding path program 1 times [2024-07-17 08:44:03,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:44:03,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912024100] [2024-07-17 08:44:03,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:44:03,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:44:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:44:03,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-17 08:44:03,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:44:03,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912024100] [2024-07-17 08:44:03,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912024100] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:44:03,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:44:03,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-07-17 08:44:03,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415397565] [2024-07-17 08:44:03,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:44:03,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-07-17 08:44:03,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:44:03,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-07-17 08:44:03,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-07-17 08:44:03,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:03,735 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:44:03,735 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-07-17 08:44:03,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:03,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-07-17 08:44:03,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:03,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2024-07-17 08:44:03,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:03,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-07-17 08:44:03,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 165 states. [2024-07-17 08:44:03,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-07-17 08:44:03,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-07-17 08:44:03,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-07-17 08:44:03,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-07-17 08:44:03,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:06,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:06,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-07-17 08:44:06,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:06,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-07-17 08:44:06,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:06,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-07-17 08:44:06,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-07-17 08:44:06,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-07-17 08:44:06,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-07-17 08:44:06,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-07-17 08:44:06,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-07-17 08:44:06,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-07-17 08:44:06,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-07-17 08:44:06,652 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:44:06,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:44:06,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1663336715, now seen corresponding path program 1 times [2024-07-17 08:44:06,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:44:06,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491809634] [2024-07-17 08:44:06,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:44:06,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:44:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:44:06,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-17 08:44:06,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:44:06,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491809634] [2024-07-17 08:44:06,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491809634] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:44:06,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:44:06,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-07-17 08:44:06,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095706684] [2024-07-17 08:44:06,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:44:06,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-07-17 08:44:06,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:44:06,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-07-17 08:44:06,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-07-17 08:44:06,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:06,862 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:44:06,862 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-07-17 08:44:06,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:06,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-07-17 08:44:06,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:06,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2024-07-17 08:44:06,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:06,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-07-17 08:44:06,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 165 states. [2024-07-17 08:44:06,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-07-17 08:44:06,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-07-17 08:44:06,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-07-17 08:44:06,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-07-17 08:44:06,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-07-17 08:44:06,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:13,564 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-07-17 08:44:13,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:13,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-07-17 08:44:13,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:13,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-07-17 08:44:13,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:13,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-07-17 08:44:13,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2024-07-17 08:44:13,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-07-17 08:44:13,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-07-17 08:44:13,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-07-17 08:44:13,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-07-17 08:44:13,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-07-17 08:44:13,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-07-17 08:44:13,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-07-17 08:44:13,618 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:44:13,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:44:13,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1518022142, now seen corresponding path program 2 times [2024-07-17 08:44:13,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:44:13,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051167357] [2024-07-17 08:44:13,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:44:13,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:44:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:44:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-07-17 08:44:13,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:44:13,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051167357] [2024-07-17 08:44:13,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051167357] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:44:13,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:44:13,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-07-17 08:44:13,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640664492] [2024-07-17 08:44:13,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:44:13,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-07-17 08:44:13,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:44:13,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-07-17 08:44:13,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-07-17 08:44:13,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:13,842 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:44:13,843 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-07-17 08:44:13,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:13,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-07-17 08:44:13,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:13,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2024-07-17 08:44:13,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:13,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-07-17 08:44:13,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 170 states. [2024-07-17 08:44:13,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-07-17 08:44:13,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-07-17 08:44:13,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-07-17 08:44:13,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-07-17 08:44:13,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-07-17 08:44:13,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-07-17 08:44:13,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-07-17 08:44:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-07-17 08:44:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-07-17 08:44:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2024-07-17 08:44:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-07-17 08:44:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-07-17 08:44:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-07-17 08:44:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-07-17 08:44:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-07-17 08:44:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-07-17 08:44:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-07-17 08:44:18,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-07-17 08:44:18,445 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:44:18,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:44:18,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1789404414, now seen corresponding path program 3 times [2024-07-17 08:44:18,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:44:18,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403865665] [2024-07-17 08:44:18,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:44:18,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:44:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:44:18,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-07-17 08:44:18,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:44:18,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403865665] [2024-07-17 08:44:18,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403865665] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:44:18,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:44:18,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-07-17 08:44:18,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247490924] [2024-07-17 08:44:18,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:44:18,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-07-17 08:44:18,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:44:18,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-07-17 08:44:18,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-07-17 08:44:18,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:18,627 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:44:18,628 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-07-17 08:44:18,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:18,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-07-17 08:44:18,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:18,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2024-07-17 08:44:18,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:18,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-07-17 08:44:18,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 171 states. [2024-07-17 08:44:18,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-07-17 08:44:18,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-07-17 08:44:18,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-07-17 08:44:18,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-07-17 08:44:18,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-07-17 08:44:18,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-07-17 08:44:18,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-07-17 08:44:18,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:22,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:22,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-07-17 08:44:22,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:22,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-07-17 08:44:22,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:22,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-07-17 08:44:22,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2024-07-17 08:44:22,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-07-17 08:44:22,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-07-17 08:44:22,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-07-17 08:44:22,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-07-17 08:44:22,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-07-17 08:44:22,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-07-17 08:44:22,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-07-17 08:44:22,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-07-17 08:44:22,933 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-07-17 08:44:22,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-07-17 08:44:22,935 INFO L445 BasicCegarLoop]: Path program histogram: [6, 3, 2, 1, 1, 1, 1] [2024-07-17 08:44:22,936 INFO L308 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork0 was SAFE (1/4) [2024-07-17 08:44:22,937 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-17 08:44:22,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-07-17 08:44:22,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:44:22,939 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-07-17 08:44:22,940 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-07-17 08:44:22,960 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-07-17 08:44:22,960 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-07-17 08:44:22,960 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=true, 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;@765906f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-17 08:44:22,960 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-07-17 08:44:23,072 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-17 08:44:23,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:44:23,073 INFO L85 PathProgramCache]: Analyzing trace with hash -367205657, now seen corresponding path program 1 times [2024-07-17 08:44:23,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:44:23,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360619085] [2024-07-17 08:44:23,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:44:23,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:44:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:44:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-07-17 08:44:23,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:44:23,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360619085] [2024-07-17 08:44:23,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360619085] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:44:23,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:44:23,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-07-17 08:44:23,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049370388] [2024-07-17 08:44:23,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:44:23,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-07-17 08:44:23,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:44:23,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-07-17 08:44:23,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-07-17 08:44:23,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:23,110 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:44:23,110 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-07-17 08:44:23,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:23,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:23,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-07-17 08:44:23,273 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-17 08:44:23,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:44:23,273 INFO L85 PathProgramCache]: Analyzing trace with hash -613568695, now seen corresponding path program 1 times [2024-07-17 08:44:23,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:44:23,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076405114] [2024-07-17 08:44:23,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:44:23,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:44:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:44:23,397 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-07-17 08:44:23,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:44:23,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076405114] [2024-07-17 08:44:23,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076405114] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:44:23,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:44:23,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-07-17 08:44:23,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364025719] [2024-07-17 08:44:23,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:44:23,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-07-17 08:44:23,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:44:23,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-07-17 08:44:23,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-07-17 08:44:23,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:23,399 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:44:23,399 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-07-17 08:44:23,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:23,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:23,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:23,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:23,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-07-17 08:44:23,484 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-17 08:44:23,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:44:23,484 INFO L85 PathProgramCache]: Analyzing trace with hash 884164538, now seen corresponding path program 1 times [2024-07-17 08:44:23,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:44:23,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002348431] [2024-07-17 08:44:23,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:44:23,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:44:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-07-17 08:44:23,496 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-07-17 08:44:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-07-17 08:44:23,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-07-17 08:44:23,510 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-07-17 08:44:23,510 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-07-17 08:44:23,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-07-17 08:44:23,511 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-07-17 08:44:23,511 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/4) [2024-07-17 08:44:23,511 WARN L234 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-07-17 08:44:23,511 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-07-17 08:44:23,532 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-07-17 08:44:23,536 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-17 08:44:23,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-07-17 08:44:23,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:44:23,541 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-07-17 08:44:23,543 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-07-17 08:44:23,544 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of4ForFork0 ======== [2024-07-17 08:44:23,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=true, 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;@765906f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-17 08:44:23,544 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-07-17 08:44:23,544 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-07-17 08:44:23,964 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:44:23,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:44:23,964 INFO L85 PathProgramCache]: Analyzing trace with hash -880348114, now seen corresponding path program 1 times [2024-07-17 08:44:23,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:44:23,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407672650] [2024-07-17 08:44:23,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:44:23,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:44:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:44:23,999 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-17 08:44:24,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:44:24,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407672650] [2024-07-17 08:44:24,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407672650] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:44:24,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:44:24,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-07-17 08:44:24,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401439189] [2024-07-17 08:44:24,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:44:24,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-07-17 08:44:24,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:44:24,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-07-17 08:44:24,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-07-17 08:44:24,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:24,002 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:44:24,002 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-07-17 08:44:24,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:24,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:24,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-07-17 08:44:24,161 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:44:24,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:44:24,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1485995627, now seen corresponding path program 1 times [2024-07-17 08:44:24,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:44:24,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782678306] [2024-07-17 08:44:24,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:44:24,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:44:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:44:24,272 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-07-17 08:44:24,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:44:24,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782678306] [2024-07-17 08:44:24,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782678306] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:44:24,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:44:24,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-07-17 08:44:24,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611819760] [2024-07-17 08:44:24,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:44:24,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-07-17 08:44:24,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:44:24,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-07-17 08:44:24,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-07-17 08:44:24,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:24,275 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:44:24,275 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-07-17 08:44:24,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:24,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:25,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:25,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:25,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-07-17 08:44:25,127 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:44:25,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:44:25,128 INFO L85 PathProgramCache]: Analyzing trace with hash -167217874, now seen corresponding path program 1 times [2024-07-17 08:44:25,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:44:25,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505129948] [2024-07-17 08:44:25,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:44:25,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:44:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:44:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-07-17 08:44:25,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:44:25,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505129948] [2024-07-17 08:44:25,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505129948] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:44:25,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:44:25,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-07-17 08:44:25,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791140848] [2024-07-17 08:44:25,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:44:25,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-07-17 08:44:25,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:44:25,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-07-17 08:44:25,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-07-17 08:44:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:25,164 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:44:25,164 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-07-17 08:44:25,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:25,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:25,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:26,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:26,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:26,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:26,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-07-17 08:44:26,029 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:44:26,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:44:26,029 INFO L85 PathProgramCache]: Analyzing trace with hash 471521324, now seen corresponding path program 1 times [2024-07-17 08:44:26,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:44:26,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910778215] [2024-07-17 08:44:26,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:44:26,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:44:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:44:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-07-17 08:44:26,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:44:26,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910778215] [2024-07-17 08:44:26,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910778215] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:44:26,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-17 08:44:26,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-07-17 08:44:26,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252009205] [2024-07-17 08:44:26,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:44:26,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-07-17 08:44:26,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:44:26,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-07-17 08:44:26,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-07-17 08:44:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:26,082 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:44:26,082 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-07-17 08:44:26,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:26,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:26,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:26,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:26,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:26,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:26,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:26,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:26,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-07-17 08:44:26,782 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:44:26,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:44:26,782 INFO L85 PathProgramCache]: Analyzing trace with hash 798454995, now seen corresponding path program 1 times [2024-07-17 08:44:26,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:44:26,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405724382] [2024-07-17 08:44:26,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:44:26,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:44:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:44:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:44:27,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:44:27,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405724382] [2024-07-17 08:44:27,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405724382] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-17 08:44:27,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963708721] [2024-07-17 08:44:27,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:44:27,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-17 08:44:27,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:44:27,071 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-07-17 08:44:27,096 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-07-17 08:44:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:44:27,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 14 conjunts are in the unsatisfiable core [2024-07-17 08:44:27,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-17 08:44:27,260 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-07-17 08:44:27,283 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-07-17 08:44:27,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-07-17 08:44:27,322 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-07-17 08:44:27,376 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-07-17 08:44:27,376 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-07-17 08:44:27,397 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-07-17 08:44:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:44:27,426 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-17 08:44:27,475 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_15 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.offset|))) is different from false [2024-07-17 08:44:27,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:44:27,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:44:28,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:44:28,210 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-07-17 08:44:28,263 INFO L173 IndexEqualityManager]: detected equality via solver [2024-07-17 08:44:28,298 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:44:28,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963708721] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-17 08:44:28,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-17 08:44:28,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 28 [2024-07-17 08:44:28,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676321406] [2024-07-17 08:44:28,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-17 08:44:28,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-07-17 08:44:28,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:44:28,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-07-17 08:44:28,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=646, Unknown=3, NotChecked=52, Total=812 [2024-07-17 08:44:28,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:28,300 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:44:28,301 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-07-17 08:44:28,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:28,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:28,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:28,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:28,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:36,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:36,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-07-17 08:44:36,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-07-17 08:44:36,540 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-07-17 08:44:36,541 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:44:36,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:44:36,541 INFO L85 PathProgramCache]: Analyzing trace with hash 845683098, now seen corresponding path program 2 times [2024-07-17 08:44:36,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:44:36,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144408331] [2024-07-17 08:44:36,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:44:36,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:44:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:44:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:44:36,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:44:36,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144408331] [2024-07-17 08:44:36,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144408331] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-17 08:44:36,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830595262] [2024-07-17 08:44:36,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-07-17 08:44:36,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-17 08:44:36,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:44:36,807 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-07-17 08:44:36,808 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-07-17 08:44:36,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-07-17 08:44:36,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-07-17 08:44:36,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 22 conjunts are in the unsatisfiable core [2024-07-17 08:44:36,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-17 08:44:36,970 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-07-17 08:44:36,975 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-07-17 08:44:37,047 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-07-17 08:44:37,047 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-07-17 08:44:37,098 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-07-17 08:44:37,099 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-07-17 08:44:37,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:44:37,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:44:37,126 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-07-17 08:44:37,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:44:37,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:44:37,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:44:37,583 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-07-17 08:44:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-07-17 08:44:37,623 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-07-17 08:44:37,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830595262] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:44:37,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-07-17 08:44:37,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 23 [2024-07-17 08:44:37,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860103717] [2024-07-17 08:44:37,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:44:37,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-07-17 08:44:37,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:44:37,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-07-17 08:44:37,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2024-07-17 08:44:37,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:37,625 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:44:37,625 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-07-17 08:44:37,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:37,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:37,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:37,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:37,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2024-07-17 08:44:37,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-07-17 08:44:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-07-17 08:44:39,269 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-07-17 08:44:39,460 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-07-17 08:44:39,460 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:44:39,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:44:39,461 INFO L85 PathProgramCache]: Analyzing trace with hash -665294148, now seen corresponding path program 3 times [2024-07-17 08:44:39,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:44:39,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551710363] [2024-07-17 08:44:39,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:44:39,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:44:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:44:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:44:39,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:44:39,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551710363] [2024-07-17 08:44:39,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551710363] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-17 08:44:39,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770375750] [2024-07-17 08:44:39,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-07-17 08:44:39,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-17 08:44:39,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:44:39,714 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-07-17 08:44:39,715 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-07-17 08:44:39,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-07-17 08:44:39,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-07-17 08:44:39,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 19 conjunts are in the unsatisfiable core [2024-07-17 08:44:39,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-17 08:44:39,871 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-07-17 08:44:39,874 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-07-17 08:44:39,927 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-07-17 08:44:39,927 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-07-17 08:44:39,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:44:40,013 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-07-17 08:44:40,014 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-07-17 08:44:40,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:44:40,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:44:40,035 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-07-17 08:44:40,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:44:40,561 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-07-17 08:44:40,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:44:40,573 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-07-17 08:44:40,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:44:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-07-17 08:44:40,681 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-07-17 08:44:40,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770375750] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:44:40,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-07-17 08:44:40,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 21 [2024-07-17 08:44:40,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908015299] [2024-07-17 08:44:40,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:44:40,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-07-17 08:44:40,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:44:40,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-07-17 08:44:40,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2024-07-17 08:44:40,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:40,682 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:44:40,682 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-07-17 08:44:40,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:40,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:40,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:40,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:40,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2024-07-17 08:44:40,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-07-17 08:44:40,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:42,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:42,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:42,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:42,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:42,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-07-17 08:44:42,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-07-17 08:44:42,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-07-17 08:44:42,507 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-07-17 08:44:42,693 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-07-17 08:44:42,694 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:44:42,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:44:42,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1507100570, now seen corresponding path program 4 times [2024-07-17 08:44:42,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:44:42,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026718151] [2024-07-17 08:44:42,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:44:42,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:44:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:44:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:44:42,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:44:42,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026718151] [2024-07-17 08:44:42,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026718151] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-17 08:44:42,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285170746] [2024-07-17 08:44:42,963 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-07-17 08:44:42,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-17 08:44:42,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:44:42,964 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-07-17 08:44:42,965 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-07-17 08:44:43,136 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-07-17 08:44:43,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-07-17 08:44:43,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 26 conjunts are in the unsatisfiable core [2024-07-17 08:44:43,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-17 08:44:43,150 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-07-17 08:44:43,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-17 08:44:43,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-07-17 08:44:43,284 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-07-17 08:44:43,284 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-07-17 08:44:43,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:44:43,545 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-07-17 08:44:43,566 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:44:43,566 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-17 08:44:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-07-17 08:44:43,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285170746] provided 1 perfect and 1 imperfect interpolant sequences [2024-07-17 08:44:43,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-07-17 08:44:43,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14, 12] total 32 [2024-07-17 08:44:43,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63650033] [2024-07-17 08:44:43,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:44:43,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-07-17 08:44:43,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:44:43,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-07-17 08:44:43,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=809, Unknown=9, NotChecked=0, Total=992 [2024-07-17 08:44:43,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:43,953 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:44:43,953 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-07-17 08:44:43,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:43,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:43,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:43,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:43,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2024-07-17 08:44:43,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-07-17 08:44:43,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-07-17 08:44:43,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:44,309 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-07-17 08:44:46,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-07-17 08:44:48,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-17 08:44:50,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:50,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:50,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:50,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:50,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-07-17 08:44:50,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-07-17 08:44:50,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-07-17 08:44:50,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-07-17 08:44:50,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-07-17 08:44:51,011 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-07-17 08:44:51,011 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:44:51,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:44:51,011 INFO L85 PathProgramCache]: Analyzing trace with hash -55149094, now seen corresponding path program 5 times [2024-07-17 08:44:51,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:44:51,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630193646] [2024-07-17 08:44:51,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:44:51,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:44:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:44:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-17 08:44:51,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:44:51,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630193646] [2024-07-17 08:44:51,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630193646] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-17 08:44:51,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468117774] [2024-07-17 08:44:51,250 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-07-17 08:44:51,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-17 08:44:51,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:44:51,251 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-07-17 08:44:51,252 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-07-17 08:44:51,436 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-07-17 08:44:51,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-07-17 08:44:51,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 31 conjunts are in the unsatisfiable core [2024-07-17 08:44:51,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-17 08:44:51,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-07-17 08:44:51,513 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-07-17 08:44:51,541 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-07-17 08:44:51,541 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-07-17 08:44:51,650 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-07-17 08:44:51,650 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-07-17 08:44:51,681 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-07-17 08:44:51,714 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-07-17 08:44:51,714 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-07-17 08:44:51,744 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-07-17 08:44:51,905 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-07-17 08:44:51,905 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-07-17 08:44:51,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-07-17 08:44:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-17 08:44:51,960 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-17 08:44:52,014 WARN L854 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_24 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_24) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (or (< 64 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_25 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_25) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) is different from false [2024-07-17 08:44:52,084 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-07-17 08:44:52,203 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-07-17 08:44:53,249 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-07-17 08:44:53,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2024-07-17 08:44:53,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-07-17 08:44:53,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:44:53,286 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-07-17 08:44:53,286 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-07-17 08:44:53,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:44:53,965 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-07-17 08:44:53,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:44:53,981 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-07-17 08:44:54,033 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-07-17 08:44:54,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:44:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 3 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-17 08:44:56,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468117774] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-17 08:44:56,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-17 08:44:56,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 40 [2024-07-17 08:44:56,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850321772] [2024-07-17 08:44:56,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-17 08:44:56,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-07-17 08:44:56,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:44:56,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-07-17 08:44:56,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1191, Unknown=21, NotChecked=222, Total=1640 [2024-07-17 08:44:56,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:56,105 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:44:56,106 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-07-17 08:44:56,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:56,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:56,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:56,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:44:56,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2024-07-17 08:44:56,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-07-17 08:44:56,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-07-17 08:44:56,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-07-17 08:44:56,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:44:56,752 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)) (< 0 c_~top~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-07-17 08:45:00,432 WARN L539 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-07-17 08:45:02,487 WARN L539 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-07-17 08:45:04,501 WARN L539 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-07-17 08:45:06,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 [0] [2024-07-17 08:45:08,517 WARN L539 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-07-17 08:45:10,521 WARN L539 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-07-17 08:45:13,844 WARN L539 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-07-17 08:45:17,128 WARN L539 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-07-17 08:45:19,259 WARN L539 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-07-17 08:45:21,280 WARN L539 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-07-17 08:45:27,729 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-07-17 08:45:37,843 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-07-17 08:45:48,632 WARN L539 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-07-17 08:46:02,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:46:02,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:46:02,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:46:02,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:46:02,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-07-17 08:46:02,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-07-17 08:46:02,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-07-17 08:46:02,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-07-17 08:46:02,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-07-17 08:46:02,896 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-07-17 08:46:03,082 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-07-17 08:46:03,083 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:46:03,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:46:03,083 INFO L85 PathProgramCache]: Analyzing trace with hash 763411534, now seen corresponding path program 2 times [2024-07-17 08:46:03,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:46:03,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152404551] [2024-07-17 08:46:03,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:46:03,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:46:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:46:03,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:46:03,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:46:03,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152404551] [2024-07-17 08:46:03,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152404551] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-17 08:46:03,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018360735] [2024-07-17 08:46:03,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-07-17 08:46:03,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-17 08:46:03,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:46:03,288 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-07-17 08:46:03,288 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-07-17 08:46:03,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-07-17 08:46:03,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-07-17 08:46:03,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 17 conjunts are in the unsatisfiable core [2024-07-17 08:46:03,478 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-17 08:46:03,487 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-07-17 08:46:03,514 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-07-17 08:46:03,532 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-07-17 08:46:03,580 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-07-17 08:46:03,580 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-07-17 08:46:03,600 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-07-17 08:46:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:46:03,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-17 08:46:03,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:46:03,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-07-17 08:46:03,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-07-17 08:46:04,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:46:04,032 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-07-17 08:46:04,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:46:04,058 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-07-17 08:46:04,059 INFO L173 IndexEqualityManager]: detected equality via solver [2024-07-17 08:46:04,060 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-07-17 08:46:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:46:04,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018360735] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-17 08:46:04,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-17 08:46:04,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 25 [2024-07-17 08:46:04,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178430216] [2024-07-17 08:46:04,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-17 08:46:04,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-07-17 08:46:04,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:46:04,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-07-17 08:46:04,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=541, Unknown=16, NotChecked=0, Total=650 [2024-07-17 08:46:04,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:46:04,096 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:46:04,096 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-07-17 08:46:04,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:46:04,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:46:04,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:46:04,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:46:04,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2024-07-17 08:46:04,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-07-17 08:46:04,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-07-17 08:46:04,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-07-17 08:46:04,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-07-17 08:46:04,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:46:16,230 WARN L539 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-07-17 08:46:18,296 WARN L539 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-07-17 08:46:20,310 WARN L539 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-07-17 08:46:22,343 WARN L539 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-07-17 08:46:24,448 WARN L539 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-07-17 08:46:26,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-07-17 08:46:28,517 WARN L539 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-07-17 08:46:30,521 WARN L539 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-07-17 08:46:46,989 WARN L539 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-07-17 08:46:48,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 [0] [2024-07-17 08:46:50,996 WARN L539 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-07-17 08:46:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:46:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:46:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:46:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:46:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-07-17 08:46:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-07-17 08:46:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-07-17 08:46:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-07-17 08:46:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-07-17 08:46:56,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-07-17 08:46:56,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-07-17 08:46:56,242 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-07-17 08:46:56,242 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:46:56,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:46:56,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1413091372, now seen corresponding path program 6 times [2024-07-17 08:46:56,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:46:56,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222863843] [2024-07-17 08:46:56,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:46:56,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:46:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:46:56,508 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:46:56,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:46:56,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222863843] [2024-07-17 08:46:56,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222863843] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-17 08:46:56,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361949323] [2024-07-17 08:46:56,509 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-07-17 08:46:56,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-17 08:46:56,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:46:56,510 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-07-17 08:46:56,511 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-07-17 08:46:56,694 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-07-17 08:46:56,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-07-17 08:46:56,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjunts are in the unsatisfiable core [2024-07-17 08:46:56,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-17 08:46:56,705 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-07-17 08:46:56,708 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-07-17 08:46:56,724 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-07-17 08:46:56,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:46:56,787 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-07-17 08:46:56,787 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-07-17 08:46:56,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:46:56,852 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-07-17 08:46:56,852 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-07-17 08:46:56,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:46:56,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:46:56,875 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-07-17 08:46:57,456 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-07-17 08:46:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-07-17 08:46:57,460 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-07-17 08:46:57,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361949323] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:46:57,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-07-17 08:46:57,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 21 [2024-07-17 08:46:57,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189641514] [2024-07-17 08:46:57,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:46:57,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-07-17 08:46:57,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:46:57,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-07-17 08:46:57,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2024-07-17 08:46:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:46:57,461 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:46:57,463 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-07-17 08:46:57,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:46:57,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:46:57,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:46:57,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:46:57,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-07-17 08:46:57,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-07-17 08:46:57,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-07-17 08:46:57,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-07-17 08:46:57,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2024-07-17 08:46:57,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-07-17 08:46:57,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:47:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:47:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:47:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:47:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:47:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-07-17 08:47:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-07-17 08:47:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-07-17 08:47:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-07-17 08:47:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-07-17 08:47:00,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-07-17 08:47:00,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-07-17 08:47:00,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-07-17 08:47:00,972 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-07-17 08:47:00,973 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:47:00,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:47:00,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1660265550, now seen corresponding path program 7 times [2024-07-17 08:47:00,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:47:00,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391086703] [2024-07-17 08:47:00,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:47:00,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:47:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:47:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:47:01,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:47:01,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391086703] [2024-07-17 08:47:01,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391086703] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-17 08:47:01,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183527789] [2024-07-17 08:47:01,233 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-07-17 08:47:01,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-17 08:47:01,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:47:01,234 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-07-17 08:47:01,234 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-07-17 08:47:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:47:01,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 16 conjunts are in the unsatisfiable core [2024-07-17 08:47:01,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-17 08:47:01,427 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-07-17 08:47:01,473 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-07-17 08:47:01,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-07-17 08:47:01,565 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-07-17 08:47:01,565 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-07-17 08:47:01,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:47:01,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2024-07-17 08:47:01,647 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:47:01,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-17 08:47:01,732 WARN L854 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_ArrVal_2227 Int)) (or (< 0 (select (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2227)) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2227 c_~next_alloc_idx~0)))) (or (< c_~next_alloc_idx~0 65) (forall ((|thr1Thread2of4ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_34 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |thr1Thread2of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_34) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|))))) is different from false [2024-07-17 08:47:07,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:47:07,242 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-07-17 08:47:07,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:47:07,312 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-07-17 08:47:07,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:47:07,680 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-17 08:47:07,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183527789] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-17 08:47:07,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-17 08:47:07,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 27 [2024-07-17 08:47:07,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114831766] [2024-07-17 08:47:07,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-17 08:47:07,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-07-17 08:47:07,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:47:07,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-07-17 08:47:07,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=596, Unknown=3, NotChecked=50, Total=756 [2024-07-17 08:47:07,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:47:07,682 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:47:07,682 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-07-17 08:47:07,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:47:07,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:47:07,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:47:07,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:47:07,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-07-17 08:47:07,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-07-17 08:47:07,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-07-17 08:47:07,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-07-17 08:47:07,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2024-07-17 08:47:07,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-07-17 08:47:07,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-07-17 08:47:07,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:47:10,010 WARN L539 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-07-17 08:47:21,680 WARN L539 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-07-17 08:47:23,807 WARN L539 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-07-17 08:47:32,494 WARN L539 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-07-17 08:47:34,509 WARN L539 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-07-17 08:47:36,922 WARN L539 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-07-17 08:47:38,933 WARN L539 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-07-17 08:47:52,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 [0] [2024-07-17 08:47:54,438 WARN L539 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-07-17 08:48:33,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-07-17 08:48:35,819 WARN L539 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-07-17 08:48:44,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-07-17 08:48:46,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-07-17 08:48:48,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 [0] [2024-07-17 08:48:50,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 [0] [2024-07-17 08:49:01,433 WARN L539 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-07-17 08:49:03,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-07-17 08:49:24,527 WARN L539 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-07-17 08:49:57,197 WARN L539 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-07-17 08:49:59,465 WARN L539 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-07-17 08:50:01,509 WARN L539 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-07-17 08:50:05,807 WARN L539 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-07-17 08:50:11,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-07-17 08:50:13,061 WARN L539 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-07-17 08:50:15,076 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-07-17 08:50:17,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-17 08:50:26,772 WARN L539 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-07-17 08:50:28,835 WARN L539 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-07-17 08:50:30,843 WARN L539 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-07-17 08:50:32,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-07-17 08:50:35,272 WARN L539 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-07-17 08:50:37,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-07-17 08:50:39,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-07-17 08:50:41,382 WARN L539 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-07-17 08:50:43,386 WARN L539 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-07-17 08:50:46,005 WARN L539 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-07-17 08:50:50,540 WARN L539 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-07-17 08:51:00,387 WARN L539 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-07-17 08:51:04,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 [1] [2024-07-17 08:51:07,220 WARN L539 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-07-17 08:51:09,309 WARN L539 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-07-17 08:51:13,803 WARN L539 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-07-17 08:51:16,333 WARN L539 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-07-17 08:51:18,344 WARN L539 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-07-17 08:51:20,352 WARN L539 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-07-17 08:51:22,359 WARN L539 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-07-17 08:51:24,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-07-17 08:51:26,374 WARN L539 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-07-17 08:51:28,514 WARN L539 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-07-17 08:51:30,661 WARN L539 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-07-17 08:51:32,668 WARN L539 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-07-17 08:51:34,672 WARN L539 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-07-17 08:51:36,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-07-17 08:51:38,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-07-17 08:51:41,183 WARN L539 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-07-17 08:51:43,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-07-17 08:51:45,354 WARN L539 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-07-17 08:51:47,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 [0] [2024-07-17 08:51:50,846 WARN L539 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-07-17 08:51:58,993 WARN L539 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-07-17 08:52:01,015 WARN L539 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-07-17 08:52:03,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-07-17 08:52:15,963 WARN L539 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-07-17 08:52:18,025 WARN L539 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-07-17 08:52:20,159 WARN L539 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-07-17 08:52:22,188 WARN L539 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-07-17 08:52:24,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 [0] [2024-07-17 08:52:26,243 WARN L539 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-07-17 08:52:28,275 WARN L539 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-07-17 08:52:31,134 WARN L539 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-07-17 08:52:33,165 WARN L539 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-07-17 08:52:35,643 WARN L539 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-07-17 08:52:53,001 WARN L539 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-07-17 08:53:08,197 WARN L539 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-07-17 08:53:10,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 [0, 1] [2024-07-17 08:53:12,499 WARN L539 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-07-17 08:53:15,089 WARN L539 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-07-17 08:53:17,204 WARN L539 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-07-17 08:53:21,767 WARN L539 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-07-17 08:53:23,771 WARN L539 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-07-17 08:53:25,774 WARN L539 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-07-17 08:53:45,708 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-07-17 08:53:47,873 WARN L539 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-07-17 08:53:55,688 WARN L539 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-07-17 08:54:10,971 WARN L539 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-07-17 08:54:21,088 WARN L539 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-07-17 08:54:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:54:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:54:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:54:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:54:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2024-07-17 08:54:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-07-17 08:54:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-07-17 08:54:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-07-17 08:54:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2024-07-17 08:54:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-07-17 08:54:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-07-17 08:54:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-07-17 08:54:21,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-07-17 08:54:21,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-07-17 08:54:21,500 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:54:21,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:54:21,500 INFO L85 PathProgramCache]: Analyzing trace with hash -768022828, now seen corresponding path program 8 times [2024-07-17 08:54:21,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:54:21,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269683703] [2024-07-17 08:54:21,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:54:21,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:54:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:54:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-17 08:54:21,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:54:21,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269683703] [2024-07-17 08:54:21,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269683703] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-17 08:54:21,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098816418] [2024-07-17 08:54:21,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-07-17 08:54:21,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-17 08:54:21,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:54:21,808 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-07-17 08:54:21,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-07-17 08:54:22,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-07-17 08:54:22,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-07-17 08:54:22,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 25 conjunts are in the unsatisfiable core [2024-07-17 08:54:22,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-17 08:54:22,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-07-17 08:54:22,042 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-07-17 08:54:22,276 INFO L349 Elim1Store]: treesize reduction 35, result has 36.4 percent of original size [2024-07-17 08:54:22,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 83 [2024-07-17 08:54:22,399 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-07-17 08:54:22,399 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 33 treesize of output 38 [2024-07-17 08:54:22,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:54:22,831 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 70 treesize of output 58 [2024-07-17 08:54:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-07-17 08:54:22,916 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-07-17 08:54:22,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098816418] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-17 08:54:22,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-07-17 08:54:22,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 23 [2024-07-17 08:54:22,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735127204] [2024-07-17 08:54:22,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-17 08:54:22,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-07-17 08:54:22,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:54:22,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-07-17 08:54:22,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-07-17 08:54:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:54:22,918 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:54:22,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-07-17 08:54:22,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:54:22,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:54:22,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:54:22,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:54:22,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2024-07-17 08:54:22,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-07-17 08:54:22,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-07-17 08:54:22,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-07-17 08:54:22,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2024-07-17 08:54:22,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-07-17 08:54:22,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-07-17 08:54:22,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2024-07-17 08:54:22,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:54:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:54:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:54:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:54:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:54:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2024-07-17 08:54:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-07-17 08:54:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-07-17 08:54:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-07-17 08:54:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2024-07-17 08:54:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-07-17 08:54:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-07-17 08:54:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-07-17 08:54:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-07-17 08:54:29,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-07-17 08:54:29,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-17 08:54:29,657 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-17 08:54:29,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-17 08:54:29,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1333746413, now seen corresponding path program 1 times [2024-07-17 08:54:29,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-17 08:54:29,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222888841] [2024-07-17 08:54:29,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:54:29,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-17 08:54:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:54:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-17 08:54:30,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-17 08:54:30,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222888841] [2024-07-17 08:54:30,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222888841] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-17 08:54:30,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65310368] [2024-07-17 08:54:30,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-17 08:54:30,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-17 08:54:30,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-17 08:54:30,140 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-07-17 08:54:30,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-07-17 08:54:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-17 08:54:30,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 27 conjunts are in the unsatisfiable core [2024-07-17 08:54:30,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-17 08:54:30,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-07-17 08:54:30,485 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-07-17 08:54:30,539 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-07-17 08:54:30,540 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-07-17 08:54:30,609 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-07-17 08:54:30,609 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-07-17 08:54:30,649 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 15 treesize of output 1 [2024-07-17 08:54:30,746 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-07-17 08:54:30,787 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-07-17 08:54:30,788 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-07-17 08:54:30,819 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-07-17 08:54:30,848 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-07-17 08:54:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-17 08:54:30,880 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-17 08:54:31,444 WARN L854 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|))) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_ArrVal_2445 Int) (v_ArrVal_2444 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| 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_2444)) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_41) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2445) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24|) 0)) (< v_ArrVal_2444 c_~next_alloc_idx~0))) (< c_~next_alloc_idx~0 63)) (or (< 62 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_ArrVal_2445 Int) (v_ArrVal_2444 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2445) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24|) 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_2444)) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_40) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2444 c_~next_alloc_idx~0)))))) (< 64 c_~next_alloc_idx~0)) (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_ArrVal_2445 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_41) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2445) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24|) 0)))))) is different from false [2024-07-17 08:54:32,266 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-07-17 08:54:32,266 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-07-17 08:54:32,332 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-07-17 08:54:32,332 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-07-17 08:54:32,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-07-17 08:54:32,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-07-17 08:54:32,445 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-07-17 08:54:32,445 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-07-17 08:54:34,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:54:34,406 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-07-17 08:54:34,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:54:34,419 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-07-17 08:54:34,779 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-07-17 08:54:34,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 255 treesize of output 265 [2024-07-17 08:54:34,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 138 [2024-07-17 08:54:34,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 136 [2024-07-17 08:54:34,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-17 08:54:34,809 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 166 treesize of output 165 [2024-07-17 08:54:34,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 123 [2024-07-17 08:54:34,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 121 [2024-07-17 08:54:34,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 119 [2024-07-17 08:54:34,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 117 [2024-07-17 08:54:34,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 115 [2024-07-17 08:54:34,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 113 [2024-07-17 08:54:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 6 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-17 08:54:34,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65310368] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-17 08:54:34,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-17 08:54:34,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2024-07-17 08:54:34,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144094912] [2024-07-17 08:54:34,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-17 08:54:34,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-07-17 08:54:34,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-17 08:54:34,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-07-17 08:54:34,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1068, Unknown=30, NotChecked=68, Total=1332 [2024-07-17 08:54:34,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:54:34,977 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-17 08:54:34,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.675675675675676) internal successors, (136), 36 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-07-17 08:54:34,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:54:34,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:54:34,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:54:34,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-17 08:54:34,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2024-07-17 08:54:34,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-07-17 08:54:34,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-07-17 08:54:34,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-07-17 08:54:34,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2024-07-17 08:54:34,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-07-17 08:54:34,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-07-17 08:54:34,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2024-07-17 08:54:34,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-07-17 08:54:34,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-17 08:54:36,397 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_41) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))) (.cse4 (< 62 c_~next_alloc_idx~0)) (.cse6 (+ c_~next_alloc_idx~0 2)) (.cse3 (< c_~next_alloc_idx~0 63)) (.cse5 (< 64 c_~next_alloc_idx~0)) (.cse0 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int) (v_DerPreprocessor_44 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_44) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_41) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|))) .cse1)) (or (let ((.cse2 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|))) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_ArrVal_2445 Int) (v_ArrVal_2444 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2444)) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_41) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2445) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24|) 0)) (< v_ArrVal_2444 c_~next_alloc_idx~0))) .cse3) (or .cse4 (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_ArrVal_2445 Int) (v_ArrVal_2444 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2445) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2444)) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_40) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2444 c_~next_alloc_idx~0)))))) .cse5) (or (and (forall ((v_ArrVal_2444 Int)) (or (< v_ArrVal_2444 .cse6) (forall ((v_prenex_276 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_prenex_277 Int) (v_prenex_278 Int)) (or (= v_prenex_278 v_prenex_276) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_43) v_prenex_276 (store (select |c_#memory_int| v_prenex_276) v_prenex_277 v_ArrVal_2444)) v_prenex_278 v_DerPreprocessor_40) v_prenex_276) v_prenex_277)))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_prenex_276))))) (or (and .cse1 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_43) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_41) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|)))) .cse3) (forall ((v_ArrVal_2444 Int)) (or (< v_ArrVal_2444 .cse6) (forall ((v_prenex_276 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_prenex_277 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_276 (store (select |c_#memory_int| v_prenex_276) v_prenex_277 v_ArrVal_2444)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_40) v_prenex_276) v_prenex_277))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_prenex_276)))))) .cse5) (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)) (< 0 c_~top~0) (or .cse0 (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_ArrVal_2445 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int) (v_DerPreprocessor_44 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_41) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2445) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24|) 0))))) (or (and (or .cse4 (and (or (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_prenex_277 Int) (v_prenex_278 Int) (v_prenex_275 Int) (v_prenex_276 Int) (v_ArrVal_2444 Int)) (or (< v_ArrVal_2444 .cse6) (not (= (select |c_#valid| v_prenex_276) 0)) (not (= (select (store (store |c_#valid| v_prenex_276 1) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_prenex_275) v_prenex_278) 0)) (< 0 (select (select (store (let ((.cse7 (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43))) (store .cse7 v_prenex_276 (store (select .cse7 v_prenex_276) v_prenex_277 v_ArrVal_2444))) v_prenex_278 v_DerPreprocessor_40) v_prenex_276) v_prenex_277)))) (< 60 c_~next_alloc_idx~0)) (or (forall ((v_prenex_269 Int) (v_DerPreprocessor_43 (Array Int Int)) (v_prenex_274 (Array Int Int)) (v_prenex_273 Int) (v_prenex_271 Int) (v_prenex_272 Int) (v_prenex_270 Int)) (or (not (= (select (store (store |c_#valid| v_prenex_270 1) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_prenex_269) v_prenex_273) 0)) (< v_prenex_271 .cse6) (not (= (select |c_#valid| v_prenex_270) 0)) (< 0 (select (select (store (let ((.cse8 (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43))) (store .cse8 v_prenex_270 (store (select .cse8 v_prenex_270) v_prenex_272 v_prenex_271))) v_prenex_273 v_prenex_274) v_prenex_270) v_prenex_272)))) (< c_~next_alloc_idx~0 61)))) (or .cse3 (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_ArrVal_2445 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int)) (or (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_41) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2445) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24|) 0)))))) .cse5) (or .cse0 (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_ArrVal_2445 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_41) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2445) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24|) 0))))))) is different from false [2024-07-17 08:54:38,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-17 08:54:42,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-07-17 08:54:48,362 WARN L539 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-07-17 08:54:48,689 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_41) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))) (.cse4 (< 62 c_~next_alloc_idx~0)) (.cse6 (+ c_~next_alloc_idx~0 2)) (.cse3 (< c_~next_alloc_idx~0 63)) (.cse5 (< 64 c_~next_alloc_idx~0)) (.cse0 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int) (v_DerPreprocessor_44 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_44) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_41) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|))) .cse1)) (or (let ((.cse2 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|))) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_ArrVal_2445 Int) (v_ArrVal_2444 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2444)) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_41) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2445) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24|) 0)) (< v_ArrVal_2444 c_~next_alloc_idx~0))) .cse3) (or .cse4 (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_ArrVal_2445 Int) (v_ArrVal_2444 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2445) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2444)) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_40) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2444 c_~next_alloc_idx~0)))))) .cse5) (or (and (forall ((v_ArrVal_2444 Int)) (or (< v_ArrVal_2444 .cse6) (forall ((v_prenex_276 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_prenex_277 Int) (v_prenex_278 Int)) (or (= v_prenex_278 v_prenex_276) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_43) v_prenex_276 (store (select |c_#memory_int| v_prenex_276) v_prenex_277 v_ArrVal_2444)) v_prenex_278 v_DerPreprocessor_40) v_prenex_276) v_prenex_277)))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_prenex_276))))) (or (and .cse1 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_43) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_41) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|)))) .cse3) (forall ((v_ArrVal_2444 Int)) (or (< v_ArrVal_2444 .cse6) (forall ((v_prenex_276 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_prenex_277 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_276 (store (select |c_#memory_int| v_prenex_276) v_prenex_277 v_ArrVal_2444)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_40) v_prenex_276) v_prenex_277))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_prenex_276)))))) .cse5) (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)) (not (= c_~top~0 0)) (or .cse0 (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_ArrVal_2445 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int) (v_DerPreprocessor_44 (Array Int Int))) (or (< 0 (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_44) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_41) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2445) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24|) 0))))) (or (and (or .cse4 (and (or (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_prenex_277 Int) (v_prenex_278 Int) (v_prenex_275 Int) (v_prenex_276 Int) (v_ArrVal_2444 Int)) (or (< v_ArrVal_2444 .cse6) (not (= (select |c_#valid| v_prenex_276) 0)) (not (= (select (store (store |c_#valid| v_prenex_276 1) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_prenex_275) v_prenex_278) 0)) (< 0 (select (select (store (let ((.cse7 (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43))) (store .cse7 v_prenex_276 (store (select .cse7 v_prenex_276) v_prenex_277 v_ArrVal_2444))) v_prenex_278 v_DerPreprocessor_40) v_prenex_276) v_prenex_277)))) (< 60 c_~next_alloc_idx~0)) (or (forall ((v_prenex_269 Int) (v_DerPreprocessor_43 (Array Int Int)) (v_prenex_274 (Array Int Int)) (v_prenex_273 Int) (v_prenex_271 Int) (v_prenex_272 Int) (v_prenex_270 Int)) (or (not (= (select (store (store |c_#valid| v_prenex_270 1) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_prenex_269) v_prenex_273) 0)) (< v_prenex_271 .cse6) (not (= (select |c_#valid| v_prenex_270) 0)) (< 0 (select (select (store (let ((.cse8 (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43))) (store .cse8 v_prenex_270 (store (select .cse8 v_prenex_270) v_prenex_272 v_prenex_271))) v_prenex_273 v_prenex_274) v_prenex_270) v_prenex_272)))) (< c_~next_alloc_idx~0 61)))) (or .cse3 (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_ArrVal_2445 Int) (|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int)) (or (not (= (select |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) 0)) (< 0 (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_43) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_41) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store (store |c_#valid| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| 1) |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2445) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24|) 0)))))) .cse5) (or .cse0 (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_ArrVal_2445 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_41) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2445) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24|) 0))))))) is different from false [2024-07-17 08:54:50,721 WARN L539 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-07-17 08:54:54,888 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_41) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))))) (.cse3 (< c_~next_alloc_idx~0 63)) (.cse4 (< 64 c_~next_alloc_idx~0)) (.cse0 (< c_~next_alloc_idx~0 65))) (and (or .cse0 (and (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int) (v_DerPreprocessor_44 (Array Int Int))) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_44) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_41) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|))) .cse1)) (or (let ((.cse2 (select |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|))) (and (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_ArrVal_2445 Int) (v_ArrVal_2444 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2444)) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_41) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2445) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24|) 0)) (< v_ArrVal_2444 c_~next_alloc_idx~0))) .cse3) (or (< 62 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_ArrVal_2445 Int) (v_ArrVal_2444 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2445) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24|) 0)) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| (store .cse2 |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2444)) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_40) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (< v_ArrVal_2444 c_~next_alloc_idx~0)))))) .cse4) (or (let ((.cse5 (+ c_~next_alloc_idx~0 2))) (and (forall ((v_ArrVal_2444 Int)) (or (< v_ArrVal_2444 .cse5) (forall ((v_prenex_276 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_prenex_277 Int) (v_prenex_278 Int)) (or (= v_prenex_278 v_prenex_276) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_43) v_prenex_276 (store (select |c_#memory_int| v_prenex_276) v_prenex_277 v_ArrVal_2444)) v_prenex_278 v_DerPreprocessor_40) v_prenex_276) v_prenex_277)))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_prenex_276))))) (or (and .cse1 (forall ((|v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int)) (or (= |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) (< 0 (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_43) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23| v_DerPreprocessor_42) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_41) |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| |v_thr1Thread4of4ForFork0_push_~#newTop~0#1.base_23|)))) .cse3) (forall ((v_ArrVal_2444 Int)) (or (< v_ArrVal_2444 .cse5) (forall ((v_prenex_276 Int) (|v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| Int)) (or (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_prenex_277 Int)) (< 0 (select (select (store (store |c_#memory_int| v_prenex_276 (store (select |c_#memory_int| v_prenex_276) v_prenex_277 v_ArrVal_2444)) |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_DerPreprocessor_40) v_prenex_276) v_prenex_277))) (= |v_thr1Thread3of4ForFork0_push_~#newTop~0#1.base_25| v_prenex_276))))))) .cse4) (<= c_~next_alloc_idx~0 60) (<= 0 (+ c_~next_alloc_idx~0 3)) (or .cse0 (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_ArrVal_2445 Int) (|thr1Thread4of4ForFork0_push_~#newTop~0#1.offset| Int) (|v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| Int)) (or (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_42) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_41) |c_thr1Thread4of4ForFork0_push_~#newTop~0#1.base|) |thr1Thread4of4ForFork0_push_~#newTop~0#1.offset|)) (not (= (select (store |c_#valid| |c_thr1Thread3of4ForFork0_push_~#newTop~0#1.base| v_ArrVal_2445) |v_thr1Thread2of4ForFork0_push_~#newTop~0#1.base_24|) 0))))))) is different from false [2024-07-17 08:55:04,202 WARN L539 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-07-17 08:55:32,849 WARN L539 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-07-17 08:55:33,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-17 08:56:20,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] Killed by 15