./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e94c40da 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_73-funloop_hard_racefree.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 c8af2e9e80aefb6a93651d6c869df13510f679bd9566c8571973545c9393aab5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-e94c40d-m [2024-09-22 12:14:11,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-22 12:14:11,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-22 12:14:11,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-22 12:14:11,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-22 12:14:11,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-22 12:14:11,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-22 12:14:11,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-22 12:14:11,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-22 12:14:11,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-22 12:14:11,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-22 12:14:11,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-22 12:14:11,966 INFO L153 SettingsManager]: * Use SBE=true [2024-09-22 12:14:11,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-22 12:14:11,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-22 12:14:11,968 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-22 12:14:11,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-22 12:14:11,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-22 12:14:11,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-22 12:14:11,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-22 12:14:11,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-22 12:14:11,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-22 12:14:11,975 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-22 12:14:11,975 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-22 12:14:11,975 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-22 12:14:11,976 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-22 12:14:11,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-22 12:14:11,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-22 12:14:11,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-22 12:14:11,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-22 12:14:11,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-22 12:14:11,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-22 12:14:11,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-22 12:14:11,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-22 12:14:11,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-22 12:14:11,980 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-22 12:14:11,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-22 12:14:11,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-22 12:14:11,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-22 12:14:11,981 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-22 12:14:11,981 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-22 12:14:11,981 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 -> c8af2e9e80aefb6a93651d6c869df13510f679bd9566c8571973545c9393aab5 [2024-09-22 12:14:12,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-22 12:14:12,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-22 12:14:12,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-22 12:14:12,244 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-22 12:14:12,245 INFO L274 PluginConnector]: CDTParser initialized [2024-09-22 12:14:12,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2024-09-22 12:14:13,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-22 12:14:13,905 INFO L384 CDTParser]: Found 1 translation units. [2024-09-22 12:14:13,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2024-09-22 12:14:13,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0f686090b/7efa0296c0044d408752cddcf42169df/FLAG2ec8fec42 [2024-09-22 12:14:13,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0f686090b/7efa0296c0044d408752cddcf42169df [2024-09-22 12:14:13,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-22 12:14:13,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-22 12:14:13,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-22 12:14:13,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-22 12:14:13,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-22 12:14:13,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 12:14:13" (1/1) ... [2024-09-22 12:14:13,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d326851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:14:13, skipping insertion in model container [2024-09-22 12:14:13,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 12:14:13" (1/1) ... [2024-09-22 12:14:14,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-22 12:14:14,385 WARN L248 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_73-funloop_hard_racefree.i[41323,41336] [2024-09-22 12:14:14,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-22 12:14:14,449 INFO L200 MainTranslator]: Completed pre-run [2024-09-22 12:14:14,484 WARN L248 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_73-funloop_hard_racefree.i[41323,41336] [2024-09-22 12:14:14,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-22 12:14:14,568 INFO L204 MainTranslator]: Completed translation [2024-09-22 12:14:14,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:14:14 WrapperNode [2024-09-22 12:14:14,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-22 12:14:14,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-22 12:14:14,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-22 12:14:14,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-22 12:14:14,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:14:14" (1/1) ... [2024-09-22 12:14:14,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:14:14" (1/1) ... [2024-09-22 12:14:14,625 INFO L138 Inliner]: procedures = 272, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 285 [2024-09-22 12:14:14,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-22 12:14:14,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-22 12:14:14,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-22 12:14:14,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-22 12:14:14,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:14:14" (1/1) ... [2024-09-22 12:14:14,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:14:14" (1/1) ... [2024-09-22 12:14:14,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:14:14" (1/1) ... [2024-09-22 12:14:14,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:14:14" (1/1) ... [2024-09-22 12:14:14,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:14:14" (1/1) ... [2024-09-22 12:14:14,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:14:14" (1/1) ... [2024-09-22 12:14:14,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:14:14" (1/1) ... [2024-09-22 12:14:14,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:14:14" (1/1) ... [2024-09-22 12:14:14,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-22 12:14:14,666 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-22 12:14:14,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-22 12:14:14,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-22 12:14:14,667 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:14:14" (1/1) ... [2024-09-22 12:14:14,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-22 12:14:14,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:14:14,701 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-22 12:14:14,707 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-22 12:14:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-22 12:14:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-22 12:14:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-09-22 12:14:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-09-22 12:14:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-09-22 12:14:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-09-22 12:14:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-22 12:14:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-09-22 12:14:14,757 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-09-22 12:14:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-22 12:14:14,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-22 12:14:14,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-22 12:14:14,761 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-22 12:14:14,942 INFO L242 CfgBuilder]: Building ICFG [2024-09-22 12:14:14,944 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-22 12:14:15,316 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-22 12:14:15,316 INFO L291 CfgBuilder]: Performing block encoding [2024-09-22 12:14:15,499 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-22 12:14:15,500 INFO L318 CfgBuilder]: Removed 35 assume(true) statements. [2024-09-22 12:14:15,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 12:14:15 BoogieIcfgContainer [2024-09-22 12:14:15,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-22 12:14:15,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-22 12:14:15,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-22 12:14:15,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-22 12:14:15,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.09 12:14:13" (1/3) ... [2024-09-22 12:14:15,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113ad9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 12:14:15, skipping insertion in model container [2024-09-22 12:14:15,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 12:14:14" (2/3) ... [2024-09-22 12:14:15,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113ad9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 12:14:15, skipping insertion in model container [2024-09-22 12:14:15,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 12:14:15" (3/3) ... [2024-09-22 12:14:15,511 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2024-09-22 12:14:15,525 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-22 12:14:15,525 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-09-22 12:14:15,525 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-22 12:14:15,584 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-09-22 12:14:15,639 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:14:15,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-22 12:14:15,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:14:15,641 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-22 12:14:15,643 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-22 12:14:15,679 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-22 12:14:15,691 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-09-22 12:14:15,699 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;@1dd4f991, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 12:14:15,699 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-22 12:14:15,841 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:14:15,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:14:15,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1084761360, now seen corresponding path program 1 times [2024-09-22 12:14:15,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:14:15,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556596371] [2024-09-22 12:14:15,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:14:15,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:14:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:14:16,246 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-22 12:14:16,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:14:16,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556596371] [2024-09-22 12:14:16,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556596371] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 12:14:16,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 12:14:16,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-22 12:14:16,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994415160] [2024-09-22 12:14:16,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 12:14:16,257 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-22 12:14:16,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:14:16,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-22 12:14:16,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-22 12:14:16,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:14:16,281 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:14:16,282 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-22 12:14:16,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:14:16,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:14:16,360 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-22 12:14:16,360 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:14:16,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:14:16,361 INFO L85 PathProgramCache]: Analyzing trace with hash -747723976, now seen corresponding path program 1 times [2024-09-22 12:14:16,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:14:16,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882827569] [2024-09-22 12:14:16,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:14:16,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:14:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:14:16,487 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-22 12:14:16,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:14:16,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882827569] [2024-09-22 12:14:16,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882827569] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:14:16,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853046716] [2024-09-22 12:14:16,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:14:16,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:14:16,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:14:16,505 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-22 12:14:16,507 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-22 12:14:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:14:16,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-22 12:14:16,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:14:16,640 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-22 12:14:16,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:14:16,670 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-22 12:14:16,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853046716] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:14:16,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:14:16,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-22 12:14:16,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561599634] [2024-09-22 12:14:16,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:14:16,672 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-22 12:14:16,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:14:16,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-22 12:14:16,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-22 12:14:16,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:14:16,676 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:14:16,676 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-22 12:14:16,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:14:16,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:14:16,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:14:16,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:14:16,793 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-22 12:14:16,979 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-22 12:14:16,980 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:14:16,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:14:16,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1928047856, now seen corresponding path program 2 times [2024-09-22 12:14:16,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:14:16,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043723059] [2024-09-22 12:14:16,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:14:16,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:14:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:14:17,171 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-22 12:14:17,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:14:17,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043723059] [2024-09-22 12:14:17,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043723059] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:14:17,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973705528] [2024-09-22 12:14:17,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-22 12:14:17,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:14:17,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:14:17,175 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-22 12:14:17,177 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-22 12:14:17,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-22 12:14:17,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:14:17,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-22 12:14:17,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:14:17,289 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-22 12:14:17,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:14:17,347 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-22 12:14:17,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973705528] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:14:17,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:14:17,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-09-22 12:14:17,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242800695] [2024-09-22 12:14:17,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:14:17,349 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-22 12:14:17,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:14:17,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-22 12:14:17,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-22 12:14:17,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:14:17,351 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:14:17,351 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-22 12:14:17,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:14:17,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:14:17,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:14:17,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:14:17,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:14:17,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:14:17,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-22 12:14:17,674 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-22 12:14:17,675 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:14:17,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:14:17,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1241085968, now seen corresponding path program 3 times [2024-09-22 12:14:17,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:14:17,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895498883] [2024-09-22 12:14:17,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:14:17,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:14:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:14:18,110 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-22 12:14:18,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:14:18,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895498883] [2024-09-22 12:14:18,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895498883] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:14:18,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369246524] [2024-09-22 12:14:18,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-22 12:14:18,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:14:18,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:14:18,114 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-22 12:14:18,116 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-22 12:14:18,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-22 12:14:18,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:14:18,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-22 12:14:18,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:14:18,241 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-22 12:14:18,327 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:14:18,328 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-22 12:14:18,353 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-22 12:14:18,435 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-22 12:14:18,475 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-22 12:14:18,496 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-22 12:14:18,497 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:14:24,577 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-22 12:14:24,595 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-22 12:14:24,752 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-22 12:14:24,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369246524] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:14:24,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:14:24,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-09-22 12:14:24,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805994462] [2024-09-22 12:14:24,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:14:24,756 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-22 12:14:24,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:14:24,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-22 12:14:24,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=5, NotChecked=46, Total=210 [2024-09-22 12:14:24,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:14:24,759 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:14:24,759 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-22 12:14:24,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:14:24,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:14:24,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:14:24,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:14:24,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:14:24,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:14:24,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:14:24,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:14:24,980 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-22 12:14:25,167 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-22 12:14:25,168 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:14:25,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:14:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1875016076, now seen corresponding path program 1 times [2024-09-22 12:14:25,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:14:25,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365880494] [2024-09-22 12:14:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:14:25,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:14:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:14:27,115 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-22 12:14:27,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:14:27,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365880494] [2024-09-22 12:14:27,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365880494] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:14:27,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807840039] [2024-09-22 12:14:27,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:14:27,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:14:27,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:14:27,121 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-22 12:14:27,124 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-22 12:14:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:14:27,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-22 12:14:27,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:14:27,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-22 12:14:27,341 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:14:27,342 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-22 12:14:27,372 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-22 12:14:27,444 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-22 12:14:27,506 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-22 12:14:27,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2024-09-22 12:14:27,692 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-22 12:14:27,722 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-22 12:14:27,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:14:39,871 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-22 12:14:45,949 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-22 12:14:46,071 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-22 12:14:46,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807840039] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:14:46,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:14:46,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 7] total 26 [2024-09-22 12:14:46,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845440227] [2024-09-22 12:14:46,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:14:46,072 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-22 12:14:46,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:14:46,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-22 12:14:46,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=515, Unknown=3, NotChecked=94, Total=702 [2024-09-22 12:14:46,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:14:46,074 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:14:46,074 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.111111111111111) internal successors, (111), 26 states have internal predecessors, (111), 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-22 12:14:46,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:14:46,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:14:46,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:14:46,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:14:46,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:14:47,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:14:47,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:14:47,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:14:47,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:14:47,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-22 12:14:47,459 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-22 12:14:47,641 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-22 12:14:47,642 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:14:47,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:14:47,642 INFO L85 PathProgramCache]: Analyzing trace with hash 310715724, now seen corresponding path program 2 times [2024-09-22 12:14:47,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:14:47,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352466722] [2024-09-22 12:14:47,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:14:47,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:14:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:14:48,220 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-22 12:14:48,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:14:48,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352466722] [2024-09-22 12:14:48,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352466722] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:14:48,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438640411] [2024-09-22 12:14:48,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-22 12:14:48,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:14:48,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:14:48,226 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-22 12:14:48,227 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-22 12:14:48,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-22 12:14:48,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:14:48,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-22 12:14:48,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:14:48,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-22 12:14:48,416 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:14:48,417 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-22 12:14:48,435 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-22 12:14:48,555 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-22 12:14:48,638 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-22 12:14:48,688 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 22 treesize of output 15 [2024-09-22 12:14:51,219 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-22 12:14:51,242 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-22 12:14:51,243 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:15:02,431 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| (+ (* |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_30|) 0))) is different from false [2024-09-22 12:15:03,951 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| Int) (v_ArrVal_340 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| (+ (* |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_340) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30|) 0))) is different from false [2024-09-22 12:15:05,465 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| Int) (v_ArrVal_340 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (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_340) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30|) 0))) is different from false [2024-09-22 12:15:07,509 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_338 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_338 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_340) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-09-22 12:15:09,565 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_32| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_338 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_32| (+ v_ArrVal_338 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_340) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_32| 28)))) is different from false [2024-09-22 12:15:11,598 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_32| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_338 Int)) (or (= (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_336) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_32| (+ v_ArrVal_338 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_340) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_30| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_32| 28)))) is different from false [2024-09-22 12:15:11,766 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-22 12:15:11,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438640411] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:15:11,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:15:11,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 26 [2024-09-22 12:15:11,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060689159] [2024-09-22 12:15:11,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:15:11,768 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-22 12:15:11,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:15:11,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-22 12:15:11,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=331, Unknown=14, NotChecked=258, Total=702 [2024-09-22 12:15:11,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:15:11,769 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:15:11,770 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.814814814814815) internal successors, (103), 26 states have internal predecessors, (103), 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-22 12:15:11,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:15:11,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:15:11,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:15:11,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:15:11,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-22 12:15:11,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:15:18,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:15:18,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:15:18,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:15:18,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:15:18,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-22 12:15:18,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-22 12:15:18,394 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-22 12:15:18,581 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-22 12:15:18,582 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:15:18,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:15:18,582 INFO L85 PathProgramCache]: Analyzing trace with hash 2141943016, now seen corresponding path program 3 times [2024-09-22 12:15:18,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:15:18,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777362423] [2024-09-22 12:15:18,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:15:18,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:15:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:15:23,919 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-22 12:15:23,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:15:23,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777362423] [2024-09-22 12:15:23,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777362423] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:15:23,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787637022] [2024-09-22 12:15:23,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-22 12:15:23,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:15:23,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:15:23,922 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-22 12:15:23,923 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-22 12:15:24,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-22 12:15:24,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:15:24,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-09-22 12:15:24,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:15:24,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-22 12:15:24,144 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:15:24,145 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-22 12:15:24,182 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-22 12:15:24,317 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-22 12:15:24,414 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-22 12:15:27,168 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-22 12:15:31,240 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-22 12:15:37,926 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 70 treesize of output 57 [2024-09-22 12:15:53,970 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-22 12:15:54,036 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-22 12:15:54,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:16:17,919 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-22 12:16:19,927 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_475 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_475) |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-22 12:16:21,830 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_475 (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_475) |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-22 12:16:23,868 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_473 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_475 (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_473 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_475) |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-22 12:16:25,915 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_473 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_475 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| 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_38| (+ v_ArrVal_473 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_475) |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| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38|)))) is different from false [2024-09-22 12:16:26,608 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_29| Int)) (or (forall ((v_ArrVal_473 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_475 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 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_38| (+ v_ArrVal_473 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_475) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ .cse0 28 |c_~#cache~0.offset|))))) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-09-22 12:16:28,755 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_473 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (|v_t_funThread1of1ForFork0_~i~0#1_29| Int) (v_ArrVal_475 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 28))) (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 (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_473 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_475) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< (+ .cse2 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ .cse2 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-09-22 12:16:30,862 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_473 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (|v_t_funThread1of1ForFork0_~i~0#1_29| Int) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_469 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 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_469 (- 1)))))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_473 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_475) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< (+ .cse1 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ .cse1 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-09-22 12:16:32,995 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_473 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_469 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40|)) (= (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_40| (+ v_ArrVal_469 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_473 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_475) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0))) is different from false [2024-09-22 12:16:35,050 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_468 (Array Int Int)) (v_ArrVal_473 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_469 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40|)) (= (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_468) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| (+ v_ArrVal_469 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_473 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_475) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0))) is different from false [2024-09-22 12:16:35,472 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-22 12:16:35,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787637022] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:16:35,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:16:35,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 15] total 42 [2024-09-22 12:16:35,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707613473] [2024-09-22 12:16:35,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:16:35,473 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-09-22 12:16:35,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:16:35,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-09-22 12:16:35,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=916, Unknown=33, NotChecked=710, Total=1806 [2024-09-22 12:16:35,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:16:35,479 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:16:35,479 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.8372093023255816) internal successors, (165), 42 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-22 12:16:35,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:16:35,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:16:35,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:16:35,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:16:35,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-22 12:16:35,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-09-22 12:16:35,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:16:41,096 WARN L539 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-22 12:16:47,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:16:47,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:16:47,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:16:47,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:16:47,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-22 12:16:47,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-22 12:16:47,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-22 12:16:47,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-22 12:16:47,332 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-22 12:16:47,333 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 12:16:47,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 12:16:47,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1862131292, now seen corresponding path program 4 times [2024-09-22 12:16:47,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 12:16:47,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025804753] [2024-09-22 12:16:47,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 12:16:47,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 12:16:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 12:22:27,835 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-22 12:22:27,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 12:22:27,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025804753] [2024-09-22 12:22:27,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025804753] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 12:22:27,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560568476] [2024-09-22 12:22:27,837 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-22 12:22:27,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 12:22:27,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 12:22:27,838 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-22 12:22:27,839 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-22 12:22:29,364 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-22 12:22:29,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 12:22:29,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-09-22 12:22:29,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 12:22:29,386 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-22 12:22:29,661 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 12:22:29,662 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-22 12:22:29,871 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-22 12:22:30,125 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-22 12:22:30,345 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-22 12:22:34,883 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-22 12:22:39,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2024-09-22 12:22:59,866 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-22 12:23:09,497 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-22 12:23:50,439 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 226 treesize of output 191 [2024-09-22 12:23:57,158 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 425 treesize of output 362 [2024-09-22 12:24:00,676 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 506 treesize of output 441 [2024-09-22 12:24:47,682 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 920 treesize of output 798 [2024-09-22 12:24:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 127 refuted. 15 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-22 12:24:48,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 12:25:27,108 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ (* |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_43|) 0))) is different from false [2024-09-22 12:25:29,158 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int)) (or (= (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_43|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-09-22 12:25:31,217 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_679 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_679))) (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_43|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-09-22 12:25:33,236 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_679 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ (* |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_679) |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| (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| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_679) |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_43|) 0))) is different from false [2024-09-22 12:25:35,317 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_679 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (+ .cse0 |c_~#cache~0.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_679) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0)))) is different from false [2024-09-22 12:25:37,338 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (or (forall ((v_ArrVal_679 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (+ .cse0 |c_~#cache~0.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_679) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0)))) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-09-22 12:25:39,580 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_679 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse0 |c_~#cache~0.base| (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse2 (+ .cse3 |c_~#cache~0.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_679) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ .cse3 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-09-22 12:25:41,692 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 Int) (v_ArrVal_679 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 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_674 (- 1)))))) (store .cse0 |c_~#cache~0.base| (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse2 (+ .cse3 |c_~#cache~0.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_679) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ .cse3 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-09-22 12:25:43,815 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 Int) (v_ArrVal_679 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (+ .cse2 |c_~#cache~0.offset|))) (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_674 (- 1))) .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_679) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ .cse2 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|)))) is different from false [2024-09-22 12:25:45,847 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 Int) (v_ArrVal_679 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse1 (+ .cse2 |c_~#cache~0.offset|))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_674 (- 1))) .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_679) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ .cse2 28 |c_~#cache~0.offset|)))))) is different from false [2024-09-22 12:25:47,989 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 Int) (v_ArrVal_679 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (let ((.cse4 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse2 (+ .cse4 |c_~#cache~0.offset|))) (or (= (select (select (store (let ((.cse0 (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 .cse0 |c_~#cache~0.base| (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_674 (- 1))) .cse2 (+ (select .cse1 .cse2) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_679) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ .cse4 28 |c_~#cache~0.offset|)))))) is different from false [2024-09-22 12:25:50,103 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_672 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse2 (+ .cse3 |c_~#cache~0.offset|))) (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_672 (- 1)))))) (store .cse0 |c_~#cache~0.base| (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_674 (- 1))) .cse2 (+ (select .cse1 .cse2) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_679) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ .cse3 28 |c_~#cache~0.offset|)))))) is different from false [2024-09-22 12:25:52,294 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_672 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse1 (+ .cse2 |c_~#cache~0.offset|))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (store (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ v_ArrVal_672 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_674 (- 1))) .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_679) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ .cse2 28 |c_~#cache~0.offset|)))))) is different from false [2024-09-22 12:25:54,328 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_672 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse1 (+ .cse2 |c_~#cache~0.offset|))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (store (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ v_ArrVal_672 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_674 (- 1))) .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_679) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< .cse1 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ .cse2 28 |c_~#cache~0.offset|)))))) is different from false [2024-09-22 12:25:56,520 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_672 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (let ((.cse4 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse2 (+ .cse4 |c_~#cache~0.offset|))) (or (= (select (select (store (let ((.cse0 (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 .cse0 |c_~#cache~0.base| (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (store (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ v_ArrVal_672 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_674 (- 1))) .cse2 (+ (select .cse1 .cse2) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_679) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< .cse2 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) (< .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ .cse4 28 |c_~#cache~0.offset|)))))) is different from false [2024-09-22 12:25:58,673 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_674 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_672 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_669 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse3 |c_~#cache~0.offset|))) (or (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) (= (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_669 (- 1)))))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (select .cse1 |c_~#cache~0.base|))) (store (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ v_ArrVal_672 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_674 (- 1))) .cse0 (+ (select .cse2 .cse0) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_679) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ .cse3 28 |c_~#cache~0.offset|)))))) is different from false [2024-09-22 12:26:00,874 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_674 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_672 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|~#cache~0.offset| Int) (v_ArrVal_669 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ |~#cache~0.offset| .cse2))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|))) (store (store (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| (+ v_ArrVal_669 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ v_ArrVal_672 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_674 (- 1))) .cse0 (+ (select .cse1 .cse0) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_679) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ |~#cache~0.offset| .cse2 28)))))) is different from false [2024-09-22 12:26:02,989 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_674 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_672 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|~#cache~0.offset| Int) (v_ArrVal_669 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse1 (+ |~#cache~0.offset| .cse2))) (or (= 0 (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_667) |c_~#cache~0.base|))) (store (store (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| (+ v_ArrVal_669 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ v_ArrVal_672 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_674 (- 1))) .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_679) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|)) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)) (< .cse1 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ |~#cache~0.offset| .cse2 28)))))) is different from false [2024-09-22 12:26:04,118 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-22 12:26:04,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560568476] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 12:26:04,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 12:26:04,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 23] total 66 [2024-09-22 12:26:04,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476424448] [2024-09-22 12:26:04,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 12:26:04,119 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-09-22 12:26:04,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 12:26:04,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-09-22 12:26:04,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=2086, Unknown=97, NotChecked=1998, Total=4422 [2024-09-22 12:26:04,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:26:04,122 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 12:26:04,122 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 4.253731343283582) internal successors, (285), 66 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-22 12:26:04,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-22 12:26:04,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-22 12:26:04,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-09-22 12:26:04,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-22 12:26:04,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-22 12:26:04,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-09-22 12:26:04,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-09-22 12:26:04,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 12:26:08,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:26:17,120 WARN L539 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-22 12:26:22,418 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-22 12:26:50,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 12:26:58,244 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse28 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse10 ((as const (Array Int Int)) 0))) (let ((.cse104 (@diff .cse28 .cse10))) (let ((.cse102 (store .cse28 .cse104 0))) (let ((.cse103 (@diff .cse102 .cse10))) (let ((.cse112 (store .cse102 .cse103 0))) (let ((.cse105 (@diff .cse112 .cse10))) (let ((.cse111 (store .cse112 .cse105 0))) (let ((.cse106 (@diff .cse111 .cse10))) (let ((.cse110 (store .cse111 .cse106 0))) (let ((.cse107 (@diff .cse110 .cse10))) (let ((.cse109 (store .cse110 .cse107 0))) (let ((.cse108 (@diff .cse109 .cse10))) (let ((.cse8 (* 7 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse14 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse59 (= .cse10 .cse112)) (.cse29 (= .cse10 .cse111)) (.cse54 (= .cse10 .cse110)) (.cse1 (= .cse10 .cse109)) (.cse17 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse50 (store .cse109 .cse108 0))) (let ((.cse13 (= .cse10 .cse50)) (.cse12 (or .cse1 (< (+ .cse108 27) .cse17))) (.cse7 (or .cse54 (< (+ .cse107 27) .cse17))) (.cse5 (or .cse29 (< (+ .cse106 27) .cse17))) (.cse6 (or (< (+ .cse105 27) .cse17) .cse59)) (.cse2 (or (< (+ .cse104 27) .cse17) (= .cse10 .cse28))) (.cse3 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse4 (or (= .cse10 .cse102) (< (+ .cse103 27) .cse17))) (.cse0 (not .cse14)) (.cse52 (<= (+ |c_ULTIMATE.start_main_~i~3#1| 20) .cse8)) (.cse53 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse9 (+ .cse17 |c_~#cache~0.offset|)) (.cse11 (select |c_#memory_int| 4))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ |c_ULTIMATE.start_main_~i~3#1| 13) .cse8))) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| 28) .cse9) (= (store .cse10 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (select .cse11 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|)) .cse11))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (or (and .cse2 .cse12 .cse3 .cse4 .cse13 .cse5 .cse6 .cse7) .cse14) (or (let ((.cse23 (store .cse28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (let ((.cse22 (@diff .cse23 .cse10))) (let ((.cse15 (store .cse23 .cse22 0))) (let ((.cse16 (@diff .cse15 .cse10))) (let ((.cse27 (store .cse15 .cse16 0))) (let ((.cse26 (@diff .cse27 .cse10))) (let ((.cse19 (store .cse27 .cse26 0))) (let ((.cse18 (@diff .cse19 .cse10))) (let ((.cse24 (store .cse19 .cse18 0))) (let ((.cse25 (@diff .cse24 .cse10))) (let ((.cse20 (store .cse24 .cse25 0))) (let ((.cse21 (@diff .cse20 .cse10))) (and (or (= .cse10 .cse15) (< (+ .cse16 27) .cse17)) (or (< (+ .cse18 27) .cse17) (= .cse10 .cse19)) (or (= .cse10 .cse20) (< (+ .cse21 27) .cse17)) (or (< (+ .cse22 27) .cse17) (= .cse10 .cse23)) .cse3 (or (= .cse10 .cse24) (< (+ .cse25 27) .cse17)) (= .cse10 (store .cse20 .cse21 0)) (or (< (+ .cse26 27) .cse17) (= .cse10 .cse27))))))))))))))) .cse14) (= .cse10 (select |c_#memory_int| |c_~#cache~0.base|)) (or .cse0 (and .cse2 .cse3 .cse4 .cse29 .cse6 (<= (+ |c_ULTIMATE.start_main_~i~3#1| 6) .cse8))) (or (exists ((|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (and (exists ((v_subst_26 Int) (v_prenex_3 Int)) (let ((.cse31 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28) |c_~#cache~0.offset|))) (let ((.cse30 (store (store .cse10 v_prenex_3 (select .cse11 v_prenex_3)) v_subst_26 (select .cse11 v_subst_26))) (.cse32 (select .cse11 .cse31))) (and (= (store .cse30 .cse31 .cse32) .cse11) (not (= v_subst_26 v_prenex_3)) (<= (+ 84 v_subst_26) .cse31) (<= (+ 56 v_prenex_3) .cse31) (= (select (let ((.cse33 (store .cse30 .cse31 (+ .cse32 1)))) (store (store .cse10 v_prenex_3 (select .cse33 v_prenex_3)) v_subst_26 (select .cse33 v_subst_26))) .cse31) .cse32))))) (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_35| 1) |c_t_funThread1of1ForFork0_~i~0#1|))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (and (exists ((v_subst_23 Int)) (let ((.cse34 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28) |c_~#cache~0.offset|))) (and (<= (+ 84 v_subst_23) .cse34) (= .cse11 (store (store .cse10 v_subst_23 (select .cse11 v_subst_23)) .cse34 (select .cse10 .cse34)))))) (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_35| 1) |c_t_funThread1of1ForFork0_~i~0#1|))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_35| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_prenex_6 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (let ((.cse35 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28) |c_~#cache~0.offset|))) (let ((.cse36 (store (store .cse10 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (select .cse11 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|)) v_prenex_6 (select .cse11 v_prenex_6))) (.cse37 (select .cse11 .cse35))) (and (<= (+ 56 v_prenex_6) .cse35) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| 84) .cse35) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| v_prenex_6)) (= (store .cse36 .cse35 .cse37) .cse11) (= (select (let ((.cse38 (store .cse36 .cse35 (+ .cse37 1)))) (store (store .cse10 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (select .cse38 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|)) v_prenex_6 (select .cse38 v_prenex_6))) .cse35) .cse37))))))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (and (exists ((v_subst_25 Int) (v_prenex_2 Int) (v_subst_20 Int)) (let ((.cse40 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28) |c_~#cache~0.offset|))) (let ((.cse39 (store (store (store .cse10 v_prenex_2 (select .cse11 v_prenex_2)) v_subst_20 (select .cse11 v_subst_20)) v_subst_25 (select .cse11 v_subst_25))) (.cse41 (select .cse11 .cse40))) (and (= (store .cse39 .cse40 .cse41) .cse11) (not (= v_subst_25 v_subst_20)) (<= (+ 56 v_subst_20) .cse40) (= .cse41 (select (let ((.cse42 (store .cse39 .cse40 (+ .cse41 1)))) (store (store (store .cse10 v_prenex_2 (select .cse42 v_prenex_2)) v_subst_20 (select .cse42 v_subst_20)) v_subst_25 (select .cse42 v_subst_25))) .cse40)) (not (= v_subst_20 v_prenex_2)) (<= (+ 84 v_prenex_2) .cse40) (<= (+ v_subst_25 28) .cse40) (not (= v_subst_25 v_prenex_2)))))) (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_35| 1) |c_t_funThread1of1ForFork0_~i~0#1|))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (and (exists ((v_subst_22 Int)) (let ((.cse43 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28) |c_~#cache~0.offset|))) (and (<= (+ 84 v_subst_22) .cse43) (= .cse11 (store (store .cse10 v_subst_22 (select .cse11 v_subst_22)) .cse43 (select .cse10 .cse43)))))) (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_35| 1) |c_t_funThread1of1ForFork0_~i~0#1|))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_35| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_subst_24 Int) (v_subst_21 Int)) (let ((.cse45 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28) |c_~#cache~0.offset|))) (let ((.cse44 (store (store .cse10 v_subst_21 (select .cse11 v_subst_21)) v_subst_24 (select .cse11 v_subst_24))) (.cse46 (select .cse11 .cse45))) (and (= (store .cse44 .cse45 .cse46) .cse11) (= (select (let ((.cse47 (store .cse44 .cse45 (+ .cse46 1)))) (store (store .cse10 v_subst_21 (select .cse47 v_subst_21)) v_subst_24 (select .cse47 v_subst_24))) .cse45) .cse46) (not (= v_subst_24 v_subst_21)) (<= (+ 84 v_subst_21) .cse45) (<= (+ v_subst_24 28) .cse45))))))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_35| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((v_prenex_5 Int)) (let ((.cse48 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28) |c_~#cache~0.offset|))) (and (= (store (store .cse10 v_prenex_5 (select .cse11 v_prenex_5)) .cse48 (select .cse10 .cse48)) .cse11) (<= (+ 84 v_prenex_5) .cse48)))))) (exists ((|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (and (exists ((v_prenex_4 Int)) (let ((.cse49 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28) |c_~#cache~0.offset|))) (and (= (store (store .cse10 v_prenex_4 (select .cse11 v_prenex_4)) .cse49 (select .cse10 .cse49)) .cse11) (<= (+ 84 v_prenex_4) .cse49)))) (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_35| 1) |c_t_funThread1of1ForFork0_~i~0#1|)))) (or .cse0 (let ((.cse51 (@diff .cse50 .cse10))) (and .cse2 (= .cse10 (store .cse50 .cse51 0)) (or .cse13 (< (+ .cse51 27) .cse17)) .cse12 .cse4 .cse5 .cse52 .cse6 .cse7 .cse53))) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (or (and .cse2 .cse3 .cse4 .cse5 .cse54 .cse6) .cse14) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse9) (= |c_~#cache~0.offset| 0) (= .cse10 .cse11) (forall ((v_ArrVal_674 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_672 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (let ((.cse58 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse57 (+ .cse58 |c_~#cache~0.offset|))) (or (= (select (select (store (let ((.cse55 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_672 (- 1)))))) (store .cse55 |c_~#cache~0.base| (let ((.cse56 (select .cse55 |c_~#cache~0.base|))) (store (store .cse56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_674 (- 1))) .cse57 (+ (select .cse56 .cse57) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_679) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< .cse57 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ .cse58 28 |c_~#cache~0.offset|)))))) (or (exists ((v_subst_21 Int)) (and (<= (+ 56 v_subst_21) .cse9) (= (store .cse10 v_subst_21 (select .cse11 v_subst_21)) .cse11))) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (v_subst_20 Int)) (and (= (store (store .cse10 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (select .cse11 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|)) v_subst_20 (select .cse11 v_subst_20)) .cse11) (<= (+ v_subst_20 28) .cse9) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| v_subst_20)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) .cse9)))) (= .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (or (and .cse2 .cse3 .cse4 .cse59) .cse14) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (or (exists ((v_prenex_4 Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse61 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (let ((.cse60 (+ |~#cache~0.offset| .cse61))) (and (= (store (store .cse10 v_prenex_4 (select .cse11 v_prenex_4)) .cse60 (select .cse10 .cse60)) .cse11) (<= (+ |~#cache~0.offset| .cse61 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (<= (+ 84 v_prenex_4) .cse60))))) (exists ((v_subst_25 Int) (v_prenex_2 Int) (|~#cache~0.offset| Int) (v_subst_20 Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse63 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (let ((.cse62 (+ |~#cache~0.offset| .cse63))) (let ((.cse64 (store (store (store .cse10 v_prenex_2 (select .cse11 v_prenex_2)) v_subst_20 (select .cse11 v_subst_20)) v_subst_25 (select .cse11 v_subst_25))) (.cse65 (select .cse11 .cse62))) (and (not (= v_subst_25 v_subst_20)) (<= (+ 56 v_subst_20) .cse62) (not (= v_subst_20 v_prenex_2)) (<= (+ v_subst_25 28) .cse62) (<= (+ |~#cache~0.offset| .cse63 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (store .cse64 .cse62 .cse65) .cse11) (<= (+ 84 v_prenex_2) .cse62) (= (select (let ((.cse66 (store .cse64 .cse62 (+ 1 .cse65)))) (store (store (store .cse10 v_prenex_2 (select .cse66 v_prenex_2)) v_subst_20 (select .cse66 v_subst_20)) v_subst_25 (select .cse66 v_subst_25))) .cse62) .cse65) (not (= v_subst_25 v_prenex_2))))))) (exists ((v_prenex_5 Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse68 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (let ((.cse67 (+ |~#cache~0.offset| .cse68))) (and (<= (+ 84 v_prenex_5) .cse67) (= (store (store .cse10 v_prenex_5 (select .cse11 v_prenex_5)) .cse67 (select .cse10 .cse67)) .cse11) (<= (+ |~#cache~0.offset| .cse68 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) (exists ((|~#cache~0.offset| Int) (v_subst_22 Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse70 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (let ((.cse69 (+ |~#cache~0.offset| .cse70))) (and (= (store (store .cse10 v_subst_22 (select .cse11 v_subst_22)) .cse69 (select .cse10 .cse69)) .cse11) (<= (+ |~#cache~0.offset| .cse70 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (<= (+ 84 v_subst_22) .cse69))))) (exists ((v_prenex_6 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse72 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (let ((.cse71 (+ |~#cache~0.offset| .cse72))) (let ((.cse74 (store (store .cse10 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (select .cse11 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|)) v_prenex_6 (select .cse11 v_prenex_6))) (.cse75 (select .cse11 .cse71))) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| 84) .cse71) (<= (+ |~#cache~0.offset| .cse72 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (select (let ((.cse73 (store .cse74 .cse71 (+ 1 .cse75)))) (store (store .cse10 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (select .cse73 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|)) v_prenex_6 (select .cse73 v_prenex_6))) .cse71) .cse75) (<= (+ 56 v_prenex_6) .cse71) (not (= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| v_prenex_6)) (= (store .cse74 .cse71 .cse75) .cse11)))))) (exists ((v_subst_24 Int) (|~#cache~0.offset| Int) (v_subst_21 Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse77 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (let ((.cse76 (+ |~#cache~0.offset| .cse77))) (let ((.cse78 (store (store .cse10 v_subst_21 (select .cse11 v_subst_21)) v_subst_24 (select .cse11 v_subst_24))) (.cse79 (select .cse11 .cse76))) (and (<= (+ v_subst_24 28) .cse76) (<= (+ 84 v_subst_21) .cse76) (<= (+ |~#cache~0.offset| .cse77 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (store .cse78 .cse76 .cse79) .cse11) (not (= v_subst_24 v_subst_21)) (= (select (let ((.cse80 (store .cse78 .cse76 (+ 1 .cse79)))) (store (store .cse10 v_subst_21 (select .cse80 v_subst_21)) v_subst_24 (select .cse80 v_subst_24))) .cse76) .cse79)))))) (exists ((v_subst_26 Int) (v_prenex_3 Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse84 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (let ((.cse82 (+ |~#cache~0.offset| .cse84))) (let ((.cse81 (store (store .cse10 v_prenex_3 (select .cse11 v_prenex_3)) v_subst_26 (select .cse11 v_subst_26))) (.cse83 (select .cse11 .cse82))) (and (= (store .cse81 .cse82 .cse83) .cse11) (<= (+ 84 v_subst_26) .cse82) (<= (+ |~#cache~0.offset| .cse84 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (<= (+ 56 v_prenex_3) .cse82) (not (= v_subst_26 v_prenex_3)) (= (select (let ((.cse85 (store .cse81 .cse82 (+ 1 .cse83)))) (store (store .cse10 v_prenex_3 (select .cse85 v_prenex_3)) v_subst_26 (select .cse85 v_subst_26))) .cse82) .cse83)))))) (exists ((v_subst_23 Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse86 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (let ((.cse87 (+ |~#cache~0.offset| .cse86))) (and (<= (+ |~#cache~0.offset| .cse86 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (<= (+ 84 v_subst_23) .cse87) (= (store (store .cse10 v_subst_23 (select .cse11 v_subst_23)) .cse87 (select .cse10 .cse87)) .cse11)))))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse17) (or .cse0 (let ((.cse99 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (let ((.cse98 (@diff .cse99 .cse10))) (let ((.cse92 (store .cse99 .cse98 0))) (let ((.cse93 (@diff .cse92 .cse10))) (let ((.cse89 (store .cse92 .cse93 0))) (let ((.cse88 (@diff .cse89 .cse10))) (let ((.cse101 (store .cse89 .cse88 0))) (let ((.cse100 (@diff .cse101 .cse10))) (let ((.cse96 (store .cse101 .cse100 0))) (let ((.cse97 (@diff .cse96 .cse10))) (let ((.cse90 (store .cse96 .cse97 0))) (let ((.cse91 (@diff .cse90 .cse10))) (let ((.cse94 (store .cse90 .cse91 0))) (let ((.cse95 (@diff .cse94 .cse10))) (and (or (< (+ .cse88 27) .cse17) (= .cse10 .cse89)) (or (= .cse10 .cse90) (< (+ .cse91 27) .cse17)) (or (= .cse10 .cse92) (< (+ .cse93 27) .cse17)) (or (= .cse10 .cse94) (< (+ 27 .cse95) .cse17)) .cse52 (= .cse10 (store .cse94 .cse95 0)) (or (= .cse10 .cse96) (< (+ .cse97 27) .cse17)) (or (< (+ .cse98 27) .cse17) (= .cse10 .cse99)) (or (< (+ .cse100 27) .cse17) (= .cse10 .cse101)) .cse53)))))))))))))))) (= |c_~#cache~0.base| 4) (or (exists ((v_subst_26 Int) (v_prenex_3 Int)) (and (<= (+ 56 v_prenex_3) .cse9) (= .cse11 (store (store .cse10 v_prenex_3 (select .cse11 v_prenex_3)) v_subst_26 (select .cse11 v_subst_26))) (<= (+ 84 v_subst_26) .cse9))) (exists ((v_subst_23 Int)) (and (<= (+ 84 v_subst_23) .cse9) (= (store .cse10 v_subst_23 (select .cse11 v_subst_23)) .cse11))) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (v_subst_22 Int)) (and (= (store (store .cse10 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (select .cse11 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|)) v_subst_22 (select .cse11 v_subst_22)) .cse11) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| 84) .cse9) (<= (+ 56 v_subst_22) .cse9))) (exists ((v_subst_24 Int) (v_subst_21 Int)) (and (<= (+ 84 v_subst_21) .cse9) (= (store (store .cse10 v_subst_21 (select .cse11 v_subst_21)) v_subst_24 (select .cse11 v_subst_24)) .cse11) (<= (+ v_subst_24 28) .cse9))) (exists ((v_subst_25 Int) (v_prenex_2 Int) (v_subst_20 Int)) (and (not (= v_subst_25 v_subst_20)) (<= (+ 84 v_prenex_2) .cse9) (<= (+ v_subst_25 28) .cse9) (not (= v_subst_20 v_prenex_2)) (<= (+ 56 v_subst_20) .cse9) (= .cse11 (store (store (store .cse10 v_prenex_2 (select .cse11 v_prenex_2)) v_subst_20 (select .cse11 v_subst_20)) v_subst_25 (select .cse11 v_subst_25))) (not (= v_subst_25 v_prenex_2)))))))))))))))))))) is different from true [2024-09-22 12:27:16,235 WARN L539 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