./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity GENERATOR_WITH_CONTEXT -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 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_72-funloop_hard_racing.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity GENERATOR_WITH_CONTEXT -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-17 04:35:47,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 04:35:47,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 04:35:47,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 04:35:47,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 04:35:47,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 04:35:47,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 04:35:47,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 04:35:47,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 04:35:47,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 04:35:47,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 04:35:47,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 04:35:47,175 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 04:35:47,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 04:35:47,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 04:35:47,177 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 04:35:47,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 04:35:47,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 04:35:47,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 04:35:47,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 04:35:47,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 04:35:47,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 04:35:47,179 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 04:35:47,179 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 04:35:47,180 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 04:35:47,180 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 04:35:47,180 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 04:35:47,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 04:35:47,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 04:35:47,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 04:35:47,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 04:35:47,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 04:35:47,182 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 04:35:47,182 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 04:35:47,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 04:35:47,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 04:35:47,183 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 04:35:47,183 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 04:35:47,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 04:35:47,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 04:35:47,183 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 04:35:47,184 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 -> 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: TraceCheck mode for conditional commutativity -> GENERATOR_WITH_CONTEXT [2024-10-17 04:35:47,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 04:35:47,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 04:35:47,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 04:35:47,400 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 04:35:47,400 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 04:35:47,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2024-10-17 04:35:48,719 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 04:35:48,937 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 04:35:48,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2024-10-17 04:35:48,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5a8dedca6/a896fb3c35284e78a18362feef447aa8/FLAG296d5fe23 [2024-10-17 04:35:48,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5a8dedca6/a896fb3c35284e78a18362feef447aa8 [2024-10-17 04:35:48,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 04:35:48,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 04:35:48,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 04:35:48,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 04:35:48,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 04:35:48,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 04:35:48" (1/1) ... [2024-10-17 04:35:48,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502fc794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:48, skipping insertion in model container [2024-10-17 04:35:48,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 04:35:48" (1/1) ... [2024-10-17 04:35:49,022 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 04:35:49,332 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2024-10-17 04:35:49,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 04:35:49,369 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 04:35:49,396 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2024-10-17 04:35:49,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 04:35:49,449 INFO L204 MainTranslator]: Completed translation [2024-10-17 04:35:49,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:49 WrapperNode [2024-10-17 04:35:49,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 04:35:49,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 04:35:49,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 04:35:49,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 04:35:49,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:49" (1/1) ... [2024-10-17 04:35:49,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:49" (1/1) ... [2024-10-17 04:35:49,504 INFO L138 Inliner]: procedures = 272, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 285 [2024-10-17 04:35:49,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 04:35:49,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 04:35:49,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 04:35:49,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 04:35:49,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:49" (1/1) ... [2024-10-17 04:35:49,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:49" (1/1) ... [2024-10-17 04:35:49,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:49" (1/1) ... [2024-10-17 04:35:49,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:49" (1/1) ... [2024-10-17 04:35:49,528 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:49" (1/1) ... [2024-10-17 04:35:49,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:49" (1/1) ... [2024-10-17 04:35:49,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:49" (1/1) ... [2024-10-17 04:35:49,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:49" (1/1) ... [2024-10-17 04:35:49,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 04:35:49,545 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 04:35:49,545 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 04:35:49,545 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 04:35:49,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:49" (1/1) ... [2024-10-17 04:35:49,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 04:35:49,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:35:49,580 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-10-17 04:35:49,584 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-10-17 04:35:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-17 04:35:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-17 04:35:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-17 04:35:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-17 04:35:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-17 04:35:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-17 04:35:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 04:35:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-17 04:35:49,625 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-17 04:35:49,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 04:35:49,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 04:35:49,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 04:35:49,628 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 04:35:49,767 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 04:35:49,770 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 04:35:50,077 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 04:35:50,078 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 04:35:50,270 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 04:35:50,271 INFO L314 CfgBuilder]: Removed 35 assume(true) statements. [2024-10-17 04:35:50,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 04:35:50 BoogieIcfgContainer [2024-10-17 04:35:50,272 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 04:35:50,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 04:35:50,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 04:35:50,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 04:35:50,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 04:35:48" (1/3) ... [2024-10-17 04:35:50,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea85be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 04:35:50, skipping insertion in model container [2024-10-17 04:35:50,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:35:49" (2/3) ... [2024-10-17 04:35:50,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea85be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 04:35:50, skipping insertion in model container [2024-10-17 04:35:50,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 04:35:50" (3/3) ... [2024-10-17 04:35:50,280 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2024-10-17 04:35:50,295 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 04:35:50,295 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-17 04:35:50,295 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 04:35:50,334 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-17 04:35:50,369 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 04:35:50,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 04:35:50,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:35:50,371 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-10-17 04:35:50,372 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-10-17 04:35:50,461 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 04:35:50,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:35:50,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-17 04:35:50,481 INFO L333 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;@2a8805dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR_WITH_CONTEXT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 04:35:50,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 04:35:50,862 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:35:50,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:35:50,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1084761360, now seen corresponding path program 1 times [2024-10-17 04:35:50,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:35:50,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710547283] [2024-10-17 04:35:50,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:35:50,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:35:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:35:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:35:51,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:35:51,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710547283] [2024-10-17 04:35:51,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710547283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 04:35:51,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 04:35:51,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 04:35:51,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103429737] [2024-10-17 04:35:51,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 04:35:51,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-17 04:35:51,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:35:51,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-17 04:35:51,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-17 04:35:51,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:35:51,185 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:35:51,186 INFO L472 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-10-17 04:35:51,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:35:51,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:35:51,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-17 04:35:51,246 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:35:51,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:35:51,247 INFO L85 PathProgramCache]: Analyzing trace with hash -747723976, now seen corresponding path program 1 times [2024-10-17 04:35:51,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:35:51,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724426117] [2024-10-17 04:35:51,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:35:51,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:35:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:35:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:35:51,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:35:51,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724426117] [2024-10-17 04:35:51,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724426117] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:35:51,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852401511] [2024-10-17 04:35:51,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:35:51,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:35:51,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:35:51,378 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-10-17 04:35:51,381 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-10-17 04:35:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:35:51,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-17 04:35:51,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:35:51,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:35:51,495 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:35:51,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:35:51,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852401511] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:35:51,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:35:51,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-17 04:35:51,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558699236] [2024-10-17 04:35:51,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:35:51,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 04:35:51,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:35:51,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 04:35:51,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-17 04:35:51,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:35:51,520 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:35:51,520 INFO L472 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-10-17 04:35:51,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:35:51,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:35:51,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:35:51,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:35:51,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-17 04:35:51,794 WARN L453 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-10-17 04:35:51,798 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:35:51,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:35:51,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1928047856, now seen corresponding path program 2 times [2024-10-17 04:35:51,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:35:51,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748137568] [2024-10-17 04:35:51,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:35:51,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:35:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:35:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:35:51,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:35:51,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748137568] [2024-10-17 04:35:51,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748137568] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:35:51,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406755642] [2024-10-17 04:35:51,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 04:35:51,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:35:51,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:35:51,928 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-10-17 04:35:51,929 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-10-17 04:35:52,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 04:35:52,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 04:35:52,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 04:35:52,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:35:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:35:52,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:35:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:35:52,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406755642] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:35:52,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:35:52,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-17 04:35:52,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530002687] [2024-10-17 04:35:52,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:35:52,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-17 04:35:52,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:35:52,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-17 04:35:52,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-17 04:35:52,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:35:52,097 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:35:52,097 INFO L472 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-10-17 04:35:52,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:35:52,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:35:52,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:35:52,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:35:52,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:35:52,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:35:52,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-17 04:35:52,375 WARN L453 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-10-17 04:35:52,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:35:52,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:35:52,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1241085968, now seen corresponding path program 3 times [2024-10-17 04:35:52,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:35:52,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573219883] [2024-10-17 04:35:52,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:35:52,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:35:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:35:52,648 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:35:52,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:35:52,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573219883] [2024-10-17 04:35:52,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573219883] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:35:52,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483778769] [2024-10-17 04:35:52,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 04:35:52,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:35:52,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:35:52,651 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-10-17 04:35:52,652 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-10-17 04:35:52,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-17 04:35:52,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 04:35:52,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-17 04:35:52,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:35:52,753 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-10-17 04:35:52,820 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 04:35:52,820 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-10-17 04:35:52,840 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-10-17 04:35:52,893 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-10-17 04:35:52,930 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-10-17 04:35:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:35:52,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:35:57,023 WARN L851 $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-10-17 04:35:57,037 WARN L851 $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-10-17 04:35:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2024-10-17 04:35:57,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483778769] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:35:57,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:35:57,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-17 04:35:57,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677475426] [2024-10-17 04:35:57,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:35:57,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-17 04:35:57,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:35:57,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-17 04:35:57,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=122, Unknown=4, NotChecked=46, Total=210 [2024-10-17 04:35:57,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:35:57,159 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:35:57,159 INFO L472 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-10-17 04:35:57,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:35:57,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:35:57,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:35:57,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:35:57,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:35:57,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:35:57,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:35:57,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:35:57,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-17 04:35:57,517 WARN L453 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-10-17 04:35:57,517 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:35:57,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:35:57,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1875016076, now seen corresponding path program 1 times [2024-10-17 04:35:57,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:35:57,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018682017] [2024-10-17 04:35:57,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:35:57,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:35:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:35:58,995 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:35:58,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:35:58,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018682017] [2024-10-17 04:35:58,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018682017] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:35:58,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055578871] [2024-10-17 04:35:58,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:35:58,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:35:58,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:35:58,998 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-10-17 04:35:58,999 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-10-17 04:35:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:35:59,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-17 04:35:59,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:35:59,094 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-10-17 04:35:59,164 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 04:35:59,164 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-10-17 04:35:59,187 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-10-17 04:35:59,243 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-10-17 04:35:59,295 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-10-17 04:35:59,344 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-10-17 04:35:59,458 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-10-17 04:35:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:35:59,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:36:11,626 WARN L851 $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-10-17 04:36:15,699 WARN L851 $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-10-17 04:36:15,815 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 4 not checked. [2024-10-17 04:36:15,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055578871] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:36:15,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:36:15,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 7] total 26 [2024-10-17 04:36:15,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020766326] [2024-10-17 04:36:15,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:36:15,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-17 04:36:15,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:36:15,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-17 04:36:15,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=514, Unknown=4, NotChecked=94, Total=702 [2024-10-17 04:36:15,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:36:15,818 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:36:15,819 INFO L472 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-10-17 04:36:15,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:36:15,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:36:15,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:36:15,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:36:15,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:36:17,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:36:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:36:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:36:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:36:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-17 04:36:17,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-17 04:36:17,889 WARN L453 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-10-17 04:36:17,890 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:36:18,052 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 04:36:18,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 628 treesize of output 594 [2024-10-17 04:36:18,201 INFO L85 PathProgramCache]: Analyzing trace with hash -647405694, now seen corresponding path program 1 times [2024-10-17 04:36:18,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:36:18,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:36:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 04:36:18,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 04:36:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 04:36:18,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:36:18,244 INFO L85 PathProgramCache]: Analyzing trace with hash 310715724, now seen corresponding path program 2 times [2024-10-17 04:36:18,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:36:18,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693414961] [2024-10-17 04:36:18,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:36:18,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:36:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:36:18,716 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:36:18,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:36:18,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693414961] [2024-10-17 04:36:18,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693414961] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:36:18,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767874028] [2024-10-17 04:36:18,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 04:36:18,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:36:18,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:36:18,720 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-10-17 04:36:18,722 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-10-17 04:36:18,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 04:36:18,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 04:36:18,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-17 04:36:18,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:36:18,819 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-10-17 04:36:18,869 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 04:36:18,869 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-10-17 04:36:18,889 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-10-17 04:36:18,982 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-10-17 04:36:19,047 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-10-17 04:36:19,079 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-10-17 04:36:21,638 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-10-17 04:36:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:36:21,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:36:34,407 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| (+ (* |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_34|) 0))) is different from false [2024-10-17 04:36:36,020 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_375 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| (+ (* |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_375) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34|) 0))) is different from false [2024-10-17 04:36:37,617 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_375 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| (+ (* |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_375) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34|) 0))) is different from false [2024-10-17 04:36:39,650 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_372 Int) (v_ArrVal_375 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| (+ (* |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| (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_372 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_375) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34|) 0))) is different from false [2024-10-17 04:36:41,698 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_372 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_375 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| 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_36| (+ v_ArrVal_372 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_375) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| 28)))) is different from false [2024-10-17 04:36:43,728 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_375 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| 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_371) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ v_ArrVal_372 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_375) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_34| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| 28)))) is different from false [2024-10-17 04:36:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 7 not checked. [2024-10-17 04:36:43,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767874028] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:36:43,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:36:43,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 26 [2024-10-17 04:36:43,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045349523] [2024-10-17 04:36:43,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:36:43,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-17 04:36:43,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:36:43,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-17 04:36:43,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=331, Unknown=14, NotChecked=258, Total=702 [2024-10-17 04:36:43,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:36:43,870 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:36:43,870 INFO L472 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-10-17 04:36:43,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:36:43,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:36:43,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:36:43,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:36:43,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-17 04:36:43,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:36:49,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:36:49,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:36:49,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:36:49,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:36:49,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-17 04:36:49,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:36:49,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-17 04:36:50,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:36:50,078 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:36:50,174 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 04:36:50,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1227 treesize of output 1157 [2024-10-17 04:36:50,435 INFO L85 PathProgramCache]: Analyzing trace with hash -326132181, now seen corresponding path program 1 times [2024-10-17 04:36:50,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:36:50,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:36:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:36:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-17 04:36:50,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:36:50,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:36:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:36:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:36:50,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:36:50,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2141943016, now seen corresponding path program 3 times [2024-10-17 04:36:50,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:36:50,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596446791] [2024-10-17 04:36:50,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:36:50,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:36:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:36:51,886 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:36:51,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:36:51,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596446791] [2024-10-17 04:36:51,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596446791] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:36:51,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513881140] [2024-10-17 04:36:51,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 04:36:51,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:36:51,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:36:51,889 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-10-17 04:36:51,890 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-10-17 04:36:52,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-17 04:36:52,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 04:36:52,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-17 04:36:52,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:36:52,045 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-10-17 04:36:52,188 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-17 04:36:52,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-10-17 04:36:52,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 04:36:52,371 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-10-17 04:36:52,472 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-10-17 04:36:55,524 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-10-17 04:36:59,204 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-10-17 04:37:07,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 61 [2024-10-17 04:37:30,638 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 80 treesize of output 66 [2024-10-17 04:37:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:37:30,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:37:54,836 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 04:37:56,882 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_612) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 04:37:58,899 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (* |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_612) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0))) is different from false [2024-10-17 04:38:00,943 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (v_ArrVal_609 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_609 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_612) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 04:38:03,016 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (v_ArrVal_609 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ .cse0 28 |c_~#cache~0.offset|)) (= (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_46| (+ v_ArrVal_609 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_612) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0)))) is different from false [2024-10-17 04:38:03,041 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_31| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_31| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((v_ArrVal_612 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (v_ArrVal_609 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_31| 28))) (or (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ 28 |c_~#cache~0.offset| .cse0)) (= (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_46| (+ v_ArrVal_609 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_612) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0)))))) is different from false [2024-10-17 04:38:05,162 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_31| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (v_ArrVal_609 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_31| 28))) (or (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46|) (< |v_t_funThread1of1ForFork0_~i~0#1_31| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ 28 |c_~#cache~0.offset| .cse0)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| (+ v_ArrVal_609 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_612) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0)))) is different from false [2024-10-17 04:38:07,255 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_31| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (v_ArrVal_609 Int) (v_ArrVal_606 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_31| 28))) (or (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46|) (= (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_606 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| (+ v_ArrVal_609 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_612) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_31| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ 28 |c_~#cache~0.offset| .cse0))))) is different from false [2024-10-17 04:38:09,362 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (v_ArrVal_609 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_606 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| (+ v_ArrVal_606 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| (+ v_ArrVal_609 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_612) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 28)))) is different from false [2024-10-17 04:38:11,416 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_605 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (v_ArrVal_609 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_606 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (= (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_605) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| (+ v_ArrVal_606 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| (+ v_ArrVal_609 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_612) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 28)))) is different from false [2024-10-17 04:38:11,710 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 32 not checked. [2024-10-17 04:38:11,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513881140] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:38:11,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:38:11,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 39 [2024-10-17 04:38:11,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736303909] [2024-10-17 04:38:11,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:38:11,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-17 04:38:11,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:38:11,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-17 04:38:11,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=692, Unknown=39, NotChecked=650, Total=1560 [2024-10-17 04:38:11,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:38:11,712 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:38:11,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.125) internal successors, (165), 39 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 04:38:11,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:38:11,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:38:11,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:38:11,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:38:11,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-17 04:38:11,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:38:11,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:38:13,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:38:15,473 WARN L539 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-10-17 04:38:21,332 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-10-17 04:38:23,345 WARN L539 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-10-17 04:38:25,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:38:30,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:38:32,683 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-10-17 04:38:34,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:38:36,659 WARN L539 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-10-17 04:38:56,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:38:58,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:39:00,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:39:02,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:39:38,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:39:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:39:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:39:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:39:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-17 04:39:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:39:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-17 04:39:38,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-17 04:39:38,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable9 [2024-10-17 04:39:38,534 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:39:38,695 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 04:39:38,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2561 treesize of output 2435 [2024-10-17 04:39:38,816 INFO L85 PathProgramCache]: Analyzing trace with hash 175644553, now seen corresponding path program 1 times [2024-10-17 04:39:38,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:39:38,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:39:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:39:39,201 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-10-17 04:39:39,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:39:39,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:39:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:39:39,335 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-10-17 04:39:39,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-17 04:39:39,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-17 04:39:39,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-17 04:39:39,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:39:39,339 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:39:39,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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-10-17 04:39:39,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:39:39,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:39:39,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:39:39,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:39:39,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-17 04:39:39,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:39:39,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-17 04:39:39,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:39:39,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:39:39,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:39:39,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:39:39,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:39:39,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-17 04:39:39,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:39:39,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-17 04:39:39,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:39:39,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable11 [2024-10-17 04:39:39,497 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:39:39,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:39:39,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1862131292, now seen corresponding path program 4 times [2024-10-17 04:39:39,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:39:39,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745223421] [2024-10-17 04:39:39,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:39:39,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:39:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:45:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:45:46,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:45:46,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745223421] [2024-10-17 04:45:46,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745223421] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:45:46,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293988737] [2024-10-17 04:45:46,308 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-17 04:45:46,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:45:46,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:45:46,310 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-10-17 04:45:46,310 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-10-17 04:45:46,649 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-17 04:45:46,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 04:45:46,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-17 04:45:46,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:45:46,665 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-10-17 04:45:46,885 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 04:45:46,886 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-10-17 04:45:47,175 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-10-17 04:45:47,446 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-10-17 04:45:47,723 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-10-17 04:45:53,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-10-17 04:45:58,835 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-10-17 04:46:14,977 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 81 treesize of output 66 [2024-10-17 04:46:17,770 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 178 treesize of output 155 [2024-10-17 04:46:36,890 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 79 treesize of output 66 [2024-10-17 04:46:46,618 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 229 treesize of output 190 [2024-10-17 04:46:52,424 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 238 treesize of output 197 [2024-10-17 04:47:36,581 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 282 treesize of output 226 [2024-10-17 04:47:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 8 proven. 129 refuted. 5 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:47:36,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:48:23,258 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |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_61|) 0))) is different from false [2024-10-17 04:48:25,295 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0))) is different from false [2024-10-17 04:48:25,338 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_971 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= 0 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_971))) (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_61|)))) is different from false [2024-10-17 04:48:25,348 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |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_971) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_969)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_971) |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_61|) 0))) is different from false [2024-10-17 04:48:25,402 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse0 28 |c_~#cache~0.offset|)) (= (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_63| v_ArrVal_969)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_971) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|)))) is different from false [2024-10-17 04:48:25,418 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (= (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_63| v_ArrVal_969)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_971) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset| .cse0))))) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-17 04:48:27,512 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_969))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_971) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset| .cse0))))) is different from false [2024-10-17 04:48:29,581 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_969))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_971) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset| .cse0))))) is different from false [2024-10-17 04:48:29,669 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_969)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_971) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset| .cse0))))) is different from false [2024-10-17 04:48:31,688 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_42| Int)) (or (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_42| 28)))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_969)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_971) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |v_t_funThread1of1ForFork0_~i~0#1_42| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset| .cse0))))) (< |v_t_funThread1of1ForFork0_~i~0#1_42| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-17 04:48:33,824 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_~i~0#1_42| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (= (select (select (store (let ((.cse1 (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 .cse1 |c_~#cache~0.base| (store (let ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse3 (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_42| 28)))) (store .cse2 .cse3 (select .cse2 .cse3))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_969))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_971) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_42| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |v_t_funThread1of1ForFork0_~i~0#1_42| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset| .cse0))))) is different from false [2024-10-17 04:48:35,939 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_~i~0#1_42| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (= 0 (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_962 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (let ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse3 (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_42| 28)))) (store .cse2 .cse3 (select .cse2 .cse3))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_969))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_971) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|)) (< |v_t_funThread1of1ForFork0_~i~0#1_42| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |v_t_funThread1of1ForFork0_~i~0#1_42| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset| .cse0))))) is different from false [2024-10-17 04:48:38,091 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_~i~0#1_42| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_969 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) (< |v_t_funThread1of1ForFork0_~i~0#1_42| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |v_t_funThread1of1ForFork0_~i~0#1_42| 1)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_42| 28)))) (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_962 (- 1))) .cse2 (select .cse1 .cse2))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_969)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_971) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset| .cse0))))) is different from false [2024-10-17 04:48:40,125 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_~i~0#1_42| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_969 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse1 (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_42| 28))) (.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_42| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |v_t_funThread1of1ForFork0_~i~0#1_42| 1)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|))) (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_962 (- 1))) .cse1 (select .cse2 .cse1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_969)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_971) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset| .cse0))))) is different from false [2024-10-17 04:48:42,298 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_~i~0#1_42| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_969 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse1 (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_42| 28))) (.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 28)) (= (select (select (store (let ((.cse2 (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 .cse2 |c_~#cache~0.base| (store (let ((.cse3 (select .cse2 |c_~#cache~0.base|))) (store (store .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_962 (- 1))) .cse1 (select .cse3 .cse1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_969))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_971) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_42| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |v_t_funThread1of1ForFork0_~i~0#1_42| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset| .cse0))))) is different from false [2024-10-17 04:48:44,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_~i~0#1_42| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_959 Int) (v_ArrVal_969 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse1 (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_42| 28))) (.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 28)) (= (select (select (store (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_959 (- 1)))))) (store .cse2 |c_~#cache~0.base| (store (let ((.cse3 (select .cse2 |c_~#cache~0.base|))) (store (store .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_962 (- 1))) .cse1 (select .cse3 .cse1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_969))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_971) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_42| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |v_t_funThread1of1ForFork0_~i~0#1_42| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset| .cse0))))) is different from false [2024-10-17 04:48:46,637 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_~i~0#1_42| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_959 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_969 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (|~#cache~0.offset| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28)) (.cse0 (+ |~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_42| 28)))) (or (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|)) (< (+ |~#cache~0.offset| .cse1) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ |~#cache~0.offset| 28 .cse1)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |v_t_funThread1of1ForFork0_~i~0#1_42| 1)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|))) (store (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ v_ArrVal_959 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_962 (- 1))) .cse0 (select .cse2 .cse0))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_969)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_971) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0)))) is different from false [2024-10-17 04:48:48,744 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_~i~0#1_42| Int) (v_ArrVal_959 Int) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_962 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_958 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (|~#cache~0.offset| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28)) (.cse0 (+ |~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_42| 28)))) (or (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_958) |c_~#cache~0.base|))) (store (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ v_ArrVal_959 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_962 (- 1))) .cse0 (select .cse1 .cse0))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_969)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_971) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< (+ |~#cache~0.offset| .cse2) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ |~#cache~0.offset| 28 .cse2)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |v_t_funThread1of1ForFork0_~i~0#1_42| 1))))) is different from false [2024-10-17 04:48:49,519 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 142 not checked. [2024-10-17 04:48:49,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293988737] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:48:49,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:48:49,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 23] total 65 [2024-10-17 04:48:49,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516238341] [2024-10-17 04:48:49,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:48:49,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-10-17 04:48:49,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:48:49,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-10-17 04:48:49,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=2005, Unknown=82, NotChecked=1962, Total=4290 [2024-10-17 04:48:49,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:48:49,522 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:48:49,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 4.318181818181818) internal successors, (285), 65 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-10-17 04:48:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:48:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:48:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:48:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:48:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-17 04:48:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:48:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-17 04:48:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:48:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:48:54,484 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse10 ((as const (Array Int Int)) 0))) (let ((.cse48 (@diff .cse21 .cse10))) (let ((.cse73 (store .cse21 .cse48 0))) (let ((.cse64 (@diff .cse73 .cse10))) (let ((.cse72 (store .cse73 .cse64 0))) (let ((.cse65 (@diff .cse72 .cse10))) (let ((.cse71 (store .cse72 .cse65 0))) (let ((.cse66 (@diff .cse71 .cse10))) (let ((.cse70 (store .cse71 .cse66 0))) (let ((.cse67 (@diff .cse70 .cse10))) (let ((.cse69 (store .cse70 .cse67 0))) (let ((.cse68 (@diff .cse69 .cse10))) (let ((.cse8 (* 7 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse24 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse46 (= .cse10 .cse73)) (.cse47 (= .cse10 .cse21)) (.cse49 (= .cse10 .cse72)) (.cse39 (= .cse10 .cse71)) (.cse44 (= .cse10 .cse70)) (.cse1 (= .cse10 .cse69)) (.cse27 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse40 (store .cse69 .cse68 0))) (let ((.cse38 (= .cse10 (select |c_#memory_int| |c_~#cache~0.base|))) (.cse23 (= .cse10 .cse40)) (.cse22 (or .cse1 (< (+ .cse68 27) .cse27))) (.cse7 (or .cse44 (< (+ .cse67 27) .cse27))) (.cse5 (or .cse39 (< (+ .cse66 27) .cse27))) (.cse6 (or (< (+ .cse65 27) .cse27) .cse49)) (.cse11 (select |c_#memory_int| 4)) (.cse9 (+ .cse27 |c_~#cache~0.offset|)) (.cse2 (or (< (+ .cse48 27) .cse27) .cse47)) (.cse4 (or .cse46 (< (+ .cse64 27) .cse27))) (.cse0 (not .cse24)) (.cse42 (<= (+ |c_ULTIMATE.start_main_~i~3#1| 20) .cse8)) (.cse43 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse45 (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse3 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ |c_ULTIMATE.start_main_~i~3#1| 13) .cse8))) (or (exists ((v_prenex_5 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ 84 v_prenex_5) .cse9) (= (store (store .cse10 v_prenex_5 (select .cse11 v_prenex_5)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse11) (<= (+ 112 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse9))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_subst_21 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse9) (<= (+ 112 v_subst_21) .cse9) (= .cse11 (store (store .cse10 v_subst_21 (select .cse11 v_subst_21)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (store (store .cse10 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (select .cse11 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse11) (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse9) (<= (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) .cse9))) (exists ((v_prenex_3 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_subst_22 Int)) (let ((.cse14 (select .cse11 v_prenex_3)) (.cse16 (select .cse11 v_subst_22))) (let ((.cse12 (store (store .cse10 v_prenex_3 .cse14) v_subst_22 .cse16)) (.cse13 (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse15 (store .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse13 1)))) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse9) (= (store .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse13) .cse11) (not (= v_subst_22 v_prenex_3)) (= .cse14 (select .cse15 v_prenex_3)) (= (select .cse15 v_subst_22) .cse16) (<= (+ 84 v_subst_22) .cse9) (<= (+ 112 v_prenex_3) .cse9)))))) (exists ((v_prenex_4 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse9) (= (store (store .cse10 v_prenex_4 (select .cse11 v_prenex_4)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse11) (<= (+ 112 v_prenex_4) .cse9))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse11) (<= (+ 112 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse9)))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (forall ((v_ArrVal_962 Int) (|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_~i~0#1_42| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_959 Int) (v_ArrVal_969 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse18 (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_42| 28))) (.cse17 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< (+ |c_~#cache~0.offset| .cse17) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< .cse18 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 28)) (= (select (select (store (let ((.cse19 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_959 (- 1)))))) (store .cse19 |c_~#cache~0.base| (store (let ((.cse20 (select .cse19 |c_~#cache~0.base|))) (store (store .cse20 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_962 (- 1))) .cse18 (select .cse20 .cse18))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_969))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_971) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_42| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |v_t_funThread1of1ForFork0_~i~0#1_42| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset| .cse17))))) (or (and .cse2 .cse22 .cse3 .cse4 .cse23 .cse5 .cse6 .cse7) .cse24) (or (let ((.cse33 (store .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (let ((.cse32 (@diff .cse33 .cse10))) (let ((.cse25 (store .cse33 .cse32 0))) (let ((.cse26 (@diff .cse25 .cse10))) (let ((.cse37 (store .cse25 .cse26 0))) (let ((.cse36 (@diff .cse37 .cse10))) (let ((.cse29 (store .cse37 .cse36 0))) (let ((.cse28 (@diff .cse29 .cse10))) (let ((.cse34 (store .cse29 .cse28 0))) (let ((.cse35 (@diff .cse34 .cse10))) (let ((.cse30 (store .cse34 .cse35 0))) (let ((.cse31 (@diff .cse30 .cse10))) (and (or (= .cse10 .cse25) (< (+ .cse26 27) .cse27)) (or (< (+ .cse28 27) .cse27) (= .cse10 .cse29)) (or (= .cse10 .cse30) (< (+ .cse31 27) .cse27)) (or (< (+ .cse32 27) .cse27) (= .cse10 .cse33)) .cse3 (or (= .cse10 .cse34) (< (+ .cse35 27) .cse27)) (= .cse10 (store .cse30 .cse31 0)) (or (< (+ .cse36 27) .cse27) (= .cse10 .cse37))))))))))))))) .cse24) (or .cse38 .cse24) .cse38 (or .cse0 (and .cse2 .cse3 .cse4 .cse39 .cse6 (<= (+ |c_ULTIMATE.start_main_~i~3#1| 6) .cse8))) (or .cse0 (let ((.cse41 (@diff .cse40 .cse10))) (and .cse2 (= .cse10 (store .cse40 .cse41 0)) (or .cse23 (< (+ .cse41 27) .cse27)) .cse22 .cse4 .cse5 .cse42 .cse6 .cse7 .cse43))) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (or (and .cse2 .cse3 .cse4 .cse5 .cse44 .cse6) .cse24) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse9) (= |c_~#cache~0.offset| 0) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (and (= (store .cse10 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (select .cse11 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)) .cse11) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 28) .cse9))) (= (select |c_#valid| 4) 1) (= .cse10 .cse11) (or (= .cse10 (store .cse45 0 0)) .cse0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (or (exists ((v_subst_21 Int)) (and (= (store .cse10 v_subst_21 (select .cse11 v_subst_21)) .cse11) (<= (+ 84 v_subst_21) .cse9))) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_subst_22 Int)) (and (= .cse11 (store (store .cse10 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (select .cse11 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)) v_subst_22 (select .cse11 v_subst_22))) (<= (+ 56 v_subst_22) .cse9) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 84) .cse9)))) (or (and .cse46 (or .cse47 (< .cse48 1)) (<= |c_ULTIMATE.start_main_~i~3#1| 1) .cse43) .cse0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (or (exists ((v_subst_20 Int)) (and (= .cse11 (store .cse10 v_subst_20 (select .cse11 v_subst_20))) (<= (+ 56 v_subst_20) .cse9))) (exists ((v_subst_19 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (and (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) .cse9) (= (store (store .cse10 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (select .cse11 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)) v_subst_19 (select .cse11 v_subst_19)) .cse11) (<= (+ v_subst_19 28) .cse9)))) (or (and .cse2 .cse3 .cse4 .cse49) .cse24) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (= |c_ULTIMATE.start_main_~i~3#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse27) (or .cse0 (let ((.cse61 (store .cse45 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (let ((.cse60 (@diff .cse61 .cse10))) (let ((.cse54 (store .cse61 .cse60 0))) (let ((.cse55 (@diff .cse54 .cse10))) (let ((.cse51 (store .cse54 .cse55 0))) (let ((.cse50 (@diff .cse51 .cse10))) (let ((.cse63 (store .cse51 .cse50 0))) (let ((.cse62 (@diff .cse63 .cse10))) (let ((.cse58 (store .cse63 .cse62 0))) (let ((.cse59 (@diff .cse58 .cse10))) (let ((.cse52 (store .cse58 .cse59 0))) (let ((.cse53 (@diff .cse52 .cse10))) (let ((.cse56 (store .cse52 .cse53 0))) (let ((.cse57 (@diff .cse56 .cse10))) (and (or (< (+ .cse50 27) .cse27) (= .cse10 .cse51)) (or (= .cse10 .cse52) (< (+ .cse53 27) .cse27)) (or (= .cse10 .cse54) (< (+ .cse55 27) .cse27)) (or (= .cse10 .cse56) (< (+ 27 .cse57) .cse27)) .cse42 (= .cse10 (store .cse56 .cse57 0)) (or (= .cse10 .cse58) (< (+ .cse59 27) .cse27)) (or (< (+ .cse60 27) .cse27) (= .cse10 .cse61)) (or (< (+ .cse62 27) .cse27) (= .cse10 .cse63)) .cse43)))))))))))))))) (= |c_~#cache~0.base| 4) (or (and .cse3 .cse47) .cse24)))))))))))))))) is different from true [2024-10-17 04:49:10,044 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse33 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse10 ((as const (Array Int Int)) 0))) (let ((.cse61 (@diff .cse33 .cse10))) (let ((.cse59 (store .cse33 .cse61 0))) (let ((.cse60 (@diff .cse59 .cse10))) (let ((.cse69 (store .cse59 .cse60 0))) (let ((.cse62 (@diff .cse69 .cse10))) (let ((.cse68 (store .cse69 .cse62 0))) (let ((.cse63 (@diff .cse68 .cse10))) (let ((.cse67 (store .cse68 .cse63 0))) (let ((.cse64 (@diff .cse67 .cse10))) (let ((.cse66 (store .cse67 .cse64 0))) (let ((.cse65 (@diff .cse66 .cse10))) (let ((.cse8 (* 7 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse19 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse44 (= .cse10 .cse69)) (.cse34 (= .cse10 .cse68)) (.cse39 (= .cse10 .cse67)) (.cse1 (= .cse10 .cse66)) (.cse22 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse35 (store .cse66 .cse65 0))) (let ((.cse18 (= .cse10 .cse35)) (.cse17 (or .cse1 (< (+ .cse65 27) .cse22))) (.cse7 (or .cse39 (< (+ .cse64 27) .cse22))) (.cse5 (or .cse34 (< (+ .cse63 27) .cse22))) (.cse6 (or (< (+ .cse62 27) .cse22) .cse44)) (.cse11 (select |c_#memory_int| 4)) (.cse9 (+ .cse22 |c_~#cache~0.offset|)) (.cse2 (or (< (+ .cse61 27) .cse22) (= .cse10 .cse33))) (.cse3 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse4 (or (= .cse10 .cse59) (< (+ .cse60 27) .cse22))) (.cse0 (not .cse19)) (.cse37 (<= (+ |c_ULTIMATE.start_main_~i~3#1| 20) .cse8)) (.cse38 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ |c_ULTIMATE.start_main_~i~3#1| 13) .cse8))) (or (exists ((v_prenex_5 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ 84 v_prenex_5) .cse9) (= (store (store .cse10 v_prenex_5 (select .cse11 v_prenex_5)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse11) (<= (+ 112 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse9))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_subst_21 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse9) (<= (+ 112 v_subst_21) .cse9) (= .cse11 (store (store .cse10 v_subst_21 (select .cse11 v_subst_21)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (store (store .cse10 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (select .cse11 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse11) (<= (+ 84 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse9) (<= (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) .cse9))) (exists ((v_prenex_3 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_subst_22 Int)) (let ((.cse14 (select .cse11 v_prenex_3)) (.cse16 (select .cse11 v_subst_22))) (let ((.cse12 (store (store .cse10 v_prenex_3 .cse14) v_subst_22 .cse16)) (.cse13 (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse15 (store .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse13 1)))) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse9) (= (store .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse13) .cse11) (not (= v_subst_22 v_prenex_3)) (= .cse14 (select .cse15 v_prenex_3)) (= (select .cse15 v_subst_22) .cse16) (<= (+ 84 v_subst_22) .cse9) (<= (+ 112 v_prenex_3) .cse9)))))) (exists ((v_prenex_4 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse9) (= (store (store .cse10 v_prenex_4 (select .cse11 v_prenex_4)) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse11) (<= (+ 112 v_prenex_4) .cse9))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) .cse11) (<= (+ 112 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) .cse9)))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (or (and .cse2 .cse17 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7) .cse19) (or (let ((.cse28 (store .cse33 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (let ((.cse27 (@diff .cse28 .cse10))) (let ((.cse20 (store .cse28 .cse27 0))) (let ((.cse21 (@diff .cse20 .cse10))) (let ((.cse32 (store .cse20 .cse21 0))) (let ((.cse31 (@diff .cse32 .cse10))) (let ((.cse24 (store .cse32 .cse31 0))) (let ((.cse23 (@diff .cse24 .cse10))) (let ((.cse29 (store .cse24 .cse23 0))) (let ((.cse30 (@diff .cse29 .cse10))) (let ((.cse25 (store .cse29 .cse30 0))) (let ((.cse26 (@diff .cse25 .cse10))) (and (or (= .cse10 .cse20) (< (+ .cse21 27) .cse22)) (or (< (+ .cse23 27) .cse22) (= .cse10 .cse24)) (or (= .cse10 .cse25) (< (+ .cse26 27) .cse22)) (or (< (+ .cse27 27) .cse22) (= .cse10 .cse28)) .cse3 (or (= .cse10 .cse29) (< (+ .cse30 27) .cse22)) (= .cse10 (store .cse25 .cse26 0)) (or (< (+ .cse31 27) .cse22) (= .cse10 .cse32))))))))))))))) .cse19) (= .cse10 (select |c_#memory_int| |c_~#cache~0.base|)) (or .cse0 (and .cse2 .cse3 .cse4 .cse34 .cse6 (<= (+ |c_ULTIMATE.start_main_~i~3#1| 6) .cse8))) (or .cse0 (let ((.cse36 (@diff .cse35 .cse10))) (and .cse2 (= .cse10 (store .cse35 .cse36 0)) (or .cse18 (< (+ .cse36 27) .cse22)) .cse17 .cse4 .cse5 .cse37 .cse6 .cse7 .cse38))) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (or (and .cse2 .cse3 .cse4 .cse5 .cse39 .cse6) .cse19) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse9) (= |c_~#cache~0.offset| 0) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (and (= (store .cse10 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (select .cse11 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)) .cse11) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 28) .cse9))) (= .cse10 .cse11) (= .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (forall ((v_ArrVal_962 Int) (|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_~i~0#1_42| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_969 Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse40 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< (+ |c_~#cache~0.offset| .cse40) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (= 0 (select (select (store (let ((.cse41 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse33 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_962 (- 1)))))) (store .cse41 |c_~#cache~0.base| (store (let ((.cse42 (select .cse41 |c_~#cache~0.base|)) (.cse43 (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_42| 28)))) (store .cse42 .cse43 (select .cse42 .cse43))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_969))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_971) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|)) (< |v_t_funThread1of1ForFork0_~i~0#1_42| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |v_t_funThread1of1ForFork0_~i~0#1_42| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset| .cse40))))) (or (exists ((v_subst_21 Int)) (and (= (store .cse10 v_subst_21 (select .cse11 v_subst_21)) .cse11) (<= (+ 84 v_subst_21) .cse9))) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_subst_22 Int)) (and (= .cse11 (store (store .cse10 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (select .cse11 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)) v_subst_22 (select .cse11 v_subst_22))) (<= (+ 56 v_subst_22) .cse9) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 84) .cse9)))) (or (exists ((v_subst_20 Int)) (and (= .cse11 (store .cse10 v_subst_20 (select .cse11 v_subst_20))) (<= (+ 56 v_subst_20) .cse9))) (exists ((v_subst_19 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (and (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) .cse9) (= (store (store .cse10 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (select .cse11 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)) v_subst_19 (select .cse11 v_subst_19)) .cse11) (<= (+ v_subst_19 28) .cse9)))) (or (and .cse2 .cse3 .cse4 .cse44) .cse19) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse22) (or .cse0 (let ((.cse56 (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 ((.cse55 (@diff .cse56 .cse10))) (let ((.cse49 (store .cse56 .cse55 0))) (let ((.cse50 (@diff .cse49 .cse10))) (let ((.cse46 (store .cse49 .cse50 0))) (let ((.cse45 (@diff .cse46 .cse10))) (let ((.cse58 (store .cse46 .cse45 0))) (let ((.cse57 (@diff .cse58 .cse10))) (let ((.cse53 (store .cse58 .cse57 0))) (let ((.cse54 (@diff .cse53 .cse10))) (let ((.cse47 (store .cse53 .cse54 0))) (let ((.cse48 (@diff .cse47 .cse10))) (let ((.cse51 (store .cse47 .cse48 0))) (let ((.cse52 (@diff .cse51 .cse10))) (and (or (< (+ .cse45 27) .cse22) (= .cse10 .cse46)) (or (= .cse10 .cse47) (< (+ .cse48 27) .cse22)) (or (= .cse10 .cse49) (< (+ .cse50 27) .cse22)) (or (= .cse10 .cse51) (< (+ 27 .cse52) .cse22)) .cse37 (= .cse10 (store .cse51 .cse52 0)) (or (= .cse10 .cse53) (< (+ .cse54 27) .cse22)) (or (< (+ .cse55 27) .cse22) (= .cse10 .cse56)) (or (< (+ .cse57 27) .cse22) (= .cse10 .cse58)) .cse38)))))))))))))))) (= |c_~#cache~0.base| 4)))))))))))))))) is different from true Killed by 15