./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a4c57e3 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.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 bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-4a4c57e-m [2024-09-08 21:39:17,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-08 21:39:17,685 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-08 21:39:17,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-08 21:39:17,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-08 21:39:17,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-08 21:39:17,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-08 21:39:17,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-08 21:39:17,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-08 21:39:17,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-08 21:39:17,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-08 21:39:17,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-08 21:39:17,745 INFO L153 SettingsManager]: * Use SBE=true [2024-09-08 21:39:17,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-08 21:39:17,746 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-08 21:39:17,746 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-08 21:39:17,747 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-08 21:39:17,747 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-08 21:39:17,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-08 21:39:17,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-08 21:39:17,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-08 21:39:17,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-08 21:39:17,749 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-08 21:39:17,749 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-08 21:39:17,749 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-08 21:39:17,750 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-08 21:39:17,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-08 21:39:17,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-08 21:39:17,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-08 21:39:17,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-08 21:39:17,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 21:39:17,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-08 21:39:17,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-08 21:39:17,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-08 21:39:17,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-08 21:39:17,753 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-08 21:39:17,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-08 21:39:17,753 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-08 21:39:17,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-08 21:39:17,754 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-08 21:39:17,754 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-08 21:39:17,758 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 -> bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f [2024-09-08 21:39:18,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-08 21:39:18,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-08 21:39:18,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-08 21:39:18,043 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-08 21:39:18,044 INFO L274 PluginConnector]: CDTParser initialized [2024-09-08 21:39:18,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2024-09-08 21:39:19,435 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-08 21:39:19,704 INFO L384 CDTParser]: Found 1 translation units. [2024-09-08 21:39:19,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2024-09-08 21:39:19,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ecc28fa5e/c4fc81c5838f4502929aac82104faec4/FLAGda1d6e93a [2024-09-08 21:39:20,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ecc28fa5e/c4fc81c5838f4502929aac82104faec4 [2024-09-08 21:39:20,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-08 21:39:20,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-08 21:39:20,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-08 21:39:20,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-08 21:39:20,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-08 21:39:20,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:39:20" (1/1) ... [2024-09-08 21:39:20,027 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23e7a2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:20, skipping insertion in model container [2024-09-08 21:39:20,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:39:20" (1/1) ... [2024-09-08 21:39:20,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-08 21:39:20,528 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2024-09-08 21:39:20,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 21:39:20,590 INFO L200 MainTranslator]: Completed pre-run [2024-09-08 21:39:20,631 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2024-09-08 21:39:20,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 21:39:20,707 INFO L204 MainTranslator]: Completed translation [2024-09-08 21:39:20,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:20 WrapperNode [2024-09-08 21:39:20,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-08 21:39:20,709 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-08 21:39:20,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-08 21:39:20,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-08 21:39:20,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:20" (1/1) ... [2024-09-08 21:39:20,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:20" (1/1) ... [2024-09-08 21:39:20,771 INFO L138 Inliner]: procedures = 272, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 279 [2024-09-08 21:39:20,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-08 21:39:20,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-08 21:39:20,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-08 21:39:20,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-08 21:39:20,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:20" (1/1) ... [2024-09-08 21:39:20,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:20" (1/1) ... [2024-09-08 21:39:20,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:20" (1/1) ... [2024-09-08 21:39:20,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:20" (1/1) ... [2024-09-08 21:39:20,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:20" (1/1) ... [2024-09-08 21:39:20,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:20" (1/1) ... [2024-09-08 21:39:20,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:20" (1/1) ... [2024-09-08 21:39:20,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:20" (1/1) ... [2024-09-08 21:39:20,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-08 21:39:20,813 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-08 21:39:20,813 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-08 21:39:20,813 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-08 21:39:20,814 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:20" (1/1) ... [2024-09-08 21:39:20,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 21:39:20,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 21:39:20,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-09-08 21:39:20,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-09-08 21:39:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-08 21:39:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-08 21:39:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-09-08 21:39:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-09-08 21:39:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-09-08 21:39:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-09-08 21:39:20,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-08 21:39:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-09-08 21:39:20,891 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-09-08 21:39:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-08 21:39:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-08 21:39:20,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-08 21:39:20,893 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-08 21:39:21,038 INFO L242 CfgBuilder]: Building ICFG [2024-09-08 21:39:21,041 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-08 21:39:21,412 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-08 21:39:21,412 INFO L291 CfgBuilder]: Performing block encoding [2024-09-08 21:39:21,600 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-08 21:39:21,600 INFO L318 CfgBuilder]: Removed 35 assume(true) statements. [2024-09-08 21:39:21,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:39:21 BoogieIcfgContainer [2024-09-08 21:39:21,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-08 21:39:21,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-08 21:39:21,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-08 21:39:21,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-08 21:39:21,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:39:20" (1/3) ... [2024-09-08 21:39:21,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc8bcb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:39:21, skipping insertion in model container [2024-09-08 21:39:21,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:39:20" (2/3) ... [2024-09-08 21:39:21,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc8bcb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:39:21, skipping insertion in model container [2024-09-08 21:39:21,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:39:21" (3/3) ... [2024-09-08 21:39:21,612 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2024-09-08 21:39:21,629 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-08 21:39:21,630 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-09-08 21:39:21,631 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-08 21:39:21,681 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-09-08 21:39:21,731 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 21:39:21,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 21:39:21,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 21:39:21,734 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 21:39:21,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-09-08 21:39:21,766 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 21:39:21,776 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-09-08 21:39:21,784 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@7d26bd41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 21:39:21,784 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 21:39:21,941 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 21:39:21,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 21:39:21,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1799044287, now seen corresponding path program 1 times [2024-09-08 21:39:21,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 21:39:21,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835333750] [2024-09-08 21:39:21,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 21:39:21,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 21:39:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 21:39:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 21:39:22,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 21:39:22,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835333750] [2024-09-08 21:39:22,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835333750] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 21:39:22,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 21:39:22,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 21:39:22,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878744465] [2024-09-08 21:39:22,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 21:39:22,276 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 21:39:22,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 21:39:22,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 21:39:22,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 21:39:22,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:39:22,303 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 21:39:22,304 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 21:39:22,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:39:22,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:39:22,391 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-08 21:39:22,391 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 21:39:22,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 21:39:22,393 INFO L85 PathProgramCache]: Analyzing trace with hash -712731850, now seen corresponding path program 1 times [2024-09-08 21:39:22,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 21:39:22,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015140421] [2024-09-08 21:39:22,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 21:39:22,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 21:39:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 21:39:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 21:39:22,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 21:39:22,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015140421] [2024-09-08 21:39:22,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015140421] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 21:39:22,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535032539] [2024-09-08 21:39:22,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 21:39:22,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 21:39:22,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 21:39:22,576 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 21:39:22,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-08 21:39:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 21:39:22,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-08 21:39:22,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 21:39:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 21:39:22,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 21:39:22,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 21:39:22,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535032539] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 21:39:22,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 21:39:22,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-08 21:39:22,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188302683] [2024-09-08 21:39:22,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 21:39:22,780 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-08 21:39:22,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 21:39:22,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-08 21:39:22,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-08 21:39:22,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:39:22,784 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 21:39:22,784 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 21:39:22,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:39:22,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:39:22,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:39:22,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 21:39:22,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-08 21:39:23,076 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-09-08 21:39:23,077 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 21:39:23,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 21:39:23,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1372350335, now seen corresponding path program 2 times [2024-09-08 21:39:23,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 21:39:23,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779806737] [2024-09-08 21:39:23,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 21:39:23,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 21:39:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 21:39:23,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 21:39:23,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 21:39:23,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779806737] [2024-09-08 21:39:23,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779806737] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 21:39:23,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460234213] [2024-09-08 21:39:23,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 21:39:23,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 21:39:23,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 21:39:23,263 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 21:39:23,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-08 21:39:23,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 21:39:23,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 21:39:23,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-08 21:39:23,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 21:39:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 21:39:23,382 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 21:39:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 21:39:23,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460234213] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 21:39:23,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 21:39:23,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-09-08 21:39:23,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799645028] [2024-09-08 21:39:23,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 21:39:23,451 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-08 21:39:23,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 21:39:23,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-08 21:39:23,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-08 21:39:23,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:39:23,453 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 21:39:23,453 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 21:39:23,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:39:23,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 21:39:23,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:39:23,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:39:23,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 21:39:23,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:39:23,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-08 21:39:23,753 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 21:39:23,754 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 21:39:23,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 21:39:23,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1114166175, now seen corresponding path program 3 times [2024-09-08 21:39:23,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 21:39:23,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160909128] [2024-09-08 21:39:23,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 21:39:23,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 21:39:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 21:39:24,114 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-08 21:39:24,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 21:39:24,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160909128] [2024-09-08 21:39:24,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160909128] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 21:39:24,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340143164] [2024-09-08 21:39:24,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-08 21:39:24,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 21:39:24,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 21:39:24,119 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 21:39:24,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-08 21:39:24,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-08 21:39:24,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 21:39:24,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-08 21:39:24,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 21:39:24,251 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 7 treesize of output 6 [2024-09-08 21:39:24,377 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 21:39:24,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-08 21:39:24,406 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 15 treesize of output 10 [2024-09-08 21:39:24,491 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 15 treesize of output 10 [2024-09-08 21:39:24,541 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 31 treesize of output 25 [2024-09-08 21:39:24,566 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-08 21:39:24,567 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 21:39:28,630 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-09-08 21:39:30,656 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-09-08 21:39:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2024-09-08 21:39:30,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340143164] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 21:39:30,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 21:39:30,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-09-08 21:39:30,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343880162] [2024-09-08 21:39:30,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 21:39:30,782 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-08 21:39:30,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 21:39:30,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-08 21:39:30,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=122, Unknown=4, NotChecked=46, Total=210 [2024-09-08 21:39:30,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:39:30,784 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 21:39:30,784 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 21:39:30,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:39:30,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 21:39:30,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:39:30,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:39:30,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:39:30,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 21:39:30,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:39:30,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 21:39:30,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-08 21:39:31,174 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 21:39:31,175 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 21:39:31,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 21:39:31,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1640418877, now seen corresponding path program 1 times [2024-09-08 21:39:31,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 21:39:31,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808063527] [2024-09-08 21:39:31,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 21:39:31,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 21:39:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 21:39:31,898 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-08 21:39:31,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 21:39:31,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808063527] [2024-09-08 21:39:31,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808063527] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 21:39:31,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154521795] [2024-09-08 21:39:31,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 21:39:31,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 21:39:31,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 21:39:31,904 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-09-08 21:39:31,906 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-09-08 21:39:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 21:39:32,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-08 21:39:32,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 21:39:32,044 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 7 treesize of output 6 [2024-09-08 21:39:32,118 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 21:39:32,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-08 21:39:32,141 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 15 treesize of output 10 [2024-09-08 21:39:32,207 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 15 treesize of output 10 [2024-09-08 21:39:32,261 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 24 treesize of output 17 [2024-09-08 21:39:32,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2024-09-08 21:39:32,418 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 37 treesize of output 31 [2024-09-08 21:39:32,441 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-08 21:39:32,443 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 21:39:46,556 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_26| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_26|) 0)) is different from false [2024-09-08 21:39:56,636 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_237 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_237) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-09-08 21:39:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 4 not checked. [2024-09-08 21:39:56,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154521795] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 21:39:56,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 21:39:56,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 22 [2024-09-08 21:39:56,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361286032] [2024-09-08 21:39:56,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 21:39:56,760 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-08 21:39:56,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 21:39:56,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-08 21:39:56,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=324, Unknown=6, NotChecked=78, Total=506 [2024-09-08 21:39:56,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:39:56,765 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 21:39:56,765 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 22 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 21:39:56,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:39:56,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 21:39:56,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:39:56,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 21:39:56,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:40:01,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:40:01,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 21:40:01,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:40:01,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 21:40:01,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 21:40:01,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-08 21:40:01,980 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 21:40:01,981 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 21:40:01,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 21:40:01,982 INFO L85 PathProgramCache]: Analyzing trace with hash -912837368, now seen corresponding path program 1 times [2024-09-08 21:40:01,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 21:40:01,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458301149] [2024-09-08 21:40:01,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 21:40:01,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 21:40:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 21:40:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-09-08 21:40:02,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 21:40:02,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458301149] [2024-09-08 21:40:02,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458301149] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 21:40:02,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019751726] [2024-09-08 21:40:02,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 21:40:02,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 21:40:02,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 21:40:02,089 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 21:40:02,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-08 21:40:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 21:40:02,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-08 21:40:02,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 21:40:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-09-08 21:40:02,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 21:40:02,300 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-09-08 21:40:02,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019751726] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 21:40:02,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 21:40:02,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-08 21:40:02,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662078253] [2024-09-08 21:40:02,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 21:40:02,302 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-08 21:40:02,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 21:40:02,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-08 21:40:02,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-08 21:40:02,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:40:02,304 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 21:40:02,304 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 21:40:02,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:40:02,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 21:40:02,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:40:02,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 21:40:02,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 21:40:02,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:40:02,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:40:02,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 21:40:02,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:40:02,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 21:40:02,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 21:40:02,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 21:40:02,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-08 21:40:02,625 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 21:40:02,626 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 21:40:02,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 21:40:02,626 INFO L85 PathProgramCache]: Analyzing trace with hash 235507773, now seen corresponding path program 2 times [2024-09-08 21:40:02,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 21:40:02,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437530215] [2024-09-08 21:40:02,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 21:40:02,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 21:40:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 21:40:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-08 21:40:03,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 21:40:03,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437530215] [2024-09-08 21:40:03,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437530215] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 21:40:03,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681205766] [2024-09-08 21:40:03,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 21:40:03,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 21:40:03,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 21:40:03,235 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 21:40:03,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-08 21:40:03,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 21:40:03,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 21:40:03,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-09-08 21:40:03,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 21:40:03,377 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 7 treesize of output 6 [2024-09-08 21:40:03,535 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-09-08 21:40:03,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-09-08 21:40:03,574 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 15 treesize of output 10 [2024-09-08 21:40:03,806 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 22 treesize of output 17 [2024-09-08 21:40:03,933 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 31 treesize of output 22 [2024-09-08 21:40:03,995 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 22 treesize of output 15 [2024-09-08 21:40:07,293 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 38 treesize of output 30 [2024-09-08 21:40:07,314 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-08 21:40:07,315 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 21:40:18,530 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= 0 (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-09-08 21:40:20,076 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_510 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_510) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-09-08 21:40:21,582 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_510 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_510) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-09-08 21:40:23,632 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_507 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_510 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_507 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_510) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-09-08 21:40:25,682 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_507 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_510 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_507 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_510) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| 28)))) is different from false [2024-09-08 21:40:27,714 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_507 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_510 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| 28)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_506) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_507 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_510) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0))) is different from false [2024-09-08 21:40:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 7 not checked. [2024-09-08 21:40:27,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681205766] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 21:40:27,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 21:40:27,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2024-09-08 21:40:27,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24979015] [2024-09-08 21:40:27,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 21:40:27,937 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-08 21:40:27,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 21:40:27,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-08 21:40:27,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=364, Unknown=15, NotChecked=270, Total=756 [2024-09-08 21:40:27,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:40:27,940 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 21:40:27,940 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 21:40:27,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:40:27,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 21:40:27,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:40:27,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 21:40:27,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 21:40:27,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 21:40:27,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:40:34,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:40:34,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 21:40:34,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:40:34,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 21:40:34,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 21:40:34,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 21:40:34,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-08 21:40:34,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-08 21:40:35,131 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-08 21:40:35,132 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 21:40:35,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 21:40:35,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1677153127, now seen corresponding path program 3 times [2024-09-08 21:40:35,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 21:40:35,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648712509] [2024-09-08 21:40:35,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 21:40:35,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 21:40:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 21:40:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-08 21:40:36,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 21:40:36,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648712509] [2024-09-08 21:40:36,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648712509] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 21:40:36,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137257361] [2024-09-08 21:40:36,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-08 21:40:36,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 21:40:36,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 21:40:36,603 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 21:40:36,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-08 21:40:36,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-08 21:40:36,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 21:40:36,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-09-08 21:40:36,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 21:40:36,792 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 7 treesize of output 6 [2024-09-08 21:40:36,957 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-09-08 21:40:36,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-09-08 21:40:36,998 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 15 treesize of output 10 [2024-09-08 21:40:37,176 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 22 treesize of output 17 [2024-09-08 21:40:37,273 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 31 treesize of output 22 [2024-09-08 21:40:40,128 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 29 treesize of output 22 [2024-09-08 21:40:43,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2024-09-08 21:40:50,234 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 70 treesize of output 57 [2024-09-08 21:41:08,220 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 76 treesize of output 62 [2024-09-08 21:41:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-08 21:41:08,264 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 21:41:31,883 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-09-08 21:41:33,759 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0))) is different from false [2024-09-08 21:41:35,646 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-09-08 21:41:37,693 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_642 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-09-08 21:41:39,751 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_642 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|)))) is different from false [2024-09-08 21:41:40,016 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_33| Int)) (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_33| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_642 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ 28 |c_~#cache~0.offset| .cse0))))) (< |v_t_funThread1of1ForFork0_~i~0#1_33| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-09-08 21:41:42,140 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (|v_t_funThread1of1ForFork0_~i~0#1_33| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_33| 28))) (or (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) (< |v_t_funThread1of1ForFork0_~i~0#1_33| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ 28 |c_~#cache~0.offset| .cse0)) (= 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_642 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|))))) is different from false [2024-09-08 21:41:44,222 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_640 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (|v_t_funThread1of1ForFork0_~i~0#1_33| Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_33| 28))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_640 (- 1)))))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_642 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< (+ |c_~#cache~0.offset| .cse1) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) (< |v_t_funThread1of1ForFork0_~i~0#1_33| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ 28 |c_~#cache~0.offset| .cse1))))) is different from false [2024-09-08 21:41:46,341 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_640 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| (+ v_ArrVal_640 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_642 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0))) is different from false [2024-09-08 21:41:48,389 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_640 Int) (v_ArrVal_638 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_638) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| (+ v_ArrVal_640 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_642 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0))) is different from false [2024-09-08 21:41:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 32 not checked. [2024-09-08 21:41:48,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137257361] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 21:41:48,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 21:41:48,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 39 [2024-09-08 21:41:48,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109446101] [2024-09-08 21:41:48,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 21:41:48,702 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-09-08 21:41:48,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 21:41:48,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-09-08 21:41:48,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=691, Unknown=40, NotChecked=650, Total=1560 [2024-09-08 21:41:48,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:41:48,707 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 21:41:48,707 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.125) internal successors, (165), 39 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 21:41:48,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:41:48,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 21:41:48,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:41:48,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 21:41:48,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 21:41:48,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 21:41:48,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-09-08 21:41:48,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:41:49,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:41:51,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:41:55,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-09-08 21:41:58,054 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 [0] [2024-09-08 21:42:02,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:42:03,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:42:04,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:42:05,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:42:19,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:42:22,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:42:23,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:42:39,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:42:39,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 21:42:39,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:42:39,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 21:42:39,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 21:42:39,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 21:42:39,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-08 21:42:39,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 21:42:39,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-08 21:42:39,487 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 21:42:39,487 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 21:42:39,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 21:42:39,488 INFO L85 PathProgramCache]: Analyzing trace with hash -241567285, now seen corresponding path program 4 times [2024-09-08 21:42:39,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 21:42:39,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785693500] [2024-09-08 21:42:39,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 21:42:39,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 21:42:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 21:42:58,998 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-08 21:42:58,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 21:42:58,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785693500] [2024-09-08 21:42:58,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785693500] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 21:42:58,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773760043] [2024-09-08 21:42:58,999 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-08 21:42:59,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 21:42:59,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 21:42:59,002 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 21:42:59,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-08 21:42:59,338 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-08 21:42:59,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 21:42:59,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-09-08 21:42:59,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 21:42:59,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-08 21:42:59,430 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 21:42:59,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-08 21:42:59,472 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 15 treesize of output 10 [2024-09-08 21:42:59,603 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 22 treesize of output 17 [2024-09-08 21:42:59,700 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 31 treesize of output 22 [2024-09-08 21:43:03,074 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 29 treesize of output 22 [2024-09-08 21:43:06,285 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 72 treesize of output 57 [2024-09-08 21:43:25,761 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 83 treesize of output 70 [2024-09-08 21:43:34,608 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 208 treesize of output 173 [2024-09-08 21:44:13,160 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 224 treesize of output 191 [2024-09-08 21:44:36,289 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 848 treesize of output 723 [2024-09-08 21:44:56,887 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 857 treesize of output 730 [2024-09-08 21:47:31,514 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 978 treesize of output 794 [2024-09-08 21:47:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-08 21:47:33,284 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 21:48:05,367 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0))) is different from false [2024-09-08 21:48:07,410 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0))) is different from false [2024-09-08 21:48:07,460 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0))) is different from false [2024-09-08 21:48:07,480 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0))) is different from false [2024-09-08 21:48:07,600 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2024-09-08 21:48:07,633 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse0))))))) is different from false [2024-09-08 21:48:09,776 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< (+ |c_~#cache~0.offset| .cse2) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse2))))) is different from false [2024-09-08 21:48:11,866 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse0)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_845 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0)))) is different from false [2024-09-08 21:48:13,995 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_845 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse0)) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71|)))) is different from false [2024-09-08 21:48:16,021 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse1))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_845 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse1)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))))) is different from false [2024-09-08 21:48:18,201 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse2 (+ |c_~#cache~0.offset| .cse3))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_845 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse3)) (< .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))))) is different from false [2024-09-08 21:48:20,335 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse1 (+ |c_~#cache~0.offset| .cse2))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_841 (- 1)))))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_845 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse2)) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))))) is different from false [2024-09-08 21:48:22,503 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse1))) (or (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ v_ArrVal_841 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_845 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse1)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))))) is different from false [2024-09-08 21:48:24,538 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse1))) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ v_ArrVal_841 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_845 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse1)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))))) is different from false [2024-09-08 21:48:26,741 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse1))) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse1)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)) (= (select (select (store (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse2 |c_~#cache~0.base| (store (store (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ v_ArrVal_841 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_845 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0))))) is different from false [2024-09-08 21:48:28,909 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_838 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse1))) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse1)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|)) (= (select (select (store (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_838 (- 1)))))) (store .cse2 |c_~#cache~0.base| (store (store (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ v_ArrVal_841 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_845 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))))) is different from false [2024-09-08 21:48:31,114 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_838 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ v_ArrVal_838 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ v_ArrVal_841 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_845 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| 28)))) is different from false [2024-09-08 21:48:33,194 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_837 (Array Int Int)) (v_ArrVal_838 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_837) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ v_ArrVal_838 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ v_ArrVal_841 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_845 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| 28)))) is different from false [2024-09-08 21:48:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 142 not checked. [2024-09-08 21:48:34,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773760043] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 21:48:34,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 21:48:34,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 62 [2024-09-08 21:48:34,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431139842] [2024-09-08 21:48:34,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 21:48:34,784 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-09-08 21:48:34,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 21:48:34,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-09-08 21:48:34,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1563, Unknown=121, NotChecked=1854, Total=3906 [2024-09-08 21:48:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:48:34,787 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 21:48:34,787 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 4.492063492063492) internal successors, (283), 62 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 21:48:34,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 21:48:34,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 21:48:34,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-08 21:48:34,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 21:48:34,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 21:48:34,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 21:48:34,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-09-08 21:48:34,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 21:48:34,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 21:48:37,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:48:39,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:48:41,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:48:43,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:48:45,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:48:58,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:49:00,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:49:02,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:49:04,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:49:06,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:49:08,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:49:10,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:49:30,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:49:32,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:49:34,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:49:36,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:49:38,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:49:40,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:49:42,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:49:50,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:49:52,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:49:54,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 [0] [2024-09-08 21:49:56,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:49:58,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:50:00,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:50:02,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:50:17,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:50:19,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:50:21,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:50:23,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:50:25,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:50:27,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:50:52,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:50:54,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:50:56,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:50:58,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:51:00,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:51:01,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:51:24,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:51:46,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:51:48,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:51:50,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:51:52,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:51:54,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 21:51:56,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-09-08 21:51:59,023 WARN L539 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] Killed by 15